Simulated AnnealingとGraph-based heuristicsを用いた自動ピッキングシステムの運用計画法

抄録

In this paper, we study operational planning and scheduling benchmark problems in an automatic picking system. These problems have been introduced as practical benchmark problems arising in logistics, and involve assignment and scheduling tasks. Simulated Annealing (SA) and Graph-based heuristics (GbH) have been proposed as methods for solving these benchmark problems. However, SA requires much calculation time and GbH does not sufficiently optimize a part of assignment tasks. We propose a new solution method combining SA and GbH for these benchmark problems. Specifically, SA determines assignment tasks and GbH determines scheduling tasks. In computational experiments for benchmark problems, we confirm that the proposed method is superior to methods using only SA or GbH in assignment and scheduling tasks. In addition, we can calculate within a realistic calculation time.