自動倉庫の入出庫スケジューリング問題に対する枝と巡回路の除去を利用した厳密解法の検討
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we propose and evaluate some idea to improve an existing exact algorithm for Input-Output Scheduling Problem (IOSP) in automated warehouses. The existing algorithm is based on LP relaxation of IOSP, which is solved by the column generation method allowing relaxed columns (routes). Our idea is, expecting to enhance LP solution, to impliment the column generation using only exact routes, and to reduce consequently increasing calculation cost by dropping (pegging) unusable edges. The pegging test is done in the preprocessing phase by solving Lagrangian relaxation of IOSP formulated in node cover decision variables. The results of computational experiments show that the proposed algorithm can solve slightly large sized instances in less execution time than existing one.
論文 | ランダム
- 1H-11 高等学校理科教育における導入単元としての原子・原子核の指導の試み(授業研究・学習指導, 日本理科教育学会第54回全国大会)
- 高校物理新課程の問題点(物理教育は今)
- 半減期公式の導出について(談話室)
- COEとSSHは相似形
- 津軽海流域の断面構造の季節変化と津軽海流の前駆水について