カテゴリ: 論文誌(論文単位)グループ名: 【C】電子・情報・システム部門発行日: 2019/12/01タイトル(英語): A Solution Method Combining Simulated Annealing and Graph-based Heuristics for Operational Planning and Scheduling Benchmark Problems in an Automatic Picking System著者名: 金谷 凌（千葉大学），小圷 成一（千葉大学），岡本 卓（SENSY (株)），下馬場 朋禄（千葉大学），伊藤 智義（千葉大学）著者名(英語): Ryo Kanaya (Chiba University), Seiichi Koakutsu (Chiba University), Takashi Okamoto (SENSY Inc.), Tomoyoshi Shimobaba (Chiba University), Tomoyoshi Ito (Chiba University)キーワード: 自動ピッキングシステム運用計画ベンチマーク問題，シミュレーティッドアニーリング，グラフ理論，スケジューリング，組合せ最適化問題 operational planning and scheduling benchmark problems in an automatic picking system，simulated annealing，graph theory，scheduling，combinatorial optimization要約(英語): 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.本誌: 電気学会論文誌C（電子・情報・システム部門誌） Vol.139 No.12 （2019） 特集：電気・電子・情報関係学会東海支部連合大会本誌掲載ページ: 1481-1487 p原稿種別: 論文／日本語電子版へのリンク: https://www.jstage.jst.go.jp/article/ieejeiss/139/12/139_1481/_article/-char/ja/
