Metaheauristic methods have been studied for combinational optimization problems for some time. Recently, a Consultant-Guided Search(CGS) has been proposed as a metaheuristic method for the Traveling Salesperson Problem(TSP). This approach is an algorithm in which a virtual person called a client creates a solution based on consultation with a virtual person called a consultant. In this research, we propose a parallel algorithm which uses the Ant Colony System(ACS) to create a solution with a consultant in a Consultant-Guided Search, and calculates an approximation solution for the TSP. Finally, we execute a computer experiment using the benchmark problems(TSPLIB). Our algorithm provides a solution with less than 2% error rate for problem instances using less than 2000 cities.
雑誌名
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
巻
E97-A
号
8
ページ
1728 - 1738
発行年
2014-08
ISSN
09168508
17451337
書誌レコードID
AA10826239
DOI
10.1587/transfun.e97.a.1728
権利
Copyright(c)2014 The Institute of Electronics,Information and Communication Engineers
Original text is available at https://search.ieice.org/index.html