A discrete gravitational search algorithm for solving combinatorial optimization problems

Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The Gravitational Search Algorithm (GSA) is a stochastic population-based metaheuristic that was originally designed for solving continuous optimization problems. It has a flexible and well-balanced mechanism for enhancing exploration and exploitation abilities. In this paper, a Discrete Gravitational Search Algorithm (DGSA) is proposed to solve combinatorial optimization problems. The proposed DGSA uses a Path Re-linking (PR) strategy instead of the classic way in which the agents of GSA usually move from their current position to the position of other agents. The proposed algorithm was tested on a set of 54 Euclidean benchmark instances of TSP with sizes ranging from 51 to 2392 nodes. The results were satisfactory and in the majority of the instances, the results were equal to the best known solution. The proposed algorithm ranked ninth when compared with 54 different algorithms with regard to quality of the solution.

[1]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[4]  Ling Chen,et al.  A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem , 2012, Inf. Sci..

[5]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[6]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[7]  William J. Cook,et al.  Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..

[8]  Sakti Prasad Ghoshal,et al.  A novel opposition-based gravitational search algorithm for combined economic and emission dispatch problems of power systems , 2012 .

[9]  John H. Holland,et al.  Outline for a Logical Theory of Adaptive Systems , 1962, JACM.

[10]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[11]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[12]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[13]  Panos M. Pardalos,et al.  Expanding Neighborhood GRASP for the Traveling Salesman Problem , 2005, Comput. Optim. Appl..

[14]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[15]  Jiadong Yang,et al.  A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system , 2011, Inf. Sci..

[16]  Hossein Nezamabadi-pour,et al.  A prototype classifier based on gravitational search algorithm , 2012, Appl. Soft Comput..

[17]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[18]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[19]  Martin Zachariasen,et al.  Tabu Search on the Geometric Traveling Salesman Problem , 1996 .

[20]  William J. Cook,et al.  Finding Tours in the TSP , 1999 .

[21]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems: analysis, algorithms, and new applications , 1999 .

[22]  Hossein Nezamabadi-pour,et al.  Filter modeling using gravitational search algorithm , 2011, Eng. Appl. Artif. Intell..

[23]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[24]  Kai Zhao,et al.  Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search , 2011, Appl. Soft Comput..

[25]  D. Corneil,et al.  Efficient cluster compensation for lin-kernighan heuristics , 1999 .

[26]  Georgios Dounias,et al.  Honey bees mating optimization algorithm for the Euclidean traveling salesman problem , 2011, Inf. Sci..

[27]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[28]  Wei Wang,et al.  A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling , 2011, Inf. Sci..

[29]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[30]  Xiaoming Chang,et al.  Chaotic secure communication based on a gravitational search algorithm filter , 2012, Eng. Appl. Artif. Intell..

[31]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[32]  Xiaoming Chang,et al.  A chaotic digital secure communication based on a modified gravitational search algorithm filter , 2012, Inf. Sci..

[33]  Mohammad Bagher Dowlatshahi,et al.  Using Gravitational Search Algorithm for Finding Near-optimal Base Station Location in Two-Tiered WSNs , 2012 .

[34]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[35]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[36]  Richard J. Lipton The P=NP Question and Gödel’s Lost Letter , 2010 .

[37]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[38]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[39]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[40]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[41]  Xiangtao Li,et al.  A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering , 2011, Expert Syst. Appl..

[42]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .