Advertisement

Parallel Local Search

  • Philippe Codognet
  • Danny Munera
  • Daniel Diaz
  • Salvador Abreu
Chapter

Abstract

Local search metaheuristics are a recognized means of solving hard combinatorial problems. Over the last couple of decades, significant advances have been made in terms of the formalization, applicability and performance of these methods. Key to the performance aspect is the increased availability of parallel hardware, which turns out to be largely exploitable by this class of procedures. As real-life cases of combinatorial optimization easily degrade into intractable territory for exact or approximation algorithms, local search metaheuristics hold undeniable interest. This situation is further compounded by the good adequacy exhibited by this class of search procedures for large-scale parallel operation. In this chapter we explore and discuss ways which lead to parallelization in local search

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Emile Aarts and Jan K Lenstra. Local Search in Combinatorial Optimization. John Wiley & Sons, Inc., New York, NY, USA, 1st edition, 1997.Google Scholar
  2. [2]
    Renata Aiex, S. Binato, and Mauricio Resende. Parallel GRASP with Path-Relinking for Job Shop Scheduling. Parallel Computing, 29:393–430, 2003.Google Scholar
  3. [3]
    Renata Aiex, Simone Martins, Celso Ribeiro, and Noemi De R. Rodriguez. Cooperative Multi-thread Parallel Tabu Search with an Application to Circuit Partitioning. Lecture Notes in Computer Science Volume 1457, 1457:310–331, 1998.Google Scholar
  4. [4]
    Renata Aiex, Mauricio Resende, and Celso Ribeiro. Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, 8(3):343–373, 2002.Google Scholar
  5. [5]
    Renata Aiex, Mauricio Resende, and Celso Ribeiro. TTT plots: a Perl program to create time-to-target plots. Optimization Letters, 1:355–366, 2007.Google Scholar
  6. [6]
    Enrique Alba. Special Issue on New Advances on Parallel Meta-Heuristics for Complex Problems. Journal of Heuristics, 10(3):239–380, 2004.Google Scholar
  7. [7]
    Enrique Alba. Parallel Metaheuristics: a New Class of Algorithms. Wiley- Interscience, 2005Google Scholar
  8. [8]
    Gene M. Amdahl. Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities. AFIPS Spring Joint Computer Conference, 1967. AFIPS ’67 (Spring). Proceedings of the, 30:483–485, 1967.Google Scholar
  9. [9]
    lejandro Arbelaez and Philippe Codognet. Massively Parallel Local Search for SAT. In 24th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 57–64, Athens, Nov 2012. IEEE Press.Google Scholar
  10. [10]
    Alejandro Arbelaez and Philippe Codognet. From Sequential to Parallel Local Search for SAT. In 13th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP), LNCS, pages 157–168. Springer, 2013.Google Scholar
  11. [11]
    Alejandro Arbelaez and Philippe Codognet. A GPU Implementation of Parallel Constraint-Based Local Search. In 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), volume 1, pages 648–655, Turin, Italy, 2014.Google Scholar
  12. [12]
    Alejandro Arbelaez and Youssef Hamadi. Improving Parallel Local Search for SAT. In Carlos A. Coello Coello, editor, 5th International Conference on Learning and Intelligent Optimization (LION5), volume 6683 of LNCS, pages 46–60. Springer, 2011.Google Scholar
  13. [13]
    M. G. Arenas, Pierre Collet, A. E. Eiben, Márk Jelasity, J. J. Merelo, Ben Paechter, Mike Preuß, and Marc Schoenauer. A Framework for Distributed Evolutionary Algorithms. In Parallel Problem Solving from Nature - PPSN VII, pages 665–675. Springer 2002.Google Scholar
  14. [14]
    Mehmet E. Aydin. Metaheuristic Agent Teams for Job Shop Scheduling Problems. Holonic and Multi-Agent Systems for Manufacturing, 4659:185– 194, 2007.Google Scholar
  15. [15]
    László Babai. Monte-Carlo algorithms in graph isomorphism testing. Research Report D.M.S. No. 79-10, Université de Montréal, 1979.Google Scholar
  16. [16]
    Per Bak. How Nature Works: The Science of Self-organized Criticality. Copernicus (Springer), 1st edition, 1996.Google Scholar
  17. [17]
    Per Bak and Kim Sneppen. Punctuated equilibrium and criticality in a simple model of evolution. Physical Review Letters, 71(24):4083–4086, 1993.Google Scholar
  18. [18]
    Per Bak, Chao Tang, and Kurt Wiesenfeld. Self-organized criticality: An explanation of the 1/f noise. Physical Review Letters, 59(4):381–384, 1987.Google Scholar
  19. [19]
    Dariusz Barbucha. A Cooperative Population Learning Algorithm for Vehicle Routing Problem with Time Windows. Neurocomputing, 146:210–229, 2014.Google Scholar
  20. [20]
    Fabio Luigi Bellifemine, Giovanni Caire, and Dominic Greenwood. Developing Multi-Agent Systems with JADE. Wiley, 2007.Google Scholar
  21. [21]
    Ravi Kumar Bhati and Akhtar Rasool. Quadratic Assignment Problem and its Relevance to the Real World: A Survey. International Journal of Computer Applications, 96(9):42–47, 2014.Google Scholar
  22. [22]
    Christian Blum and Andrea Roli. Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys, 35(3):268–308, 2003.Google Scholar
  23. [23]
    Stefan Boettcher. Extremal Optimization. In Alexander K. Hartmann and Heiko Rieger, editors, New Optimization Algorithms to Physics, chapter 11, pages 227–251. Wiley-VCH Verlag, Berlin, 2004.Google Scholar
  24. [24]
    Stefan Boettcher and Allon Percus. Nature’s way of optimizing. Artificial Intelligence, 119(1–2):275–286, 2000.Google Scholar
  25. [25]
    Stefan Boettcher and Allon Percus. Extremal Optimization: an Evolutionary Local-Search Algorithm. In Computational Modeling and Problem Solving in the Networked World, volume 21. Springer 2003.Google Scholar
  26. [26]
    A. Bortfeldt, H. Gehring, and D. Mack. A Parallel Tabu Search Algorithm for Solving the Container Loading Problem. Parallel Computing, 29(5 SPEC.):641–662, 2003.Google Scholar
  27. [27]
    Ilhem Boussaïd, Julien Lepagnot, and Patrick Siarry. A Survey on Optimization Metaheuristics. Information Sciences, 237(February):82–117, 2013.Google Scholar
  28. [28]
    Rainer E. Burkard, S. Karisch, and F. Rendl. QAPLIB - a Quadratic Assignment Problem Library. European Journal of Operational Research, 55(1):115– 119, 1991.Google Scholar
  29. [29]
    J. M. Cadenas, M. C. Garrido, and E. Muñoz. Using Machine Learning in a Cooperative Hybrid Parallel Strategy of Metaheuristics. Information Sciences, 179(19):3255–3267, 2009.Google Scholar
  30. [30]
    S. Cahon, N. Melab, and E. G. Talbi. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357–380, 2004.Google Scholar
  31. [31]
    Yves Caniou, Philippe Codognet, Daniel Diaz, and Salvador Abreu. Experiments in parallel constraint-based local search. In EvoCOP’11, 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, volume 6622 of Lecture Notes in Computer Science, Torino, Italy, 2011. Springer Verlag.Google Scholar
  32. [32]
    Yves Caniou, Philippe Codognet, Florian Richoux, Daniel Diaz, and Salvador Abreu. Large-scale Parallelism for Constraint-Based Local Search: the Costas Array Case Study. Constraints, 20(1):30–56, 2015.Google Scholar
  33. [33]
    Yves Caniou, Daniel Diaz, Florian Richoux, Philippe Codognet, and Salvador Abreu. Performance Analysis of Parallel Constraint-Based Local Search. In Symposium on Principles and Practice of Parallel Programming (PPoPP), PPoPP ’12, New York, NY, USA, 2012. ACM. poster paper.Google Scholar
  34. [34]
    Philippe Codognet and Daniel Diaz. Yet Another Local Search Method for Constraint Solving. In Kathleen Steinhöfel, editor, Stochastic Algorithms: Foundations and Applications, pages 342–344. Springer, 2001.Google Scholar
  35. [35]
    Clayton Warren Commander. A survey of the quadratic assignment problem, with applications. Morehead Electronic Journal of Applicable Mathematics, 4:MATH–2005–01, 2005.Google Scholar
  36. [36]
    Jean-Francois Cordeau and Mirko Maischberger. A Parallel Iterated Tabu Search Heuristic for Vehicle Routing Problems. Computers and Operations Research, 39(9):2033–2050, 2012.Google Scholar
  37. [37]
    Teodor Crainic, Michel Gendreau, Pierre Hansen, and Nenad Mladenovic. Cooperative Parallel Variable Neighborhood Search for the p-Median. Journal of Heuristics, 10(3):293–314, 2004.Google Scholar
  38. [38]
    Teodor Crainic and Michel Toulouse. Special Issue on Parallel Meta- Heuristics. Journal of Heuristics, 8(3):247–388, 2002.Google Scholar
  39. [39]
    G. A. Croes. A method for solving traveling-salesman problems. Operations Research, 6(6):791–812, 1958.Google Scholar
  40. [40]
    Leonardo Dagum and Ramesh Menon. OpenMP: an industry standard API for shared-memory programming. IEEE computational science and engineering, 5(1):46–55, 1998.Google Scholar
  41. [41]
    H.A. David and H.N. Nagaraja. Order Statistics. Wiley series in probability and mathematical statistics. John Wiley, 2003.Google Scholar
  42. [42]
    Sérgio A de Carvalho Jr. and Sven Rahmann. Microarray layout as a quadratic assignment problem. In German Conference on Bioinformatics (GCB), volume 83, pages 11–20, Tübingen, Germany, 2006.Google Scholar
  43. [43]
    Daniel Diaz, Florian Richoux, Philippe Codognet, Yves Caniou, and Salvador Abreu. Constraint-based Local Search for the Costas Array Problem. In LION 6, Learning and Intelligent OptimizatioN Conference, Paris, France, 2012. Springer LNCS.Google Scholar
  44. [44]
    Zvi Drezner. The Extended Concentric Tabu for the Quadratic Assignment Problem. European Journal of Operational Research, 160(2):416–422, 2005.Google Scholar
  45. [45]
    Zvi Drezner. Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Computers & Operations Research, 35(3):717–736, 2008.Google Scholar
  46. [46]
    Huub M. M. Eikelder, Bas J. M. Aarts, Marco G. A. Verhoeven, and Emile H. L. Aarts. Sequential and Parallel Local Search Algorithms for Job Shop Scheduling. In Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 359–371. Springer, Boston, MA, 1999.Google Scholar
  47. [47]
    Merrill M. Flood. The traveling-salesman problem. Operations Research, 4(1):61–75, 1956.Google Scholar
  48. [48]
    Edgar Gabriel and al. Open MPI: Goals, concept, and design of a next generation MPI implementation. In Proceedings, 11th European PVM/MPI Users’ Group Meeting, pages 97–104, Budapest, Hungary, 2004.Google Scholar
  49. [49]
    D. Gale and L. Shapley. College Admissions and the Stability of Marriage. American Mathematical Monthly, 69(1):9–15, 1962.Google Scholar
  50. [50]
    Bruno-Laurent Garcia, Jean-Yves Potvin, and Jean-Marc Rousseau. A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints. Computers & Operations Research, 21(9):1025–1033, 1994.Google Scholar
  51. [51]
    F. García-López, B. Melián-Batista, J. A. Moreno-Pérez, and J. M. Moreno- Vega. The Parallel Variable Neighborhood Search for the p -Median Problem. Journal of Heuristics, 8(3):375–388, 2002.Google Scholar
  52. [52]
    Frédéric Gardi and Karim Nouioua. Local search for mixed-integer nonlinear optimization: A methodology and an application. In Evolutionary Computation in Combinatorial Optimization - 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011. Proceedings, pages 167–178, 2011.Google Scholar
  53. [53]
    M. Gendreau, F. Guertin, J.-Y. Potvin, and E. Taillard. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transportation Science, 33(4):381–390, 1999.Google Scholar
  54. [54]
    Ian Gent and Toby Walsh. CSPLib: A Benchmark Library for Constraints. CP 1999 LNCS 1713 Springer, 1999.Google Scholar
  55. [55]
    Fred Glover. Tabu Search–Part I. ORSA Journal on Computing, 1(3):190–206, 1989.Google Scholar
  56. [56].
    Fred Glover. Tabu Search–Part II. ORSA Journal on Computing, 2(1):4–32, 1990.Google Scholar
  57. [57]
    Fred Glover and Manuel Laguna. Tabu Search. Kluwer Academic Publishers, Jul 1997.Google Scholar
  58. [58]
    Carla Gomes and Bart Selman. Algorithm portfolios. Artificial Intelligence, 126(1-2):43–62, 2001.Google Scholar
  59. [59]
    Teofilo Gonzalez, editor. Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall / CRC, 2007.Google Scholar
  60. [60]
    F. Guerriero and M. Mancini. A Cooperative Parallel Rollout Algorithm for the Sequential Ordering Problem. Parallel Computing, 29:663–677, 2003.Google Scholar
  61. [61]
    Magnus Halldorsson, Robert Irving, Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita, and Sandy Scott. Approximability Results for Stable Marriage Problems with Ties. Theoretical Computer Science, 306(1- 5):431–447, 2003.Google Scholar
  62. [62]
    Magnus Halldorsson, Kazuo Iwama, Shuichi Miyazaki, and Hiroki Yanagisawa. Improved Approximation of the Stable Marriage Problem. ACM Transactions on Algorithms, 3(3):266–277, 2007.Google Scholar
  63. [63]
    Tad Hogg and Colin P. Williams. Solving the Really Hard Problems with Cooperative Search. In AAAI Conference on Artificial Intelligence (AAAI-93), pages 231–236, 1993.Google Scholar
  64. [64]
    Holger Hoos and Thomas Stützle. Evaluating Las Vegas algorithms: Pitfalls and remedies. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, UAI’98, pages 238–245. Morgan Kaufmann, 1998.Google Scholar
  65. [65]
    Holger Hoos and Thomas Stützle. Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence, 112(1-2):213–232, 1999.Google Scholar
  66. [66]
    Holger Hoos and Thomas Stützle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann / Elsevier, 2004.Google Scholar
  67. [67]
    J. Humeau, A. Liefooghe, E. G. Talbi, and S. Verel. ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms. Technical report, INRIA, 2013.Google Scholar
  68. [68]
    T. Ibaraki, K. Nonobe, and M. Yagiura, editors. Metaheuristics: Progress as Real Problem Solvers. Springer Verlag, 2005.Google Scholar
  69. [69]
    Robert Irving and David Manlove. Approximation Algorithms for Hard Variants of the Stable Marriage and Hospitals/Residents Problems. Journal of Combinatorial Optimization, 16(3):279–292, 2008.Google Scholar
  70. [70]
    Kazuo Iwama, David Manlove, Shuichi Miyazaki, and Yasufumi Morita. Stable Marriage with Incomplete Lists and Ties. In Proceedings of ICALP ’99: the 26th International Colloquium on Automata, Languages and Programming, number ii, pages 443–452. Springer-Verlag, 1999.Google Scholar
  71. [71]
    Zoltán Király. Approximation of Maximum Stable Marriage. Technical report, Egervary Research Group, Budapest, Hungary, 2011.Google Scholar
  72. [72]
    Zoltán Király. Linear Time Local Approximation Algorithm for Maximum Stable Marriage. Algorithms, 6(3):471–484, aug 2013.Google Scholar
  73. [73]
    S. Kirkpatrick, C.D. Gelatt Jr, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598):671–680, 1983.Google Scholar
  74. [74]
    Tjalling C. Koopmans and Martin Beckmann. Assignment Problems and the Location of Economic Activities. Econometrica, 25(1):53–76, 1957.Google Scholar
  75. [75]
    S Lin. Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44(10):2245–2269, 1965.Google Scholar
  76. [76]
    Helena R Lourenço, Olivier C Martin, and Thomas Stützle. Iterated Local Search. In Handbook of Metaheuristics, pages 320–353. Kluwer Academic Publishers, Boston, 2003.Google Scholar
  77. [77]
    Thé Van Luong, Nouredine Melab, and El-Ghazali Talbi. Local Search Algorithms on Graphics Processing Unit. A Case Study: The Permutation Perceptron Problem. In Evolutionary Computation in Combinatorial Optimization, pages 264–275. LNCS 6022, Springer Verlag, 2010.Google Scholar
  78. [78]
    Thé Van Luong, Nouredine Melab, and El-Ghazali Talbi. GPU Computing for Parallel Local Search Metaheuristics. IEEE Transactions on Computers, 62(1):173–185, 2013.Google Scholar
  79. [79]
    Rui Machado, Salvador Abreu, and Daniel Diaz. Parallel Local Search: Experiments with a PGAS-based programming model. In 12th International Colloquium on Implementation of Constraint and Logic Programming Systems, pages 1–17, Budapest, Hungary, 2012.Google Scholar
  80. [80]
    Rui Machado, Salvador Abreu, and Daniel Diaz. Parallel Performance of Declarative Programming Using a PGAS Model. In Kostis Sagonas and Gopal Gupta, editors, Practical Aspects of Declarative Languages, PADL’2013, Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2013.Google Scholar
  81. [81]
    David Manlove, Robert Irving, Kazuo Iwama, Shuichi Miyazaki, and Yasufumi Morita. Hard Variants of Stable Marriage. Theoretical Computer Science, 276(1-2):261–279, Apr 2002.Google Scholar
  82. [82]
    Simon Martin, Djamila Ouelhadj, Patrick Beullens, Ender Ozcan, Angel A. Juan, and Edmund K. Burke. A Multi-Agent Based Cooperative Approach to Scheduling and Routing. European Journal of Operational Research, 254(1):169–178, 2016.Google Scholar
  83. [83]
    Eric McDermid. A 3/2-Approximation Algorithm for General Stable Marriage. In International Colloquium on Automata, Languages and Programming, ICALP’2009, pages 689–700, Rhodes, Greece, 2009.Google Scholar
  84. [84]
    David Meignan, Abderrafiaa Koukam, and Jean Charles Créput. Coalitionbased metaheuristic: A self-adaptive metaheuristic using reinforcement learning and mimetism. Journal of Heuristics, 16(6):859–879, 2010.Google Scholar
  85. [85]
    Nouredine Melab, Thé Van Luong, Karima Boufaras, and El-Ghazali Talbi. ParadisEO-MO-GPU: A Framework for Parallel GPU-Based Local Search Metaheuristics. In 15th annual conference on Genetic and evolutionary computation conference GECCO ’13, pages 1189–1196, Amsterdam, The Netherlands, 2013.Google Scholar
  86. [86]
    Laurent Michel, Andrew See, and Pascal Van Hentenryck. Distributed constraint-based local search. In Frédéric Benhamou, editor, CP’06, 12th Int. Conf. on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, pages 344–358. Springer Verlag, 2006.Google Scholar
  87. [87]
    Michela Milano and Andrea Roli. MAGMA: A Multiagent Architecture for Metaheuristics. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 34(2):925–941, 2004.Google Scholar
  88. [88]
    Nenad Mladenovic and Pierre Hansen. Variable Neighborhood Search. Computers & Operations Research, 24(11):1097–1100, 1997.Google Scholar
  89. [89]
    Hiroyuki Mori and Yoshihiro Ogita. A Parallel Tabu Search Based Method for Reconfigurations of Distribution Systems. In 2000 Power Engineering Society Summer Meeting (Cat. No.00CH37134), volume 1, pages 73–78. IEEE, 2000Google Scholar
  90. [90]
    Danny Munera. Solving Hard Combinatorial Optimization Problems using Cooperative Parallel Metaheuristics. PhD Thesis, University Paris 1 Pantheon-Sorbonne, 2016.Google Scholar
  91. [91]
    Danny Munera, Daniel Diaz, and Salvador Abreu. Hybridization as Cooperative Parallelism for the Quadratic Assignment Problem. In 10th International Workshop, HM 2016, volume 9668 of Lecture Notes in Computer Science, pages 47–61, Plymouth, UK, 2016. Springer International Publishing.Google Scholar
  92. [92]
    Danny Munera, Daniel Diaz, and Salvador Abreu. Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization. In The 16th European Conference on Evolutionary Computation in Combinatorial Optimisation, Porto, 2016.Google Scholar
  93. [93]
    Danny Munera, Daniel Diaz, Salvador Abreu, and Philippe Codognet. A Parametric Framework for Cooperative Parallel Local Search. In Christian Blum and Gabriela Ochoa, editors, European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP), volume 8600 of Lecture Notes in Computer Science, pages 13–24, Granada, Spain, 2014. Springer.Google Scholar
  94. [94]
    Danny Munera, Daniel Diaz, Salvador Abreu, Francesca Rossi, Vijay Saraswat, and Philippe Codognet. A Local Search Algorithm for SMTI and its extension to HRT Problems. In 3rd International Workshop on Matching Under Preferences, Glasgow, UK, 2015.Google Scholar
  95. [95]
    Danny Munera, Daniel Diaz, Salvador Abreu, Francesca Rossi, Vijay Saraswat, and Philippe Codognet. Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization. In AAAI, Austin, TX, USA, 2015.Google Scholar
  96. [96]
    Djamila Ouelhadj and Sanja Petrovic. A Cooperative Hyper-heuristic Search Framework. Journal of Heuristics, 16(6):835–857, 2010.Google Scholar
  97. [97]
    Gintaras Palubeckis. An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem. Informatica, Lith. Acad. Sci., 11(3):281–296, 2000.Google Scholar
  98. [98]
    Katarzyna Paluch. Faster and Simpler Approximation of Stable Matchings. Algorithms, 7(2):176–187, Nov 2014.Google Scholar
  99. [99]
    Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D. Mavridou, and Mauricio G. C. Resende. Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP. In Parallel Algorithms for Irregularly Structured Problems (IRREGULAR), pages 317–331, 1995.Google Scholar
  100. [100]
    J. Antonio Parejo, Antonio Ruiz-Cortés, Sebastián Lozano, and Pablo Fernandez. Metaheuristic Optimization Frameworks: a Survey and Benchmarking. Soft Computing, 16(3):527–561, 2012.Google Scholar
  101. [101]
    International Exascale Software Project. Exascale roadmap 1.0. Technical report, 2009. http://www.exascale.org/iesp/IESP:Documents.
  102. [102]
    César Rego and Catherine Roucairol. A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem. In Meta-Heuristics, pages 661–675. Springer US, Boston, MA, 1996.Google Scholar
  103. [103]
    Gerhard Reinelt. TSPLIB–A traveling salesman problem library. ORSA Journal on Computing, 3(4):376–384, 1991.Google Scholar
  104. [104]
    Celso Ribeiro and Isabel Rosseti. Efficient Parallel Cooperative Implementations of GRASP Heuristics. Parallel Computing, 33(1):21–35, 2007.Google Scholar
  105. [105]
    Celso Ribeiro, Isabel Rosseti, and Reinaldo Vallejos. Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. Journal of Global Optimization, 54:405–429, 2012.Google Scholar
  106. [106]
    Vijay Saraswat, Bard Bloom, Igor Peshansky, Olivier Tardieu, and David Grove. X10 Language Specification - Version 2.3. Technical report, IBM Research, 2012.Google Scholar
  107. [107]
    Kenneth Sörensen and Fred Glover. Metaheuristics. In Encyclopedia of Operations Research and Management Science, pages 960–970. Springer, Boston, MA, 2013.Google Scholar
  108. [108]
    Kenneth Sörensen, Marc Sevaux, and Fred Glover. A History of Metaheuristics. In Rafael Marti, Panos Pardalos, and Mauricio Resende, editors, Handbook of Heuristics. Springer, Boston, MA, 2016.Google Scholar
  109. [109]
    Éric Taillard. Robust Taboo Search for the Quadratic Assignment Problem. Parallel Computing, 17(4-5):443–455, 1991.Google Scholar
  110. [110]
    E. G. Talbi, S. Cahon, and N. Melab. Designing Cellular Networks Using a Parallel Hybrid Metaheuristic on the Computational Grid. Computer Communications, 30(4):698–713, 2007.Google Scholar
  111. [111]
    El-Ghazali Talbi. Metaheuristics: From Design to Implementation. Wiley, 2009.Google Scholar
  112. [112]
    El-Ghazali Talbi and Vincent Bachelet. COSEARCH: A parallel cooperative metaheuristic. Journal of Mathematical Modelling and Algorithms, 5(1):5–22, 2006.Google Scholar
  113. [113]
    Sarosh Talukdar, Lars Baerentzen, Andrew Gove, and Pedro De Souza. Asynchronous Teams: Cooperation Schemes for Autonomous Agents. Journal of Heuristics, 4:295–321, 1998.Google Scholar
  114. [114]
    Michel Toulouse, Teodor Crainic, and Michel Gendreau. Communication Issues in Designing Cooperative Multi-Thread Parallel Searches. In I.H. Osman and J.P. Kelly, editors, Meta-Heuristics: Theory & Applications, pages 501–522. Kluwer Academic Publishers, Norwell, MA., 1995.Google Scholar
  115. [115]
    Charlotte Truchet, Alejandro Arbelaez, Florian Richoux, and Philippe Codognet. Estimating parallel runtimes for randomized algorithms in constraint solving. J. Heuristics, 22(4):613–648, 2016.Google Scholar
  116. [116]
    Charlotte Truchet, Florian Richoux, and Philippe Codognet. Prediction of Parallel Speed-ups for Las Vegas Algorithms. In Jack Dongarra and Yves Robert, editors, Proceedings of ICPP-2013, 42nd International Conference on Parallel Processing. IEEE Press, October 2013.Google Scholar
  117. [117]
    Pascal Van Hentenryck and Laurent Michel. Constraint-Based Local Search. The MIT Press, Aug 2005.Google Scholar
  118. [118]
    Marcus Verhoeven. Parallel Local Search. PhD thesis, University of Eindhoven, Eindhoven, Netherlands, 1996.Google Scholar
  119. [119]
    Marcus Verhoeven and Emile Aarts. Parallel Local Search. Journal of Heuristics, 1(1):43–65, 1995.Google Scholar
  120. [120]
    Stefan Voß. Meta-heuristics: The State of the Art. In Alexander Nareyek, editor, Local Search for Planning and Scheduling, pages 1–23. Springer Berlin Heidelberg, 2001.Google Scholar
  121. [121]
    M. Yazdani, M. Amiri, and M. Zandieh. Flexible Job-Shop Scheduling with Parallel Variable Neighborhood Search Algorithm. Expert Systems with Applications, 37(1):678–687, 2010.Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Philippe Codognet
    • 1
  • Danny Munera
    • 2
  • Daniel Diaz
    • 3
  • Salvador Abreu
    • 4
  1. 1.University Pierre & Marie Curie/LIP6ParisFrance
  2. 2.University of AntioquiaMedellinColombia
  3. 3.University Paris 1/CRIParisFrance
  4. 4.University of Évora/LISP/CRIÉvoraPortugal

Personalised recommendations