A new hybrid gravitational particle swarm optimisation-ACO with local search mechanism, PSOGSA-ACO-Ls for TSP Online publication date:: Mon, 12-Aug-2019
by Nizar Rokbani; Pavel Kromer; Ikram Twir; Adel M. Alimi
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 7, No. 4, 2019
Abstract: The travelling salesman problem (TSP) is a hard combinatorial optimisation problem and a popular benchmarking problem at the same time. The TSP has also a number of practical real-world and industrial applications, such as routing in internet of things, IoT, networks, path planning in robotics and many others. In this paper, a new hybrid algorithm for the TSP is proposed; it combines gravitational particle swarm optimisation (PSOGSA) and ACO, and is called ant supervised by gravitational particle swarm optimisation with a local search, PSOGSA-ACO-LS. PSOGSA is used to optimise ACO settings while a local search mechanism, 2-Opt is employed by ACO to ameliorate its local solutions. The proposed method is evaluated using a set a test benches from the TSPLib database including: eil51, berlin52, st70, eil76, rat99, eil101, kroA100, and kroA200. Experimental results show that ACO-GPSO-LS is able to solve the set of TSP instances listed below including the large TSP data sets: kroA100, eli101 and kroA200.
Online publication date:: Mon, 12-Aug-2019
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Engineering Informatics (IJIEI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org