並列型シミュレーティッド・アニーリング法による配送計画問題の近似解法
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, an algorithm is introduced for improving the simulated annealing algorithm used in solving vehicle routing problems, etc. This algorithm extends the single search structure of the simulated annealing algorithm to the parallel search structure for multiple processing. The extended algorithm is named the parallel simulated annealing because of the possibility of its parallel processing. The main idea of the parallel simulated annealing is that multiple current solutions exist for searching the broad solution space. These solutions start the search with given initialized solutions, and after the period of the subchain, one of the found best solutions is substituted for the worst one, and then the search is started again. During the search, the costs of current solutions, which have already been used in the search before, are inhibited for some cycles as the costs are stored in the tabu list. After the inhibition period, the costs become available again. By this tabu list, many solutions are inhibited because of the same costs during the search. Therefore, the current solutions will have more opportunities for proceeding to the new solution space for finding better or the best solutions. Several numerical experiments were executed on the parallel simulated algorithm and many solutions better than those of usual simulated annealing algorithm were obtained. Availability of the parallel simulated annealing was thus confirmed.
- 東海大学の論文
著者
関連論文
- 知的ドリルC-interestとその数式入力インタフェース
- 臨界温度探索法によるジョブショップ問題の解法
- 配送計画問題のための近臨界温度探索法
- 囲碁指導システムGo-Tutorの開発
- 知的ドリルC-interestの開発
- 知的ドリルC-interestの開発--その解答診断法と数式入力インタフェース (〔教育システム情報学会〕言語・知識処理応用研究部会 第82回研究会)
- タブー・サーチとシミュレーテッド・アニーリングを融合させた配送計画問題の近似解法
- 確率的探索方法による配送計画問題の近似解法
- 搬送時間を考慮したFNSのモデル化について
- Cyclic Queueing理論による生産システムの解析
- 半導体ダイオードを用いる折線回路の解析
- 並列型シミュレーティッド・アニーリング法による配送計画問題の近似解法
- シミュレーテッド・アニーリング法による配送計画問題の解法
- 巡回待ち行列システムにおける単一窓口の最適性