An improved tabu search for solving symmetric traveling salesman problems

Tabu search (TS) is a heuristic for provinding excellent solutions to hard combinatorial problems. However, the quality of solution of TS depends on the intial solution. In this paper, we proposed and improved TS approach for solving symmetric traveling salesman problems (TSP). The proposed algorith...

詳細記述

保存先:
書誌詳細
主要な著者: Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan
フォーマット: Conference or Workshop Item
言語:English
出版事項: 2011
主題:
オンライン・アクセス:http://repo.uum.edu.my/5547/1/Yai-Fung_Lim%2C_Pei-Yee_Hong%2C_Razamin_%26_Ruzelan.pdf
http://repo.uum.edu.my/5547/
http://dx.doi.org/10.1109/CHUSER.2011.6163857
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料