An Augmented Artificial Bee Colony with Hybrid Learning for Traveling Salesman Problem

Traveling salesman problem (TSP) is a renowned NP-hard combinatorial optimization model which widely studied in the operation research community, such as transportation, logistics and industries areas. To address the problem effectively and efficiently, in this paper, a new meta-heuristic method, named hybrid learning artificial bee colony, is proposed based on the simply yet powerful swarm intelligence method, artificial bee colony algorithm. In HLABC, two different learning strategies are adopted in the employed bee phase and the onlooker bee phase. The updating mechanism for food source position is enhanced by employing global best food source. Experimental results on TSP problems with various city sizes indicate the effectiveness of the proposed algorithm.

[1]  In-Chan Choi,et al.  A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem , 2003, Comput. Oper. Res..

[2]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[3]  Andrea Lodi,et al.  A Hybrid Exact Algorithm for the TSPTW , 2002, INFORMS J. Comput..

[4]  Lucio Bianco,et al.  The traveling salesman problem with cumulative costs , 1993, Networks.

[5]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[6]  Thomas Stützle,et al.  Parallel Ant Colony Optimization for the Traveling Salesman Problem , 2006, ANTS Workshop.

[7]  Mohammed Essaid Riffi,et al.  Discrete novel hybrid particle swarm optimization to solve travelling salesman problem , 2014, 2014 5th Workshop on Codes, Cryptography and Communication Systems (WCCCS).

[8]  Wei Tsang Ooi,et al.  A stochastic dynamic traveling salesman problem with hard time windows , 2009, Eur. J. Oper. Res..

[9]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[10]  Asoke Kumar Bhunia,et al.  Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times , 2011, J. Comput. Appl. Math..

[11]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[12]  R. Bellman,et al.  A stochastic travelling salesman problem , 1983 .

[13]  Michel Gendreau,et al.  The traveling salesman problem with time-dependent service times , 2016, Eur. J. Oper. Res..

[14]  Shengxiang Yang,et al.  Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors , 2013, Appl. Soft Comput..

[15]  Rosni Abdullah,et al.  A hybrid artificial bee colony algorithm for numerical function optimization , 2015 .

[16]  Jun Zhang,et al.  A novel discrete particle swarm optimization to solve traveling salesman problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[17]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

[18]  Manoranjan Maiti,et al.  An imprecise Multi-Objective Genetic Algorithm for uncertain Constrained Multi-Objective Solid Travelling Salesman Problem , 2016, Expert Syst. Appl..

[19]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[20]  Yoonho Seo,et al.  Discrete Optimization An efficient genetic algorithm for the traveling salesman problem with precedence constraints , 2002 .

[21]  Sam Kwong,et al.  Gbest-guided artificial bee colony algorithm for numerical function optimization , 2010, Appl. Math. Comput..