タブー探索法の改良とスケジューリング問題を用いた評価

DOI Web Site Web Site 被引用文献1件 参考文献10件

書誌事項

タイトル別名
  • Development and Evaluation of Improved Tabu Search
  • タブー タンサクホウ ノ カイリョウ ト スケジューリング モンダイ オ モチイタ ヒョウカ

この論文をさがす

抄録

An improved search method has been developed by incorporating an agenda (solution pool) mechanism into the tabu search framework and it was evaluated through application to a job shop scheduling problem. The mechanism facilitates search from a solution in the agenda, while neighbor solutions being sequentially searched by the conventional tabu search. The tabu-list is dynamically synthesized for a selected solution, since the individual history of the solution is quite different from the actual search process.<br> The bench mark problem was the shortest completion of 6 jobs with 6 machines. Case studies with 50 runs were done for the developed method and conventional search methods. The results reveal that optimal solutions are more frequently (62%) obtained by the developed method than by a conventional tabu search (36%) and a genetic algorithm (46%).

収録刊行物

被引用文献 (1)*注記

もっと見る

参考文献 (10)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ