A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem

Abstract This paper addresses a newly introduced variant of traveling salesman problem, viz. k-Interconnected Multi-Depot Multi-Traveling Salesman Problem (k-IMDMTSP). This problem has the potential to address a variety of problems as it is a general problem that can change its characteristics according to the combination of parameter values. In fact, k-IMDMTSP can become an altogether different problem depending on the choice of its parameter values. According to the No Free Lunch Theorem [43], it is not possible to have a general algorithm that can outperform all algorithms across all problems emanating from k-IMDMTSP due to various parameter values. However, an appropriate combination of different algorithms can successfully deal with all such problems emanating from k-IMDMTSP. Here, we have made an attempt in this direction with the help of hyper-heuristics. A hyper-heuristic based artificial bee colony algorithm is proposed for k-IMDMTSP. A new solution encoding scheme is proposed for representing a k-IMDMTSP solution within the proposed approach, and its associated search space is analyzed theoretically. It has been proved that our encoding scheme yields a search space that is considerably smaller in comparison to encoding schemes used previously. Experimental results on standard benchmark instances show that the proposed approach outperforms other state-of-the-art approaches available in literature in terms of both solution quality and running time.

[1]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[2]  Oscar Castillo,et al.  A Method to Solve the Traveling Salesman Problem Using Ant Colony Optimization Variants with Ant Set Partitioning , 2013, Recent Advances on Hybrid Intelligent Systems.

[3]  Dervis Karaboga,et al.  A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..

[4]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

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

[6]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[7]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

[8]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[9]  W. A. Malik,et al.  A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem , 2007, 2007 American Control Conference.

[10]  Alok Singh,et al.  Swarm intelligence approaches for multidepot salesmen problems with load balancing , 2015, Applied Intelligence.

[11]  Cliff T. Ragsdale,et al.  A new approach to solving the multiple traveling salesperson problem using genetic algorithms , 2006, Eur. J. Oper. Res..

[12]  Alok Singh,et al.  A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem , 2017, Int. J. Mach. Learn. Cybern..

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

[14]  Sanyang Liu,et al.  Improved artificial bee colony algorithm for global optimization , 2011 .

[15]  Dervis Karaboga,et al.  A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems , 2011, Appl. Soft Comput..

[16]  Harun Resit Yazgan,et al.  Genetic algorithm parameter optimisation using Taguchi method for a flexible manufacturing system scheduling problem , 2015 .

[17]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[18]  Sheldon M. Ross Introduction to Probability Models. , 1995 .

[19]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[20]  Cliff T. Ragsdale,et al.  Scheduling pre-printed newspaper advertising inserts using genetic algorithms , 2002 .

[21]  Swaroop Darbha,et al.  An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem , 2007, Oper. Res. Lett..

[22]  Angel B. Ruiz,et al.  Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic , 2007, Transp. Sci..

[23]  Mingxia Gao,et al.  A novel artificial bee colony algorithm based on the cosine similarity , 2018, Comput. Ind. Eng..

[24]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[25]  Alok Singh,et al.  A swarm intelligence approach to the quadratic minimum spanning tree problem , 2010, Inf. Sci..

[26]  Flávio Keidi Miyazawa,et al.  Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem , 2013, GECCO '13.

[27]  Ruichun He,et al.  An improved artificial bee colony algorithm based on the gravity model , 2018, Inf. Sci..

[28]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[29]  Juan Lin,et al.  Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem , 2017, Inf. Sci..

[30]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[31]  Patrick Siarry,et al.  A survey on optimization metaheuristics , 2013, Inf. Sci..

[32]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[33]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[34]  Shoudong Huang,et al.  A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms , 2013, Eur. J. Oper. Res..

[35]  MengChu Zhou,et al.  A Two-Stage Approach to Path Planning and Collision Avoidance of Multibridge Machining Systems , 2017, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[36]  Alok Singh,et al.  A new grouping genetic algorithm approach to the multiple traveling salesperson problem , 2008, Soft Comput..

[37]  Peter I. Cowling,et al.  Hyperheuristics: Recent Developments , 2008, Adaptive and Multilevel Metaheuristics.

[38]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[39]  Michael Drexl,et al.  A survey of variants and extensions of the location-routing problem , 2015, Eur. J. Oper. Res..

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

[41]  Nikbakhsh Javadian,et al.  An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems , 2011, Appl. Soft Comput..

[42]  Dervis Karaboga,et al.  Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems , 2007, IFSA.

[43]  Ben Niu,et al.  A Discrete Artificial Bee Colony Algorithm for TSP Problem , 2011, ICIC.

[44]  Luca Maria Gambardella,et al.  A survey on metaheuristics for stochastic combinatorial optimization , 2009, Natural Computing.

[45]  László T. Kóczy,et al.  Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization , 2017, Inf. Sci..

[46]  Dervis Karaboga,et al.  A combinatorial Artificial Bee Colony algorithm for traveling salesman problem , 2011, 2011 International Symposium on Innovations in Intelligent Systems and Applications.

[47]  Trung Thanh Nguyen,et al.  A hybrid algorithm for a vehicle routing problem with realistic constraints , 2017, Inf. Sci..

[48]  Alok Singh,et al.  A swarm intelligence approach to the early/tardy scheduling problem , 2012, Swarm Evol. Comput..

[49]  Alok Singh,et al.  Two metaheuristic approaches for the multiple traveling salesperson problem , 2015, Appl. Soft Comput..