Exterior Path Relinking for Zero-One Optimization

Path relinking (PR) maintains a reference set of elite and diverse solutions, and generates new solutions between and beyond initiating and guiding solutions selected from this set as a foundation for an evolutionary solution process. However, in spite of the widespread application of path relinking in combinatorial optimization, almost all PR implementations only consider the between-form of PR. This note discusses the beyond-form of path relinking, which is called Exterior Path Relinking, and focuses on its relevance for diversification strategies in binary optimization. Finally, this work also observes how to combine the Exterior (beyond) and Interior (between) forms of path relinking.

[1]  Magdalene Marinaki,et al.  A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem , 2008, J. Math. Model. Algorithms.

[2]  Kin Keung Lai,et al.  Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem , 2006, Eur. J. Oper. Res..

[3]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[4]  Fred W. Glover,et al.  Path Relinking for Bandwidth Coloring Problem , 2014, ArXiv.

[5]  Fred W. Glover,et al.  A hybrid metaheuristic approach to solving the UBQP problem , 2010, Eur. J. Oper. Res..

[6]  Fred W. Glover,et al.  Path relinking for unconstrained binary quadratic programming , 2012, Eur. J. Oper. Res..

[7]  Michel Gendreau,et al.  A path relinking algorithm for a multi-depot periodic vehicle routing problem , 2013, J. Heuristics.

[8]  Celso C. Ribeiro,et al.  GRASP and path-relinking : Recent advances and applications , 2003 .

[9]  Celso C. Ribeiro,et al.  Path-relinking intensification methods for stochastic local search algorithms , 2012, J. Heuristics.

[10]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[11]  Michel Gendreau,et al.  Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design , 2004, Ann. Oper. Res..

[12]  Micael Gallego,et al.  GRASP and path relinking for the max-min diversity problem , 2010, Comput. Oper. Res..

[13]  F. Glover,et al.  Sequential and parallel path-relinking algorithms for the quadratic assignment problem , 2005, IEEE Intelligent Systems.

[14]  Fred W. Glover,et al.  A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..

[15]  Francisco Gortázar,et al.  Path relinking for large-scale global optimization , 2011, Soft Comput..

[16]  Rubén Ruiz,et al.  Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem , 2010 .

[17]  Fred W. Glover,et al.  Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem , 2011, Int. J. Swarm Intell. Res..

[18]  Michel Gendreau,et al.  Path relinking for the vehicle routing problem , 2004, J. Heuristics.

[19]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[20]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[21]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[22]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[23]  Fred W. Glover,et al.  A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem , 2007, SLS.

[24]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[25]  Celso C. Ribeiro,et al.  Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications , 2010 .

[26]  Isaac Plana,et al.  GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..

[27]  Celso C. Ribeiro,et al.  Multi-start methods for combinatorial optimization , 2013, Eur. J. Oper. Res..