Single Point Combinatorial Optimization Method Using Distance in Scheduling Problem

カテゴリ: 部門大会

論文No: SS3-3

グループ名: 【C】平成30年電気学会電子・情報・システム部門大会プログラム

発行日: 2018/09/05

タイトル(英語): Single Point Combinatorial Optimization Method Using Distance in Scheduling Problem

著者名: Obinata Yuta(Tokyo Metropolitan University),Tamura Kenichi(Tokyo Metropolitan University),Tsuchiya Junichi(Tokyo Metropolitan University),Yasuda Keiichiro(Tokyo Metropolitan University)

著者名(英語): Yuta Obinata|Kenichi Tamura|Junichi Tsuchiya|Keiichiro Yasuda

キーワード: 組合せ最適化|メタヒューリスティクス|距離|スケジューリング問題|Combinatorial Optimization|Metaheuristics|Distance|Scheduling Problem

要約(日本語): In this paper, we focus on the idea of integrally designing problems/methods/distances in metaheuristics for combinatorial optimization problems. As a practical example of the above idea, we reconstruct and propose a single point optimization 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, and the idea is particularly important for methods that use distance for the movement strategy. 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.

PDFファイルサイズ: 204 Kバイト