Combinatorial Optimization Method Considering Distance in Scheduling Problem

Abstract

In this paper, we focus on the idea of integral designing of problems/methods/distances in metaheuristics for combinatorial optimization problems. As a practical example of the above idea, we reconstruct and propose a method previously proposed by the authors. The above idea is important in combinatorial optimization, where it is necessary to consider the distance according to each problem. Furthermore, the idea is particularly important for methods that use distance for the movement strategy, which was proposed the authors. We report that, based on the above idea, when considering the distance, the proposed method has better search performance than the previous method in the flow shop scheduling problem.