کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
385067 | 660860 | 2011 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
⺠We propose a new method, called the genetic simulated annealing ant colony system with 21 particle swarm optimization techniques, for solving the traveling salesman problem. ⺠We also make experiments using the 25 data sets obtained from the TSPLIB (http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/) and compare the experimental results of the proposed method with the methods of Angeniol, Vaubois, and Texier (1988), Somhom, Modares, and Enkawa (1997), Masutti and Castro (2009) and Pasti and Castro (2006). ⺠The experimental results show that both the average solution and the percentage deviation of the average solution to the best known solution of the proposed method are better than the methods of Angeniol et al. (1988), Somhom et al. (1997), Masutti and Castro (2009) and Pasti and Castro (2006).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 38, Issue 12, NovemberâDecember 2011, Pages 14439-14450
Journal: Expert Systems with Applications - Volume 38, Issue 12, NovemberâDecember 2011, Pages 14439-14450
نویسندگان
Shyi-Ming Chen, Chih-Yao Chien,