Skip to main content
SpringerLink
Log in

Parallel Meta-heuristics

  • Chapter
  • First Online:
Handbook of Metaheuristics

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 146))

  • 12k Accesses

Abstract

We present a state-of-the-art survey of parallel meta-heuristic strategies, developments, and results. We discuss general design and implementation principles that apply to most meta-heuristic classes and instantiate these principles for neighborhood and population-based meta-heuristics. We also identify a number of trends and promising research directions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Aiex, R.M., Martins, S.L., Ribeiro, C.C., Rodriguez, N.R.: Cooperative multi-thread parallel tabu search with an application to circuit partitioning. In: Proceedings of IRREGULAR’98 - 5th International Symposium on Solving Irregularly Structured Problems in Parallel, Lecture Notes in Computer Science, vol. 1457 pp. 310–331. Springer (1998)

    Google Scholar 

  2. Alba, E. Parallel Metaheuristics: A New Class of Algorithms. Wiley, Hoboken, NJ, (2005)

    Google Scholar 

  3. Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30, 377–387, (2004)

    Article  Google Scholar 

  4. Azencott, R.: Simulated Annealing Parallelization Techniques. Wiley, New York, NY, (1992)

    Google Scholar 

  5. Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, é.D.: A parallel tabu search heuristic for the vehicle routing problem with time windows. Transp. Res. Part C: Emerg. Techn. 5(2), 109–122, (1997)

    Article  Google Scholar 

  6. Banos, R., Gil, C., Ortega, J., and Montoya, F.G.: A parallel multilevel metaheuristic for graph partitioning. J. Heuristics 10(4), 315–336, (2004)

    Article  Google Scholar 

  7. Banos, R., Gil, C., Ortega, J., and Montoya, F.G.: Parallel heuristic search in multilevel graph partitioning. In: Proceedings of the 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp. 88–95, (2004)

    Google Scholar 

  8. Barr, R.S., Hickman, B.L.: Reporting computational experiments with parallel algorithms: issues, measures, and experts opinions. ORSA J. Comput. 5(1), 2–18, (1993)

    Google Scholar 

  9. Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path-relinking for the Steiner problem in graphs. In: Voß, S., Martello, S., Roucairol, C., Osman, I.H., (eds.) Meta-Heuristics 98: Theory & Applications, pp. 31–36. Kluwer, Norwell, MA, (1999)

    Google Scholar 

  10. Battiti, R. Tecchiolli, G.: Parallel based search for combinatorial optimization: genetic algorithms and TABU. Microproc. Microsy. 16(7), 351–367, (1992)

    Article  Google Scholar 

  11. Blazewicz, J., Moret-Salvador, A., Walkowiak, R.: Parallel tabu search approaches for two-dimensional cutting. Parallel Process. Lett. 14(1), 23–32, (2004)

    Article  Google Scholar 

  12. Bock, S. Rosenberg O.: A New parallel breadth first tabu search technique for solving production planning problems. Int. Trans. Oper. Res. 7(6), 625–635, (2000)

    Article  Google Scholar 

  13. Bortfeldt, A., Gehring, H., Mack, D.: A Parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29, 641–662, (2003)

    Article  Google Scholar 

  14. Bullnheimer, B., Kotsis, G., Strauß, C.: Parallelization strategies for the ant system. In: De Leone, R., Murli, A., Pardalos, P., Toraldo, G. (eds.) High Performance Algorithms and Software in Nonlinear Optimization, volume 24 of Applied Optimization, pages 87–100. Kluwer, Dordrecht, (1999)

    Google Scholar 

  15. Calégari, P., Guidec, F., Kuonen, P., Kuonen, D.: Parallel island-based genetic algorithm for radio network design. J. Parallel Distrib. Comput. 47(1), 86–90, (1997)

    Article  Google Scholar 

  16. Cantú-Paz, E.: A survey of parallel genetic algorithms. Calculateurs Parallèles, Réseaux et Systèmes répartis 10(2), 141–170, (1998)

    Google Scholar 

  17. Cantú-Paz, E.: Theory of parallel genetic algorithms. In: Alba, E., (ed.) Parallel Metaheuristics: A New Class of Algorithms, pp. 425–445. Wiley, Hoboken, (2005)

    Google Scholar 

  18. Cavalcante, C.B.C., Cavalcante, V.F., Ribeiro, C.C., de Souza, C.C.: Parallel cooperative approaches for the labor constrained scheduling problem. In: Ribeiro C.C., Hansen, P., (eds.) Essays and Surveys in Metaheuristics, pp. 201–225. Kluwer, Norwell, MA, (2002)

    Google Scholar 

  19. Chakrapani, J., Skorin-Kapov, J.: A connectionist approach to the quadratic assignment problem. Comput. Oper. Res. 19(3/4), 287–295, (1992)

    Article  Google Scholar 

  20. Chakrapani, J., Skorin-Kapov, J.: Connection machine implementation of a tabu search algorithm for the traveling salesman problem. J. Comput. Inf. Technol. 1(1), 29–36, (1993)

    Google Scholar 

  21. Chakrapani, J., Skorin-Kapov, J.: Massively parallel tabu search for the quadratic assignment problem. Ann. Oper. Res. 41, 327–341, (1993)

    Article  Google Scholar 

  22. Cohoon, J., Hedge, S., Martin, W., Richards, D.: Punctuated equilibria: a parallel genetic algorithm. In: Grefenstette, J.J., (ed.) Proceedings of the 2nd International Conference on Genetic Algorithms and their Applications, pp. 148–154. Lawrence Erlbaum Associates, Hillsdale, NJ, (1987)

    Google Scholar 

  23. Cohoon, J., Martin, W., Richards, D.: Genetic algorithm and punctuated equilibria in VLSI. In: Schwefel, H.-P., Männer, R. (eds.) Parallel Problem Solving from Nature. Lecture Notes in Computer Science, vol. 496 pp. 134–144. Springer, Berlin, (1991a)

    Google Scholar 

  24. Cohoon, J., Martin, W., Richards, D.: A multi-population genetic algorithm for solving the k-partition problem on hyper-cubes. In Belew, R.K., Booker, L.B. (eds.) Proceedings of the 4th International Conference on Genetic Algorithms, pp. 134–144. Morgan Kaufmann, San Mateo, CA, (1991b)

    Google Scholar 

  25. Cordeau, J.-F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928–936, (2001)

    Article  Google Scholar 

  26. Crainic, T.G.: Parallel computation, co-operation, tabu Search. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization Via Memory and Evolution: Tabu Search and Scatter Search, pp. 283–302. Kluwer, Norwell, MA, (2005)

    Chapter  Google Scholar 

  27. Crainic, T.G.: Parallel solution methods for vehicle routing problems. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 171–198. Springer, New York, (2008)

    Chapter  Google Scholar 

  28. Crainic, T.G., Crisan, C.C., Gendreau, M., Lahrichi, N., Rei. W.: A concurrent evolutionary approach for cooperative rich combinatorial optimization. In: Proceedings of Genetic and Evolutionary Computation Conference - GECCO 2009, July 8-12, Montréal, Canada. CD-ROM, ACM, Order no. 910092, (2009)

    Google Scholar 

  29. Crainic, T.G., Crisan, C.C., Gendreau, M., Lahrichi, N., Rei, W.: Multi-thread integrative cooperative optimization for rich combinatorial problems. In: Proceedings of The 12th International Workshop on Nature Inspired Distributed Computing - NIDISC’09, 25-29 May, Rome, CD-ROM (2009)

    Google Scholar 

  30. Crainic, T.G., Di Chiara, B., Nonato, M., Tarricone, L.: Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-Heuristics. IEEE Wireless Commun. 13(6), 34–41, (2006)

    Article  Google Scholar 

  31. Crainic, T.G. Gendreau, M.: Towards an evolutionary method - cooperating multi-thread parallel tabu search hybrid. In: Voß, S., Martello, S., Roucairol, C., Osman, I.H. (eds.) Meta-Heuristics 98: Theory & Applications, pp. 331–344. Kluwer, Norwell, MA, (1999)

    Google Scholar 

  32. Crainic, T.G. Gendreau, M.: Cooperative parallel tabu search for capacitated network design. J. Heuristics 8(6), 601–627, (2002)

    Article  Google Scholar 

  33. Crainic, T.G., Gendreau, M., Hansen, P., Mladenović, N.: Cooperative parallel variable neighborhood search for the p-median. J. Heuristics 10(3), 293–314, (2004)

    Article  Google Scholar 

  34. Crainic, T.G., Gendreau, M., Potvin, J.-Y.: Parallel tabu search. In: Alba, E. (ed.) Parallel Metaheuristics, pp. 298–313. Wiley, Hoboken, NJ, (2005)

    Google Scholar 

  35. Crainic, T.G., Li, Y., Toulouse, M.: A first multilevel cooperative algorithm for the capacitated multicommodity network design. Comput. Oper. Res. 33(9), 2602–2622, (2006)

    Article  Google Scholar 

  36. Crainic, T.G. Nourredine, H.: Parallel meta-heuristics applications. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Algorithms, pp. 447–494. Wiley, Hoboken, NJ, (2005)

    Chapter  Google Scholar 

  37. Crainic, T.G. Toulouse, M.: Parallel metaheuristics. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 205–251. Kluwer, Norwell, MA, (1998)

    Chapter  Google Scholar 

  38. Crainic, T.G. Toulouse, M.: Parallel strategies for meta-heuristics. In: Glover, F., Kochenberger, G. (eds.) Handbook in Metaheuristics, pp. 475–513. Kluwer, Norwell, MA, (2003)

    Google Scholar 

  39. Crainic, T.G., Toulouse, M., Gendreau, M.: Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum 17(2/3), 113–123, (1995)

    Article  Google Scholar 

  40. Crainic, T.G., Toulouse, M., Gendreau, M.: Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Annals Oper. Res. 63, 277–299, (1996)

    Article  Google Scholar 

  41. Crainic, T.G., Toulouse, M., Gendreau, M.: Towards a taxonomy of parallel tabu search algorithms. INFORMS J. Comput. 9(1), 61–72, (1997)

    Article  Google Scholar 

  42. Cung, V.-D., Martins, S.L., Ribeiro, C.C., Roucairol, C.: Strategies for the parallel implementations of metaheuristics. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 263–308. Kluwer, Norwell, MA, (2002)

    Google Scholar 

  43. Czech, Z.J.: A parallel genetic algorithm for the set partitioning problem. In: 8th Euromicro Workshop on Parallel and Distributed Processing, pp. 343–350, (2000)

    Google Scholar 

  44. Dai, C., Li, B., Toulouse, M.: A multilevel cooperative tabu search algorithm for the covering design problem. J. Comb. Math. Comb. Comput. 68, 35–65, (2009)

    Google Scholar 

  45. De Falco, I., Del Balio, R., Tarantino, E.: Solving the mapping problem by parallel tabu search. Report, Istituto per la Ricerca sui Sistemi Informatici Paralleli-CNR, (1995)

    Google Scholar 

  46. De Falco, I., Del Balio, R., Tarantino, E., Vaccaro, R.: Improving Search by Incorporating Evolution Principles in Parallel Tabu Search. In: Proceedings International Conference on Machine Learning, pp. 823–828, (1994)

    Google Scholar 

  47. Di Chiara, B.: Optimum planning of 3G cellular systems: radio propagation models and cooperative parallel meta-heuristics. PhD thesis, Dipartimento di ingegneria dell’innovatione, Universitá degli Studi di Lecce, Lecce, Italy, (2005–2006)

    Google Scholar 

  48. Diekmann, R., Lüling, R., Monien, B., Spräner, C.: Combining helpful sets and parallel simulated annealing for the graph-partitioning problem. Int. J. Parallel Programming 8, 61–84, (1996)

    Google Scholar 

  49. Doerner, K., Hartl, R.F., Kiechle, G., Lucka, M., Reimann, M.: Parallel ant systems for the capacitated vehicle routing problem. In: Gottlieb, J., Raidl, G.R. (eds.) Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, volume 3004 of Lecture Notes in Computer Science, pp. 72–83. Springer, Berlin, (2004)

    Google Scholar 

  50. Doerner, K.F., Hartl, R.F., Benkner, S., Lucka, M.: Cooperative savings based ant colony optimization - multiple search and decomposition approaches. Parallel Processing Lett. 16(3), 351–369, (2006)

    Article  Google Scholar 

  51. Doerner, K.F., Hartl, R.F., Lucka, M.: A parallel version of the D-ant algorithm for the vehicle routing problem. In: Vajtersic, M., Trobec, R., Zinterhof, P., Uhl, A. (eds.) Parallel Numerics’05, pp. 109–118. Springer, New York, NY, (2005)

    Google Scholar 

  52. Dorigo, M. Stuetzle, T.: The ant colony metaheuristic. algorithms, applications, and advances. In: Glover, F., Kochenberger, G. (eds.) Handbook in Metaheuristics, pp. 251–285. Kluwer, Norwell, MA, (2003)

    Google Scholar 

  53. Drias, H. Ibri , A.: Parallel ACS for weighted MAX-SAT. In: Mira, J., álvarez, J. (eds.) Artificial Neural Nets Problem Solving Methods - Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks, Lecture Notes in Computer Science, vol. 2686 pp. 414–421. Springer, Heidelberg, (2003)

    Google Scholar 

  54. Fiechter, C.-N.: A parallel tabu search algorithm for large travelling salesman problems. Discrete Appl. Math. 51(3), 243–267, (1994)

    Article  Google Scholar 

  55. Flores, S.D., Cegla, B.B., Caceres, D.B.: Telecommunication network design with parallel multi-objective evolutionary algorithms. In: IFIP/ACM Latin America Networking Conference 2003, (2003)

    Google Scholar 

  56. Folino, G., Pizzuti, C., Spezzano, G.: Combining cellular genetic algorithms and local search for solving satisfiability problems. In: Proceedings of the 10th IEEE International Conference on Tools with Artificial Intelligence, pp. 192–198. IEEE Computer Society Press, (1998)

    Google Scholar 

  57. Folino, G., Pizzuti, C., Spezzano, G.: Solving the satisfiability problem by a parallel cellular genetic algorithm. In Proceedings of the 24th EUROMICRO Conference, pp. 715–722. IEEE Computer Society Press, (1998)

    Google Scholar 

  58. Garcia, B.L., Potvin, J.-Y., Rousseau, J.M.: A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput. Oper. Res. 21(9), 1025–1033, (1994)

    Article  Google Scholar 

  59. García-López, F., García Torres, M., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: Parallel scatter search. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Metaheuristics, pp. 223–246. Wiley, Hoboken, NJ, (2005)

    Chapter  Google Scholar 

  60. García-López, F., García Torres, M., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: Solving feature subset selection problem by a parallel scatter search. Eur. J. Oper. Res. 169, 477–489, (2006)

    Article  Google Scholar 

  61. García-López, F., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. J. Heuristics 8(3), 375–388, (2002)

    Article  Google Scholar 

  62. García-López, F., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: Parallelization of the scatter search for the p-median problem. Parallel Comput. 29, 575–589, (2003)

    Article  Google Scholar 

  63. Gehring, H. Homberger, J.: A parallel hybrid evolutionary metaHeuristic for the vehicle routing problem with time windows. In: Miettinen, K., Makel]:a, M.M., Toivanen, J. (eds.) Proceedings of EUROGEN99 - Short Course on Evolutionary Algorithms in Engineering and Computer Science, pp. 57–64. Jyvaskyla, Finland, (1997)

    Google Scholar 

  64. Gehring, H. Homberger, J.: A parallel two-phase metaheuristic for routing problems with time windows. Asia-Pacific J. Oper. Res. 18(1), 35–47, (2001)

    Google Scholar 

  65. Gehring, H. Homberger, J.: Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heuristics 8, 251–276, (2002)

    Article  Google Scholar 

  66. Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, é.D.: Tabu search for real-time vehicle routing and dispatching. Transp. Sci. 33(4), 381–390, (1999)

    Article  Google Scholar 

  67. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40, 1276–1290, (1994)

    Article  Google Scholar 

  68. Gendreau, M., Laporte , G., Semet, F.: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput. 27(12), 1641–1653, (2001)

    Article  Google Scholar 

  69. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 1(3), 533–549, (1986)

    Article  Google Scholar 

  70. Glover, F.: Tabu search and adaptive memory programming – advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer, Norwell, MA, (1996)

    Google Scholar 

  71. Glover, F. Laguna, M.: Tabu search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 70–150. Blackwell Scientific Publications, Oxford, (1993)

    Google Scholar 

  72. Glover, F. Laguna, M.: Tabu Search. Kluwer, Norwell, MA, (1997)

    Book  Google Scholar 

  73. Glover, F., Taillard, é.D., de Werra, D.: A User’s Guide to Tabu Search. Annals Oper. Res. 41, 3–28, (1993)

    Article  Google Scholar 

  74. Greening, D.R.: A taxonomy of parallel simulated annealing techniques. Technical Report No. RC 14884, IBM, (1989)

    Google Scholar 

  75. Greening, D.R.: Asynchronous parallel simulated annealing. Lect. Comp. Syst. 3, 497–505, (1990)

    Google Scholar 

  76. Greening, D.R.: Parallel simulated annealing techniques. Physica D 42, 293–306, (1990)

    Article  Google Scholar 

  77. Herdy, M.: Reproductive isolation as strategy parameter in hierarchical organized evolution strategies. In: Männer, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, 2, pp. 207–217. North-Holland, Amsterdam, (1992)

    Google Scholar 

  78. Hidalgo, J.I., Prieto, M., Lanchares, J., Baraglia, R., Tirado, F., Garnica, O.: Hybrid parallelization of a compact genetic algorithm. In: Proceedings of the 11th Uromicro Conference on Parallel, Distributed and Network-Based Processing, pp. 449–455, (2003)

    Google Scholar 

  79. Holmqvist, K., Migdalas, A., Pardalos, P.M.: Parallelized heuristics for combinatorial search. In: Migdalas, A., Pardalos, P.M., Storoy, S. (eds.) Parallel Computing in Optimization, pp. 269–294. Kluwer, Norwell, MA, (1997)

    Chapter  Google Scholar 

  80. Homberger, J. Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37, 297–318, (1999)

    Google Scholar 

  81. Janson, S., Merkle, D., Middendorf, M.: Parallel ant colony algorithms. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Metaheuristics, pp. 171–201. Wiley, Hoboken, NJ, (2005)

    Chapter  Google Scholar 

  82. Kravitz, S.A. Rutenbar, R.: Placement by simulated annealing on a multiprocessor. IEEE Trans. Comput. Aid. Des. 6, 534–549, (1987)

    Article  Google Scholar 

  83. Laganière, R. Mitiche, A.: Parallel tabu search for robust image filtering. In Proceedings of IEEE Workshop on Nonlinear Signal and Image Processing (NSIP’95), vol. 2, pp. 603–605, (1995)

    Google Scholar 

  84. Laursen, P.S.: Parallel heuristic search – introductions and a new approach. In: Ferreira, A., Pardalos, P.M. (eds.) Solving Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer Science 1054, vol. 1054 pp. 248–274. Springer, Berlin, (1996)

    Chapter  Google Scholar 

  85. Le Bouthillier, A.: Recherches coopératives pour la résolution de problèmes d’optimisation combinatoire. PhD thesis, Département d’informatique et de recherche opérationnelle, Université de Montréal, Montréal, QC, Canada, (2007)

    Google Scholar 

  86. Le Bouthillier, A. Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput. Oper. Res. 32(7), 1685–1708, (2005)

    Article  Google Scholar 

  87. Le Bouthillier, A., Crainic, T.G., Kropf, P.: A guided cooperative search for the vehicle routing problem with time windows. IEEE Intell. Syst. 20(4), 36–42, (2005)

    Article  Google Scholar 

  88. Lee, K.G. Lee, S.Y.: Efficient parallelization of simulated annealing using multiple markov chains: an application to graph partitioning. In: Mudge, T.N. (ed.) Proceedings of the International Conference on Parallel Processing, volume III: Algorithms and Applications, pp. 177–180. CRC Press, (1992)

    Google Scholar 

  89. Lee, K.G. Lee, S.Y.: Synchronous and asynchronous parallel simulated annealing with multiple Markov chains. In: Brandenburg, F.J. (ed.) Graph Drawing - Proceedings GD ’95, Symposium on Graph Drawing, Passau, Germany, Lecture Notes in Computer Science, vol. 1027 pp. 396–408. Springer, Berlin, (1995)

    Google Scholar 

  90. Lee, S.Y. Lee, K.G.: Asynchronous communication of multiple markov chains in parallel simulated annealing. In: Mudge, T.N. (ed.) Proceedings of the International Conference on Parallel Processing, volume III: Algorithms and Applications, pp. 169–176. CRC Press, Boca Raton, FL, (1992)

    Google Scholar 

  91. Lee, S.Y. Lee, K.G.: Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains. IEEE Trans. Parallel Distribut. Syst. 7(10), 993–1007, (1996)

    Article  Google Scholar 

  92. Li, Y., Pardalos, P.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for quadratic assignment problem. In DIMACS Implementation Challenge, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237–261. American Mathematical Society, (1994)

    Google Scholar 

  93. Lin, S.-C., Punch, W., Goodman, E.: Coarse-grain parallel genetic algorithms: categorization and new approach. In 6th IEEE Symposium on Parallel and Distributed Processing, pp. 28–37. IEEE Computer Society Press, (1994)

    Google Scholar 

  94. Malek, M., Guruswamy, M., Pandya, M., Owens, H.: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Annals Oper. Res. 21, 59–84, (1989)

    Article  Google Scholar 

  95. Martins, S.L., Resende, M.G.C., Ribeiro, C.C., Parlados, P.M.: A parallel grasp for the steiner tree problem in graphs using a hybrid local search strategy. J. Global Optimization 17, 267–283, (2000)

    Article  Google Scholar 

  96. Martins, S.L., Ribeiro, C.C., Souza, M.C.: A parallel GRASP for the Steiner problem in graphs. In: Ferreira, A., Rolim, J. (eds.) Proceedings of IRREGULAR’98 – 5th International Symposium on Solving Irregularly Structured Problems in Parallel, Lecture Notes in Computer Science, vol. 1457 pp. 285–297. Springer, (1998)

    Google Scholar 

  97. Michels, R. Middendorf, M.: An ant system for the shortest common supersequence problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 51–61. McGraw-Hill, (1999)

    Google Scholar 

  98. Middendorf, M., Reischle, F., Schmeck, S.: Multi colony ant algorithms. J. Heuristics 8(3), 305–320, (2002)

    Article  Google Scholar 

  99. Miki, M., Hiroyasu, T., Wako, J., Yoshida, T.: Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing. In: CEC’03 - The 2003 Congress on Evolutionary Computation, vol. 1, pp. 459–466, (2003)

    Google Scholar 

  100. Moreno-Pérez, J.A., Hansen, P., Mladenović, N.: Parallel variable neighborhood search. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Metaheuristics, pp. 247–266. Wiley, Hoboken, NJ, (2005)

    Chapter  Google Scholar 

  101. Mühlenbein, H.: Parallel genetic algorithms, population genetics and combinatorial optimization. In: Schaffer, J.D., (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 416–421. Morgan Kaufmann, San Mateo, CA, (1989)

    Google Scholar 

  102. Mühlenbein, H.: Evolution in time and space - the parallel genetic algorithm. In: Rawlins, G.J.E. (ed.) Foundations of Genetic Algorithm & Classifier Systems, pp. 316–338. Morgan Kaufman, San Mateo, CA, (1991)

    Google Scholar 

  103. Mühlenbein, H.: Parallel genetic algorithms, population genetics, and combinatorial optimization. In: Becker, J.D., I. Eisele, Mündemann, F.W. (eds.) Parallelism, Learning, Evolution. Workshop on Evolutionary Models and Strategies - WOPPLOT 89, pp. 398–406. Springer, Berlin, (1991)

    Google Scholar 

  104. Mühlenbein, H.: Parallel genetic algorithms in combinatorial optimization. In: Balci, O., Sharda, R., Zenios, S. (eds.) Computer Science and Operations Research: New Developments in their Interface, pp. 441–456. Pergamon Press, New York, NY, (1992)

    Google Scholar 

  105. Mühlenbein, H.: How genetic algorithms really work: mutation and hill-climbing. In Männer, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, 2, pp. 15–26. North-Holland, Amsterdam, (1992a)

    Google Scholar 

  106. Mühlenbein, H., Gorges-Schleuter, M., Krämer, O.: New solutions to the mapping problem of parallel systems - the evolution approach. Parallel Comput. 6, 269–279, (1987)

    Article  Google Scholar 

  107. Mühlenbein, H., Gorges-Schleuter, M., Krämer, O.: Evolution algorithms in combinatorial optimization. Parallel Comput. 7(1), 65–85, (1988)

    Article  Google Scholar 

  108. Niar, S. Fréville, A.: A parallel tabu search algorithm for the 0-1 multidimensional knapsack problem. In: 11th International Parallel Processing Symposium (IPPS ’97), Geneva, Switzerland, pp. 512–516. IEEE, (1997)

    Google Scholar 

  109. Oduntan, I.O., Toulouse, M., Baumgartner, R., Bowman, C., Somorjai, R., Crainic, T.G.: A multilevel tabu search algorithm for the feature selection problem in biomedical data Sets. Comput. Math. Appl. 55(5), 1019–1033, (2008)

    Article  Google Scholar 

  110. Ouyang, M., Toulouse, M., Thulasiraman, K., Glover, F., Deogun, J.S.: Multi-level cooperative search: application to the netlist/hypergraph partitioning problem. In Proceedings of International Symposium on Physical Design, pp. 192–198. ACM Press, (2000)

    Google Scholar 

  111. Ouyang, M., Toulouse, M., Thulasiraman, K., Glover, F., Deogun, J.S.: Multilevel cooperative search for the circuit/hypergraph partitioning problem. IEEE Trans. Comput.-Aid. Des. 21(6), 685–693, (2002)

    Article  Google Scholar 

  112. Pardalos, P.M., Li, Y., Murthy, K.A.: Computational experience with parallel algorithms for solving the quadratic assignment problem. In: Balci, O., Sharda, R., Zenios, S. (eds.) Computer Science Operations Research: New Developments in their Interface, pp. 267–278. Pergamon Press, New York, NY, (1992)

    Google Scholar 

  113. Pardalos, P.M., L. Pitsoulis, T. Mavridou, Resende, M.G.C.: Parallel search for combinatorial optimization: genetic algorithms, simulated annealing, tabu Search and GRASP. In: Ferreira, A., Rolim, J. (eds.) Proceedings of Workshop on Parallel Algorithms for Irregularly Structured Problems, Lecture Notes in Computer Science, vol. 980, pp. 317–331. Springer, Berlin, (1995)

    Google Scholar 

  114. Pardalos, P.M., Pitsoulis, L., Resende, M.G.C.: A parallel GRASP implementation for the quadratic assignment problem. In: Ferreira, A., Rolim, J. (eds.) Solving Irregular Problems in Parallel: State of the Art, pp. 115–130. Kluwer, Norwell, MA, (1995)

    Google Scholar 

  115. Porto, S.C.S., Kitajima, J.P.F.W., Ribeiro, C.C.: Performance evaluation of a parallel tabu search task scheduling algorithm. Parallel Comput. 26, 73–90, (2000)

    Article  Google Scholar 

  116. Porto, S.C.S. Ribeiro, C.C.: A tabu search approach to task scheduling on heterogenous processors under precedence constraints. Int. J. High-Speed Comput. 7, 45–71, (1995)

    Article  Google Scholar 

  117. Porto, S.C.S. Ribeiro, C.C.: Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. J. Heuristics 1(2), 207–223, (1996)

    Article  Google Scholar 

  118. Rahoual, M., Hadji, R., Bachelet, V.: Parallel ant system for the set covering problem. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) Ant Algorithms - Proceedings of the 3rd International Workshop, ANTS 2002, Lecture Notes in Computer Science, vol. 2463 pp. 262–267. Springer, Berlin, (2002)

    Google Scholar 

  119. Ram, D.J., Sreenivas, T.H., Subramaniam, K.G.: Parallel simulated annealing algorithms. J. Parallel Distribut. Comput. 37, 207–212, (1996)

    Article  Google Scholar 

  120. Randall, M. Lewis, A.: A parallel implementation of ant colony optimisation. J. Parallel Distribut. Comput. 62, 1421–1432, (2002)

    Article  Google Scholar 

  121. Rego, C.: Node ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput. 27, 201–222, (2001)

    Article  Google Scholar 

  122. Rego, C. Roucairol, C.: A parallel tabu search algorithm using ejection chains for the VRP. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heuristics: Theory & Applications, pp. 253–295. Kluwer, Norwell, MA, (1996)

    Google Scholar 

  123. Reimann, M., Doerner, K., Hartl, R.: D-Ants: Savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31(4), 563–591, (2004)

    Article  Google Scholar 

  124. Reimann, M., Stummer, M., Doerner, K.: A savings based ants system for the vehicle routing problem. In: Langton, C., Cantú-Paz, E., Mathias, K.E., Roy, R., Davis, L., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E.K., Jonoska. N. (eds.) GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, July 9-13, 2002, pp. 1317–1326. Morgan Kaufmann Publishers, San Francisco, CA, (2002)

    Google Scholar 

  125. Ribeiro, C.C. Rosseti, I.: A parallel GRASP heuristic for the 2-path network design problem. 4 journée ROADEF, Paris, February 20-22, (2002)

    Google Scholar 

  126. Ribeiro C.C. Rosseti, I.: A parallel GRASP heuristic for the 2-path network design problem. Third Meeting of the PAREO Euro Working Group, Guadeloupe (France), May, (2002)

    Google Scholar 

  127. Ribeiro C.C. Rosseti, I.: Parallel grasp with path-relinking heuristic for the 2-path network design problem. AIRO’2002, L’Aquila, Italy, September, (2002)

    Google Scholar 

  128. Rochat, Y. Taillard, é.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1), 147–167, (1995)

    Article  Google Scholar 

  129. Sanvicente-Sánchez, H. Frausto-Solís, J.: MPSA: a methodology to parallelize simulated annealing and its application to the traveling salesman problem. In: Coello Coello, C.A., de Albornoz, A., Sucar, L.E. Battistutti, O.C. (eds.) MICAI 2002: Advances in Artificial Intelligence, volume 2313 of Lecture Notes in Computer Science, pp. 89–97. Springer Heidelberg, (2002)

    Chapter  Google Scholar 

  130. Schlierkamp-Voosen, D. Mühlenbein, H.: Strategy adaptation by competing subpopulations. In: Davidor, Y., Schwefel, H.-P., Männer, R. (eds.) Parallel Problem Solving from Nature III, Lecture Notes in Computer Science, vol. 866 pp. 199–208. Springer, Berlin, (1994)

    Google Scholar 

  131. Schulze, J. Fahle, T.: A parallel algorithm for the vehicle routing problem with time window constraints. Annals Oper. Res. 86, 585–607, (1999)

    Article  Google Scholar 

  132. Shonkwiler, R.: Parallel genetic algorithms. In: Forrest, S. (ed.) Proceedings of the 5th International Conference on Genetic Algorithms, pp. 199–205. Morgan Kaufmann, San Mateo, CA, (1993)

    Google Scholar 

  133. Solar, M., Parada, V., Urrutia, R.: A parallel genetic algorithm to solve the set-covering problem. Comput. Oper. Res. 29(9), 1221–1235, (2002)

    Article  Google Scholar 

  134. Stutzle, T.: Parallelization strategies for ant colony optimization. In: Eiben, A.E., Back, T., Schoenauer, M., Schwefel, H.-P. (eds.) Proceedings of Parallel Problem Solving from Nature V, Lecture Notes in Computer Science, vol. 1498 pp. 722–731. Springer, Heidelberg, (1998)

    Google Scholar 

  135. Taillard, é.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443–455, (1991)

    Article  Google Scholar 

  136. Taillard, é.D.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661–673, (1993)

    Article  Google Scholar 

  137. Taillard, é.D.: Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comput. 6(2), 108–117, (1994)

    Google Scholar 

  138. Taillard, é.D., Gambardella, L.M., Gendreau, M., Potvin, J.-Y.: Adaptive memory programming: a unified view of metaheuristics. Eur. J. Oper. Res. 135, 1–10, (1997)

    Article  Google Scholar 

  139. Taillard, é.D., Gambardella, L.M., Gendreau, M., Potvin, J.-Y.: Programmation à mémoire adaptative. Calculateurs Parallèles, Réseaux et Systèmes répartis 10, 117–140, (1998)

    Google Scholar 

  140. Talbi, E.-G., Hafidi, Z., Geib, J.-M.: Parallel adaptive tabu search approach. Parallel Comput. 24, 2003–2019, (1998)

    Article  Google Scholar 

  141. Talbi, E.-G., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for combinatorial optimization problems. In: José Rolim et al. (ed.) 11th IPPS/SPDP’99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, April 12-16, San Juan, Puerto Rico, Lecture Notes in Computer Science, vol. 1586 pp. 239–247. Springer, Berlin, (1999)

    Google Scholar 

  142. ten Eikelder, H.M.M., Aarts, B.J.M., Verhoeven, M.G.A., Aarts, E.H.L.: Sequential and parallel local search for job shop scheduling. In: Voß, S., Martello, S., Roucairol, C., Osman, I.H. (eds.) Meta-Heuristics 98: Theory & Applications, pp. 359–371. Kluwer, Norwell, MA, (1999)

    Google Scholar 

  143. Tongcheng, G. Chundi, M.: Radio network design using coarse-grained parallel genetic algorithms with different neighbor topology. In: Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 3, pp. 1840–1843, (2002)

    Google Scholar 

  144. Toulouse, M., Crainic, T.G., Gendreau, M.: Communication issues in designing cooperative multi thread parallel searches. In: Osman I.H., Kelly, J.P. (eds.) Meta-Heuristics: Theory & Applications, pp. 501–522. Kluwer, Norwell, MA, (1996)

    Google Scholar 

  145. Toulouse, M., Crainic, T.G., Sansó, B.: An Experimental study of systemic behavior of cooperative search algorithms. In: Voß, S., Martello, S., Roucairol, C., Osman, I.H. (eds.) Meta-Heuristics 98: Theory & Applications, pp. 373–392. Kluwer, Norwell, MA, (1999)

    Google Scholar 

  146. Toulouse, M., Crainic, T.G., Sansó, B.: Systemic behavior of cooperative search algorithms. Parallel Comput. 30(1), 57–79, (2004)

    Article  Google Scholar 

  147. Toulouse, M., Crainic, T.G., Sansó, B., Thulasiraman, K.: Self-organization in cooperative search algorithms. In: Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, pp. 2379–2385. Omnipress, Madisson, WI, (1998)

    Google Scholar 

  148. Toulouse, M., Crainic, T.G., Thulasiraman, K.: Global optimization properties of parallel cooperative search algorithms: a simulation study. Parallel Comput. 26(1), 91–112, (2000)

    Article  Google Scholar 

  149. Toulouse, M., Thulasiraman, K., Glover, F.: Multi-level cooperative search: a new paradigm for combinatorial optimization and an application to graph partitioning. In: Amestoy, P., Berger, P., Daydé, M., Duff, I., Frayssé, V., Giraud, L., Ruiz, D. (eds.) 5th International Euro-Par Parallel Processing Conference, Lecture Notes in Computer Science, vol. 1685 pp. 533–542. Springer, Heidelberg, (1999)

    Google Scholar 

  150. Verhoeven, M.G.A. Aarts, E.H.L.: Parallel local search. J. Heuristics 1(1), 43–65, (1995)

    Article  Google Scholar 

  151. Voß, S.: Tabu search: applications and prospects. In: Du, D.-Z., Pardalos, P.M. (eds.) Network Optimization Problems, pp. 333–353. World Scientific Publishing, Singapore, (1993)

    Google Scholar 

  152. Wilkerson, R. Nemer-Preece, N.: Parallel genetic algorithm to solve the satisfiability problem. In Proceedings of the 1998 ACM symposium on Applied Computing, pp. 23–28. ACM Press, (1998)

    Google Scholar 

Download references

Acknowledgements

The authors wish to acknowledge the contributions of their colleagues and students, in particular professor Michel Gendreau, Université de Montréal, who collaborated over the years to their work on parallel meta-heuristics for combinatorial optimization. While working on this project, the first author was the NSERC Industrial Research Chair on Logistics Management, ESG UQAM, and adjunct professor with the Department of Computer Science and Operations Research, Université de Montréal, and the Department of Economics and Business Administration, Molde University College, Norway. The second author was adjunct professor with the Department of Computer Science and Operations Research, Université de Montréal, and visiting associate professor with the Department of Computer Science at Oklahoma State University. Partial funding for this project has been provided by the Natural Sciences and Engineering Council of Canada (NSERC), through its Industrial Research Chair and Discovery Grants programs, by the partners of the Chair, CN, Rona, Alimentation Couche-Tard and the Ministry of Transportation of Québec, and by the Fonds québécois de recherche sur la nature et les technologies (FQRNT Québec) through its Team Research grants program.

Author information

Authors and Affiliations

  1. Département de management et technologie, École des sciences de la gestion, and Interuniversity Research Centre on Enterprise Networks, Logistics, and Transportation (CIRRELT), Université du Québec à Montréal, Montréal, QC, Canada

    Teodor Gabriel Crainic

  2. Interuniversity Research Centre on Enterprise Networks, Logistics, and Transportation (CIRRELT), Université de Montréal, Montréal, QC, Canada

    Michel Toulouse

Authors
  1. Teodor Gabriel Crainic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Toulouse
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Teodor Gabriel Crainic or Michel Toulouse .

Editor information

Editors and Affiliations

  1. , Département de mathématiques et génie in, École Polytechnique Montréal, Montreal, H3C 3A7, Québec, Canada

    Michel Gendreau

  2. Dépt. Informatique et Recherche, Opérationnelle, Université de Montreal, Pavillon André-Aisenstadt, Montreal, H3C 3J7, Québec, Canada

    Jean-Yves Potvin

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Crainic, T.G., Toulouse, M. (2010). Parallel Meta-heuristics. In: Gendreau, M., Potvin, JY. (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol 146. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1665-5_17

Download citation

Publish with us

Policies and ethics

Search

Navigation