A New Cooperative Framework for Parallel Trajectory-Based Metaheuristics

In this paper, we propose the Parallel Elite Biased framework (PEB framework) for parallel trajectory-based metaheuristics. In the PEB framework, multiple search processes are executed concurrently. During the search, each process sends its best found solutions to its neighboring processes and uses the received solutions to guide its search. Using the PEB framework, we design a parallel variant of Guided Local Search (GLS) called PEBGLS. Extensive experiments have been conducted on the Tianhe-2 supercomputer to study the performance of PEBGLS on the Traveling Salesman Problem (TSP). The experimental results show that PEBGLS is a competitive parallel metaheuristic for the TSP, which confirms that the PEB framework is useful for designing parallel trajectory-based metaheuristics.

[1]  Gilbert Laporte,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..

[2]  Enrique Alba,et al.  A parallel local search in CPU/GPU for scheduling independent tasks on large heterogeneous computing systems , 2015, The Journal of Supercomputing.

[3]  Qingfu Zhang,et al.  A Parallel Tabu Search for the Unconstrained Binary Quadratic Programming problem , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[4]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[5]  A spatial parallel heuristic approach for solving very large-scale vehicle routing problems , 2017, Trans. GIS.

[6]  Enrique Alba,et al.  Parallel metaheuristics: recent advances and new trends , 2012, Int. Trans. Oper. Res..

[7]  Julio Ortega Lopera,et al.  A Parallel Multilevel Metaheuristic for Graph Partitioning , 2004, J. Heuristics.

[8]  Yll Haxhimusa,et al.  A Parallel Ring Method for Solving a Large-scale Traveling Salesman Problem , 2016 .

[9]  Aleteia P. F. Araujo,et al.  Exploring Grid Implementations of Parallel Cooperative Metaheuristics , 2007, Metaheuristics.

[10]  Celso C. Ribeiro,et al.  Efficient parallel cooperative implementations of GRASP heuristics , 2007, Parallel Comput..

[11]  Dervis Karaboga,et al.  A novel clustering approach: Artificial Bee Colony (ABC) algorithm , 2011, Appl. Soft Comput..

[12]  Wei-Chih Chen,et al.  A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm , 2011, J. Glob. Optim..

[13]  Sergio Nesmachnow,et al.  An overview of metaheuristics: accurate and efficient methods for optimisation , 2014, Int. J. Metaheuristics.

[14]  Luiz Satoru Ochi,et al.  A parallel hybrid metaheuristic for bicluster editing , 2016, Int. Trans. Oper. Res..

[15]  Wojciech Bozejko,et al.  Parallel hybrid metaheuristics for the flexible job shop problem , 2010, Comput. Ind. Eng..

[16]  Emile H. L. Aarts,et al.  Parallel local search , 1995, J. Heuristics.

[17]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[18]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[19]  Enrique Alba,et al.  Exploring the Accuracy of a Parallel Cooperative Model for Trajectory-Based Metaheuristics , 2011, EUROCAST.

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

[21]  Teodor Gabriel Crainic,et al.  Parallel Meta-Heuristics , 2010 .

[22]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[23]  Kenneth D. Boese,et al.  Cost Versus Distance In the Traveling Salesman Problem , 1995 .

[24]  Lei Wu,et al.  Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem , 2017, Concurr. Comput. Pract. Exp..

[25]  Celso C. Ribeiro,et al.  Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints , 1996, J. Heuristics.

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

[27]  Qingfu Zhang,et al.  P-GLS-II: an enhanced version of the population-based guided local search , 2011, GECCO '11.

[28]  Teodor Gabriel Crainic,et al.  A guided cooperative search for the vehicle routing problem with time windows , 2005, IEEE Intelligent Systems.

[29]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.

[30]  E. Tsang,et al.  Guided Local Search , 2010 .

[31]  Albert Y. Zomaya,et al.  A Parallel Metaheuristic Framework Based on Harmony Search for Scheduling in Distributed Computing Systems , 2012, Int. J. Found. Comput. Sci..

[32]  Juan Frausto-Solís,et al.  MPSA: A Methodology to Parallelize Simulated Annealing and its application to the Traveling Salesman Problem , 2002 .

[33]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[34]  Graham Kendall,et al.  Tabu assisted guided local search approaches for freight service network design , 2012, Inf. Sci..

[35]  Vera C. Hemmelmayr,et al.  Sequential and parallel large neighborhood search algorithms for the periodic location routing problem , 2015, Eur. J. Oper. Res..

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

[37]  Enrique Alba,et al.  A New Parallel Cooperative Model for Trajectory Based Metaheuristics , 2010, DCAI.

[38]  Kamil Rocki,et al.  Large scale parallel iterated local search algorithm for solving traveling salesman problem , 2012, HiPC 2012.

[39]  D. Jabba,et al.  A novel framework for the parallel solution of combinatorial problems implementing tabu search and simulated annealing algorithms , 2016, 2016 6th International Conference on Computers Communications and Control (ICCCC).

[40]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[41]  Mehmet Emin Aydin,et al.  Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling , 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications.

[42]  Thomas Stützle,et al.  A detailed analysis of the population-based ant colony optimization algorithm for the TSP and the QAP , 2011, GECCO.

[43]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[44]  Jean-Yves Potvin,et al.  A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints , 1994, Comput. Oper. Res..

[45]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[46]  El-Ghazali Talbi,et al.  COSEARCH: A Parallel Cooperative Metaheuristic , 2006, J. Math. Model. Algorithms.

[47]  Jacek Blazewicz,et al.  Parallel Tabu Search Approaches For Two-Dimensional Cutting , 2004, Parallel Process. Lett..

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

[49]  Adrião Duarte Dória Neto,et al.  A parallel hybrid implementation using genetic algorithm, GRASP and reinforcement learning , 2009, 2009 International Joint Conference on Neural Networks.

[50]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[51]  Umut Tosun,et al.  On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem , 2015, Eng. Appl. Artif. Intell..

[52]  Masri Ayob,et al.  The effect of elite pool in hybrid population-based meta-heuristics for solving combinatorial optimization problems , 2016, Appl. Soft Comput..

[53]  Szymon Lukasik,et al.  Parallel Simulated Annealing Algorithm for Graph Coloring Problem , 2007, PPAM.

[54]  Michael Kampouridis,et al.  Guided Local Search for Optimal GPON/FTTP Network Design , 2013 .

[55]  Chao Wang,et al.  A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows , 2015, Comput. Ind. Eng..

[56]  Enrique Alba,et al.  Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems , 2015, 2015 International Conference on Intelligent Networking and Collaborative Systems.

[57]  Richard F. Hartl,et al.  A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2008 .

[58]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[59]  Pierre Hansen,et al.  Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.

[60]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

[61]  Michel Gendreau,et al.  An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP , 2015, Eur. J. Oper. Res..

[62]  Teodor Gabriel Crainic,et al.  A cooperative parallel metaheuristic for the capacitated vehicle routing problem , 2014, Comput. Oper. Res..

[63]  Michael Kampouridis,et al.  Optimising the deployment of fibre optics using Guided Local Search , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[64]  Lúcia Maria de A. Drummond,et al.  A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Comput. Oper. Res..

[65]  Mauro Birattari,et al.  Dm63 Heuristics for Combinatorial Optimization Ant Colony Optimization Exercises Outline Ant Colony Optimization: the Metaheuristic Application Examples Generalized Assignment Problem (gap) Connection between Aco and Other Metaheuristics Encodings Capacited Vehicle Routing Linear Ordering Ant Colony , 2022 .

[66]  Peter Merz,et al.  Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm , 2007, Metaheuristics.

[67]  Peter Merz,et al.  A distributed Chained Lin-Kernighan algorithm for TSP problems , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[68]  Teodor Gabriel Crainic,et al.  A cooperative parallel meta-heuristic for the vehicle routing problem with time windows , 2005, Comput. Oper. Res..

[69]  Qingfu Zhang,et al.  MOEA/D with guided local search: Some preliminary experimental results , 2013, 2013 5th Computer Science and Electronic Engineering Conference (CEEC).