@article{oai:kansai-u.repo.nii.ac.jp:00011111,
 author = {Ebara, Hiroyuki and Hiranuma, Yudai and Nakayama, Koki},
 issue = {8},
 journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
 month = {Aug},
 note = {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.},
 pages = {1728--1738},
 title = {Hybrid Consultant-Guided Search for the Traveling Salesperson Problem},
 volume = {E97-A},
 year = {2014}
}