{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:34:41Z","timestamp":1760646881406,"version":"3.37.3"},"publisher-location":"Cham","reference-count":171,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_40","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T15:09:59Z","timestamp":1534172999000},"page":"809-847","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Metaheuristic Search"],"prefix":"10.1007","author":[{"given":"Teodor Gabriel","family":"Crainic","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Aiex RM, Martins SL, Ribeiro CC, Rodriguez NR (1998) Cooperative multi-thread parallel tabu search with an application to circuit partitioning. In: Proceedings of IRREGULAR\u201998 \u2013 5th international symposium on solving irregularly structured problems in parallel. Lecture notes in computer science, vol 1457. Springer, Berlin\/New York, pp 310\u2013331","DOI":"10.1007\/BFb0018549"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Alba E (ed) (2005) Parallel metaheuristics: a new class of algorithms. Wiley, Hoboken","DOI":"10.1002\/0471739383"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Alba E, Dorronsoro B (2004) Solving the vehicle routing problem by using cellular genetic algorithms. In: Gottlieb J, G\u00fcnther RR (eds) Evolutionary computation in combinatorial optimization, 4th European conference, EvoCOP 2004, Coimbra, 5\u20137 Apr 2004. Lecture notes in computer science, vol 3004. Springer, Heidelberg, pp 11\u201320","DOI":"10.1007\/978-3-540-24652-7_2"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Alba E, Luque G, Nesmachnow S (2013) Parallel metaheuristics: recent advances and new trends. Int Trans Oper Res 20(1):1\u201348","DOI":"10.1111\/j.1475-3995.2012.00862.x"},{"key":"40_CR5","unstructured":"Azencott R (1992) Simulated annealing parallelization techniques. Wiley, New York"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Badeau P, Gendreau M, Guertin F, Potvin JY, Taillard E (1997) A parallel tabu search heuristic for the vehicle routing problem with time windows. Transp Res C: Emerg Technol 5(2): 109\u2013122","DOI":"10.1016\/S0968-090X(97)00005-3"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Banos R, Gil C, Ortega J, Montoya FG (2004) A parallel multilevel metaheuristic for graph partitioning. J Heuristics 10(4):315\u2013336","DOI":"10.1023\/B:HEUR.0000026898.11874.e7"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Banos R, Gil C, Ortega J, Montoya FG (2004) Parallel heuristic search in multilevel graph partitioning. In: Proceedings of the 12th Euromicro conference on parallel, distributed and network-based processing, A Coru\u00f1a, pp 88\u201395","DOI":"10.1109\/EMPDP.2004.1271432"},{"key":"40_CR9","unstructured":"Barr RS, Hickman BL (1993) Reporting computational experiments with parallel algorithms: issues, measures, and experts opinions. ORSA J Comput 5(1):2\u201318"},{"key":"40_CR10","unstructured":"Bastos MP, Ribeiro CC (1999) Reactive tabu search with path-relinking for the Steiner problem in graphs. In: Vo\u00df S, Martello S, Roucairol C, Osman IH (eds) Meta-heuristics 98: theory & applications. Kluwer Academic, Norwell, pp 31\u201336"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Battiti R, Tecchiolli G (1992) Parallel based search for combinatorial optimization: genetic algorithms and TABU. Microprocessors Microsyst 16(7):351\u2013367","DOI":"10.1016\/0141-9331(92)90003-C"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Berger J, Barkaoui M (2004) A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 31(12):2037\u20132053","DOI":"10.1016\/S0305-0548(03)00163-1"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Blazewicz J, Moret-Salvador A, Walkowiak R (2004) Parallel tabu search approaches for two-dimensional cutting. Parallel Process Lett 14(1):23\u201332","DOI":"10.1142\/S0129626404001684"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Bock S, Rosenberg O (2000) A new parallel breadth first tabu search technique for solving production planning problems. Int Trans Oper Res 7(6):625\u2013635","DOI":"10.1111\/j.1475-3995.2000.tb00221.x"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Bortfeldt A, Gehring H, Mack D (2003) A parallel tabu search algorithm for solving the container loading problem. Parallel Comput 29:641\u2013662","DOI":"10.1016\/S0167-8191(03)00047-4"},{"key":"40_CR16","unstructured":"Brodtkorb AR, Hagen TR, Schulz C, Hasle G (2013) GPU computing in discrete optimization. Part I: introduction to the GPU. EURO J Transp Logist 2(1\u20132):129\u2013157"},{"key":"40_CR17","unstructured":"Brodtkorb AR, Hagen TR, Schulz C, Hasle G (2013) GPU computing in discrete optimization. Part II: survey focussed on routing problems. EURO J Transp Logist 2(1\u20132):159\u2013186"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Bullnheimer B, Kotsis G, Strau\u00df C (1999) 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. Applied optimization, vol 24, Kluwer Academic, Dordrecht, pp 87\u2013100. http:\/\/www.bwl.univie.ac.at\/bwl\/prod\/papers\/pom-wp-9-97.ps","DOI":"10.1007\/978-1-4613-3279-4_6"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Cal\u00e9gari P, Guidec F, Kuonen P, Kuonen D (1997) Parallel Island-based genetic algorithm for radio network design. J Parallel Distrib Comput 47(1):86\u201390","DOI":"10.1006\/jpdc.1997.1397"},{"key":"40_CR20","unstructured":"Cant\u00fa-Paz E (1998) A survey of parallel genetic algorithms. Calculateurs Parall\u00e8les, R\u00e9seaux et Syst\u00e8mes r\u00e9partis 10(2):141\u2013170"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"Cant\u00fa-Paz E (2005) Theory of parallel genetic algorithms. In: Alba E (ed) Parralel metaheuristics: a new class of algorithms. Wiley, Hoboken, pp 425\u2013445","DOI":"10.1002\/0471739383.ch18"},{"key":"40_CR22","doi-asserted-by":"crossref","unstructured":"Cavalcante CBC, Cavalcante VF, Ribeiro CC, Souza MC (2002) Parallel cooperative approaches for the labor constrained scheduling problem. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer Academic, Norwell, pp 201\u2013225","DOI":"10.1007\/978-1-4615-1507-4_10"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Chakrapani J, Skorin-Kapov J (1992) A connectionist approach to the quadratic assignment problem. Comput Oper Res 19(3\/4):287\u2013295","DOI":"10.1016\/0305-0548(92)90050-F"},{"key":"40_CR24","unstructured":"Chakrapani J, Skorin-Kapov J (1993) Connection machine implementation of a tabu search algorithm for the traveling salesman problem. J Comput Inf Technol 1(1):29\u201336"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Chakrapani J, Skorin-Kapov J (1993) Massively parallel tabu search for the quadratic assignment problem. Ann Oper Res 41:327\u2013341","DOI":"10.1007\/BF02022999"},{"key":"40_CR26","doi-asserted-by":"crossref","unstructured":"Chao IM, Golden B L, Wasil EA (1995) An improved heuristic for the period vehicle routing problem. Networks 26(1):25\u201344","DOI":"10.1002\/net.3230260104"},{"key":"40_CR27","unstructured":"Cohoon J, Hedge S, Martin W, Richards D (1987) Punctuated equilibria: a parallel genetic algorithm. In: Grefenstette J (ed) Proceedings of the second international conference on genetic algorithms and their applications. Lawrence Erlbaum Associates, Hillsdale, pp 148\u2013154"},{"key":"40_CR28","doi-asserted-by":"crossref","unstructured":"Cohoon J, Hedge S, Richards D (1991) Genetic algorithm and punctuated equilibria in VLSI. In: Schwefel H-P, M\u00e4nner R (eds) Parallel problem solving from nature. Lecture notes in computer science, vol 496. Springer, Berlin, pp 134\u2013144","DOI":"10.1007\/BFb0029744"},{"key":"40_CR29","unstructured":"Cohoon J, Hedge S, Richards D (1991) A multi-population genetic algorithm for solving the k-partition problem on hyper-cubes. In: Belew R, Booker L (eds) Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 134\u2013144"},{"key":"40_CR30","unstructured":"Cordeau JF, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39(9):2033\u20132050"},{"key":"40_CR31","doi-asserted-by":"crossref","unstructured":"Cordeau JF, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52:928\u2013936","DOI":"10.1057\/palgrave.jors.2601163"},{"key":"40_CR32","doi-asserted-by":"crossref","unstructured":"Crainic TG (2005) Parallel computation, co-operation, tabu search. In: Rego C, Alidaee B (eds) Metaheuristic optimization via memory and evolution: tabu search and scatter search. Kluwer Academic, Norwell, pp 283\u2013302","DOI":"10.1007\/0-387-23667-8_13"},{"key":"40_CR33","doi-asserted-by":"crossref","unstructured":"Crainic TG (2008) Parallel solution methods for vehicle routing problems. In: Golden BL, Raghavan S, Wasil EA (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 171\u2013198","DOI":"10.1007\/978-0-387-77778-8_8"},{"key":"40_CR34","unstructured":"Crainic TG, Gendreau M (1999) Towards an evolutionary method \u2013 cooperating multi-thread parallel tabu search hybrid. In: Vo\u00df S, Martello S, Roucairol C, Osman IH (eds) Meta-heuristics 98: theory & applications. Kluwer Academic, Norwell, pp 331\u2013344"},{"key":"40_CR35","unstructured":"Crainic TG, Gendreau M (2002) Cooperative parallel tabu search for capacitated network design. J Heuristics 8(6):601\u2013627"},{"key":"40_CR36","unstructured":"Crainic TG, Hail N (2005) Parallel meta-heuristics applications. In: Alba E (ed) Parallel metaheuristics: a new class of algorithms. Wiley, Hoboken, pp 447\u2013494"},{"key":"40_CR37","doi-asserted-by":"crossref","unstructured":"Crainic TG, Toulouse M (1998) Parallel metaheuristics. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer Academic, Norwell, pp 205\u2013251","DOI":"10.1007\/978-1-4615-5755-5_10"},{"key":"40_CR38","doi-asserted-by":"crossref","unstructured":"Crainic TG, Toulouse M (2003) Parallel strategies for meta-heuristics. In: Glover F, Kochenberger G (eds) Handbook in metaheuristics. Kluwer Academic, Norwell, pp 475\u2013513","DOI":"10.1007\/0-306-48056-5_17"},{"key":"40_CR39","doi-asserted-by":"crossref","unstructured":"Crainic TG, Toulouse M (2008) Explicit and emergent cooperation schemes for search algorithms. In: Maniezzo V, Battiti R, Watson J-P (eds) Learning and intelligent optimization. Lecture notes in computer science, vol 5315. Springer, Berlin, pp 95\u2013109","DOI":"10.1007\/978-3-540-92695-5_8"},{"key":"40_CR40","doi-asserted-by":"crossref","unstructured":"Crainic TG, Toulouse M (2010) Parallel meta-heuristics. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, 2nd edn. Springer, New York, pp 497\u2013541","DOI":"10.1007\/978-1-4419-1665-5_17"},{"key":"40_CR41","doi-asserted-by":"crossref","unstructured":"Crainic TG, Toulouse M, Gendreau M (1995) Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum 17(2\/3):113\u2013123","DOI":"10.1007\/BF01719254"},{"key":"40_CR42","doi-asserted-by":"crossref","unstructured":"Crainic TG, Toulouse M, Gendreau M (1996) Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Ann Oper Res 63:277\u2013299","DOI":"10.1007\/BF02125458"},{"key":"40_CR43","doi-asserted-by":"crossref","unstructured":"Crainic TG, Toulouse M, Gendreau M (1997) Towards a taxonomy of parallel tabu search algorithms. INFORMS J Comput 9(1):61\u201372","DOI":"10.1287\/ijoc.9.1.61"},{"key":"40_CR44","doi-asserted-by":"crossref","unstructured":"Crainic TG, Gendreau M, Hansen P, Mladenovi\u0107 N (2004) Cooperative parallel variable neighborhood search for the p-median. J Heuristics 10(3):293\u2013314","DOI":"10.1023\/B:HEUR.0000026897.40171.1a"},{"key":"40_CR45","doi-asserted-by":"crossref","unstructured":"Crainic TG, Gendreau M, Potvin JY (2005) Parallel tabu search. In: Alba E (ed) Parallel metaheuristics. Wiley, Hoboken, pp 298\u2013313","DOI":"10.1002\/0471739383.ch13"},{"key":"40_CR46","doi-asserted-by":"crossref","unstructured":"Crainic TG, Di Chiara B, Nonato M, Tarricone L (2006) Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-heuristics. IEEE Wirel Commun 13(6):34\u201341","DOI":"10.1109\/MWC.2006.275196"},{"key":"40_CR47","doi-asserted-by":"crossref","unstructured":"Crainic TG, Li Y, Toulouse M (2006) A first multilevel cooperative algorithm for the capacitated multicommodity network design. Comput Oper Res 33(9):2602\u20132622","DOI":"10.1016\/j.cor.2005.07.015"},{"key":"40_CR48","doi-asserted-by":"crossref","unstructured":"Crainic TG, Crisan GC, Gendreau M, Lahrichi N, Rei W (2009) A concurrent evolutionary approach for cooperative rich combinatorial optimization. In: Genetic and evolutionary computation conference \u2013 GECCO 2009, Montr\u00e9al, 8\u201312 July. ACM, cD-ROM","DOI":"10.1145\/1570256.1570269"},{"key":"40_CR49","doi-asserted-by":"crossref","unstructured":"Crainic TG, Crisan GC, Gendreau M, Lahrichi N, Rei W (2009) Multi-thread integrative cooperative optimization for rich combinatorial problems. In: The 12th international workshop on nature inspired distributed computing \u2013 NIDISC\u201909, 25\u201329 May, Rome, cD-ROM","DOI":"10.1109\/IPDPS.2009.5161124"},{"key":"40_CR50","doi-asserted-by":"crossref","unstructured":"Crainic TG, Davidovi\u0107 T, Ramljak D (2014) Designing parallel meta-heuristic methods. In: Despotovic-Zrakic M, Milutinovic V, Belic A (eds) High performance and cloud computing in scientific research and education. IGI Global, Hershey, pp 260\u2013280","DOI":"10.4018\/978-1-4666-5784-7.ch011"},{"key":"40_CR51","doi-asserted-by":"crossref","unstructured":"Cung VD, Martins SL, Ribeiro CC, Roucairol C (2002) Strategies for the parallel implementations of metaheuristics. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer Academic, Norwell, pp 263\u2013308","DOI":"10.1007\/978-1-4615-1507-4_13"},{"key":"40_CR52","unstructured":"Czech ZJ (2000) A parallel genetic algorithm for the set partitioning problem. In: 8th Euromicro workshop on parallel and distributed processing, Rhodos, pp 343\u2013350"},{"key":"40_CR53","unstructured":"Dai C, Li B, Toulouse M (2009) A multilevel cooperative tabu search algorithm for the covering design problem. J Comb Math Comb Comput 68:35\u201365"},{"key":"40_CR54","doi-asserted-by":"crossref","unstructured":"Davidovi\u0107 T, Crainic TG (2015) Parallel local search to schedule communicating tasks on identical processors. Parallel Comput 48:1\u201314","DOI":"10.1016\/j.parco.2015.04.002"},{"key":"40_CR55","doi-asserted-by":"crossref","unstructured":"De Falco I, Del Balio R, Tarantino E, Vaccaro R (1994) Improving search by incorporating evolution principles in parallel tabu search. In: Proceedings international conference on machine learning, New Brunswick, pp 823\u2013828","DOI":"10.1109\/ICEC.1994.349949"},{"key":"40_CR56","unstructured":"De Falco I, Del Balio R, Tarantino E (1995) Solving the mapping problem by parallel tabu search. Report, Istituto per la Ricerca sui Sistemi Informatici Paralleli-CNR"},{"key":"40_CR57","unstructured":"Di Chiara B (2006) Optimum planning of 3G cellular systems: radio propagation models and cooperative parallel meta-heuristics. PhD thesis, Dipartimento di ingegneria dell\u2019innovatione, Universit\u00e1 degli Studi di Lecce, Lecce"},{"key":"40_CR58","doi-asserted-by":"crossref","unstructured":"Diekmann R, L\u00fcling R, Monien B, Spr\u00e4ner C (1996) Combining helpful sets and parallel simulated annealing for the graph-partitioning problem. Int J Parallel Program 8:61\u201384","DOI":"10.1080\/10637199608915544"},{"key":"40_CR59","doi-asserted-by":"crossref","unstructured":"Doerner K, Hartl RF, Kiechle G, Lucka M, Reimann M (2004) Parallel ant systems for the capacitated vehicle routing problem. In: Gottlieb J, Raidl GR (eds) Evolutionary computation in combinatorial optimization: 4th European conference, EvoCOP 2004. Lecture notes in computer science, vol 3004. Springer, Berlin, pp 72\u201383","DOI":"10.1007\/978-3-540-24652-7_8"},{"key":"40_CR60","unstructured":"Doerner KF, Hartl RF, Lucka M (2005) 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\u201905. Springer, New York, pp 109\u2013118"},{"key":"40_CR61","doi-asserted-by":"crossref","unstructured":"Doerner KF, Hartl RF, Benkner S, Lucka M (2006) Cooperative savings based ant colony optimization \u2013 multiple search and decomposition approaches. Parallel Process Lett 16(3):351\u2013369","DOI":"10.1142\/S0129626406002691"},{"key":"40_CR62","unstructured":"Dorigo M, Stuetzle T (2003) The ant colony metaheuristic. Algorithms, applications, and advances. In: F Glover, G Kochenberger (eds) Handbook in metaheuristics. Kluwer Academic, Norwell, pp 251\u2013285"},{"key":"40_CR63","unstructured":"Dorronsoro B, Arias F, Luna A, Nebro AJ, Alba E (2007) A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP. In: Smari W (ed) High performance computing & simulation conference HPCS 2007 within the 21st European conference on modelling and simulation ECMS 2007, pp 759\u2013765. http:\/\/www.scs-europe.net\/conf\/ecms2007\/ecms2007-cd\/ecms2007\/ecms2007finalpapers.html"},{"key":"40_CR64","doi-asserted-by":"crossref","unstructured":"Drias H, Ibri A (2003) Parallel ACS for weighted MAX-SAT. In: Mira J, \u00c1lvarez J (eds) Artificial neural nets problem solving methods \u2013 proceedings of the 7th international work-conference on artificial and natural neural networks. Lecture notes in computer science, vol 2686. Springer, Heidelberg, pp 414\u2013421","DOI":"10.1007\/3-540-44868-3_53"},{"key":"40_CR65","unstructured":"El Hachemi N, Crainic TG, Lahrichi N, Rei W, Vidal T (2014) Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing. Publication CIRRELT-2014-40, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et le transport, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al"},{"key":"40_CR66","doi-asserted-by":"crossref","unstructured":"Fiechter CN (1994) A parallel tabu search algorithm for large travelling salesman problems. Discrete Appl Math 51(3):243\u2013267","DOI":"10.1016\/0166-218X(92)00033-I"},{"key":"40_CR67","doi-asserted-by":"crossref","unstructured":"Flores CD, Cegla BB, Caceres DB (2003) Telecommunication network design with parallel multi-objective evolutionary algorithms. In: IFIP\/ACM Latin America networking conference 2003, La Paz","DOI":"10.1145\/1035662.1035663"},{"key":"40_CR68","doi-asserted-by":"crossref","unstructured":"Folino G, Pizzuti C, Spezzano G (1998) Combining cellular genetic algorithms and local search for solving satisfiability problems. In: Proceedings of the tenth IEEE international conference on tools with artificial intelligence. IEEE Computer Society Press, Piscataway, pp 192\u2013198","DOI":"10.1109\/TAI.1998.744842"},{"key":"40_CR69","doi-asserted-by":"crossref","unstructured":"Folino G, Pizzuti C, Spezzano G (1998) Solving the satisfiability problem by a parallel cellular genetic algorithm. In: Proceedings of the 24th EUROMICRO conference. IEEE Computer Society Press, Los Alamitos, pp 715\u2013722","DOI":"10.1109\/EURMIC.1998.708093"},{"key":"40_CR70","doi-asserted-by":"crossref","unstructured":"Garcia BL, Potvin JY, Rousseau JM (1994) A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput Oper Res 21(9):1025\u20131033","DOI":"10.1016\/0305-0548(94)90073-6"},{"key":"40_CR71","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-L\u00f3pez F, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Moreno-Vega JM (2002) The parallel variable neighborhood search for the p-median problem. J Heuristics 8(3):375\u2013388","DOI":"10.1023\/A:1015013919497"},{"key":"40_CR72","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-L\u00f3pez F, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Moreno-Vega JM (2003) Parallelization of the scatter search for the p-median problem. Parallel Comput 29:575\u2013589","DOI":"10.1016\/S0167-8191(03)00043-7"},{"key":"40_CR73","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-L\u00f3pez F, Garc\u00eda Torres M, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Moreno-Vega JM (2005) Parallel scatter search. In: Alba E (ed) Parallel metaheuristics: a new class of metaheuristics. Wiley, Hoboken, pp 223\u2013246","DOI":"10.1002\/0471739383.ch10"},{"key":"40_CR74","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-L\u00f3pez F, Garc\u00eda Torres M, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Moreno-Vega JM (2006) Solving feature subset selection problem by a parallel scatter search. Eur J Oper Res 169:477\u2013489","DOI":"10.1016\/j.ejor.2004.08.010"},{"key":"40_CR75","unstructured":"Gehring H, Homberger J (1997) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Miettinen K, M akel]:a M, Toivanen J (eds) Proceedings of EUROGEN99 \u2013 short course on evolutionary algorithms in engineering and computer science, Jyvskyla, pp 57\u201364"},{"key":"40_CR76","unstructured":"Gehring H, Homberger J (2001) A parallel two-phase metaheuristic for routing problems with time windows. Asia-Pac J Oper Res 18(1):35\u201347"},{"key":"40_CR77","doi-asserted-by":"crossref","unstructured":"Gehring H, Homberger J (2002) Parallelization of a two-phase metaheuristic for routing problems with time windows. J Heuristics 8:251\u2013276","DOI":"10.1023\/A:1015053600842"},{"key":"40_CR78","doi-asserted-by":"crossref","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40:1276\u20131290","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"40_CR79","doi-asserted-by":"crossref","unstructured":"Gendreau M, Guertin F, Potvin JY, Taillard \u00c9D (1999) Tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381\u2013390","DOI":"10.1287\/trsc.33.4.381"},{"key":"40_CR80","doi-asserted-by":"crossref","unstructured":"Gendreau M, Laporte G, Semet F (2001) A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput 27(12):1641\u20131653","DOI":"10.1016\/S0167-8191(01)00103-X"},{"key":"40_CR81","unstructured":"Glover F (1996) Tabu search and adaptive memory programming \u2013 advances, applications and challenges. In: Barr R, Helgason R, Kennington J (eds) Interfaces in computer science and operations research. Kluwer Academic, Norwell, pp 1\u201375"},{"key":"40_CR82","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Norwell,","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"40_CR83","unstructured":"Golden B L, Wasil EA, Kelly JP, Chao IM (1998) Metaheuristics in vehicle routing. In: Crainic T, Laporte G (eds) Fleet management and logistics. Kluwer Academic, Norwell, pp 33\u201356"},{"key":"40_CR84","unstructured":"Greening DR (1989) A taxonomy of parallel simulated annealing techniques. Technical report No. RC 14884, IBM"},{"key":"40_CR85","unstructured":"Greening DR (1990) Asynchronous parallel simulated annealing. Lect Complex Syst 3:497\u2013505"},{"key":"40_CR86","doi-asserted-by":"crossref","unstructured":"Greening DR (1990) Parallel simulated annealing techniques. Physica D 42:293\u2013306","DOI":"10.1016\/0167-2789(90)90084-3"},{"key":"40_CR87","doi-asserted-by":"crossref","unstructured":"Gro\u00ebr C, Golden B (2011) A parallel algorithm for the vehicle routing problem. INFORMS J Comput 23(2):315\u2013330","DOI":"10.1287\/ijoc.1100.0402"},{"key":"40_CR88","unstructured":"Herdy M (1992) Reproductive isolation as strategy parameter in hierarchical organized evolution strategies. In: M\u00e4nner R, Manderick B (eds) Parallel problem solving from nature, 2. North-Holland, Amsterdam, pp 207\u2013217"},{"key":"40_CR89","doi-asserted-by":"crossref","unstructured":"Hidalgo JI, Prieto M, Lanchares J, Baraglia R, Tirado F, Garnica O (2003) Hybrid parallelization of a compact genetic algorithm. In: Proceedings of the 11th Euromicro conference on parallel, distributed and network-based processing, Genova, pp 449\u2013455","DOI":"10.1109\/EMPDP.2003.1183624"},{"key":"40_CR90","doi-asserted-by":"crossref","unstructured":"Holmqvist K, Migdalas A, Pardalos PM (1997) Parallelized heuristics for combinatorial search. In: Migdalas A, Pardalos P, Storoy S (eds) Parallel computing in optimization. Kluwer Academic, Norwell, pp 269\u2013294","DOI":"10.1007\/978-1-4613-3400-2_8"},{"key":"40_CR91","doi-asserted-by":"crossref","unstructured":"Homberger J, Gehring H (1999) Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37:297\u2013318","DOI":"10.1080\/03155986.1999.11732386"},{"key":"40_CR92","doi-asserted-by":"crossref","unstructured":"Janson S, Merkle D, Middendorf M (2005) Parallel ant colony algorithms. In: Alba E (ed) Parallel metaheuristics: a new class of metaheuristics. Wiley, Hoboken, pp 171\u2013201","DOI":"10.1002\/0471739383.ch8"},{"key":"40_CR93","doi-asserted-by":"crossref","unstructured":"Jin J, Crainic TG, L\u00f8kketangen A (2012) A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. Eur J Oper Res 222(3):441\u2013451","DOI":"10.1016\/j.ejor.2012.05.025"},{"key":"40_CR94","doi-asserted-by":"crossref","unstructured":"Jin J, Crainic TG, L\u00f8kketangen A (2014) A cooperative parallel metaheuristic for the capacitated vehicle routing problems. Comput Oper Res 44:33\u201341","DOI":"10.1016\/j.cor.2013.10.004"},{"key":"40_CR95","unstructured":"Lagani\u00e8re R, Mitiche A (1995) Parallel tabu search for robust image filtering. In: Proceedings of IEEE workshop on nonlinear signal and image processing (NSIP\u201995), Neos Marmaras, vol 2, pp 603\u2013605"},{"key":"40_CR96","doi-asserted-by":"crossref","unstructured":"Lahrichi N, Crainic TG, Gendreau M, Rei W, Crisan CC, Vidal T (2015) An integrative cooperative search framework for multi-decision-attribute combinatorial optimization. Eur J Oper Res 246(2):400\u2013412","DOI":"10.1016\/j.ejor.2015.05.007"},{"key":"40_CR97","doi-asserted-by":"crossref","unstructured":"Laursen PS (1996) Parallel heuristic search \u2013 introductions and a new approach. In: Ferreira A, Pardalos P (eds) Solving combinatorial optimization problems in parallel. Lecture notes in computer science, vol 1054. Springer, Berlin, pp 248\u2013274","DOI":"10.1007\/BFb0027125"},{"key":"40_CR98","unstructured":"Le Bouthillier A (2007) Recherches coop\u00e9ratives pour la r\u00e9solution de probl\u00e8mes d\u2019optimisation combinatoire. PhD thesis, D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al"},{"key":"40_CR99","doi-asserted-by":"crossref","unstructured":"Le Bouthillier A, Crainic TG (2005) A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput Oper Res 32(7):1685\u20131708","DOI":"10.1016\/j.cor.2003.11.023"},{"key":"40_CR100","doi-asserted-by":"crossref","unstructured":"Le Bouthillier A, Crainic TG, Kropf P (2005) A guided cooperative search for the vehicle routing problem with time windows. IEEE Intell Syst 20(4):36\u201342","DOI":"10.1109\/MIS.2005.58"},{"key":"40_CR101","unstructured":"Lee KG, Lee SY (1992) Efficient parallelization of simulated annealing using multiple Markov chains: an application to graph partitioning. In: Mudge TN (ed) Proceedings of the international conference on parallel processing. Algorithms and applications, vol III. CRC Press, Boca Raton, pp 177\u2013180"},{"key":"40_CR102","unstructured":"Lee SY, Lee KG (1992) Asynchronous communication of multiple Markov chains in parallel simulated annealing. In: Mudge TN (ed) Proceedings of the international conference on parallel processing. Algorithms and applications, vol III. CRC Press, Boca Raton, pp 169\u2013176"},{"key":"40_CR103","unstructured":"Lee KG, Lee SY (1995) Synchronous and asynchronous parallel simulated annealing with multiple Markov chains. In: Brandenburg F (ed) Graph drawing \u2013 proceedings GD \u201995, symposium on graph drawing, Passau. Lecture notes in computer science, vol 1027. Springer, Berlin, pp 396\u2013408"},{"key":"40_CR104","unstructured":"Lee SY, Lee KG (1996) Synchronous and asynchronous parallel simulated annealing with multiple Markov chains. IEEE Trans Parallel Distrib Syst 7(10):993\u20131007"},{"key":"40_CR105","doi-asserted-by":"crossref","unstructured":"Li Y, Pardalos PM, Resende MGC (1994) 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. American Mathematical Society, pp 237\u2013261","DOI":"10.1090\/dimacs\/016\/12"},{"key":"40_CR106","doi-asserted-by":"crossref","unstructured":"Li F, Golden B L, Wasil EA (2005) A very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32(5):1165\u20131179","DOI":"10.1016\/j.cor.2003.10.002"},{"key":"40_CR107","unstructured":"Lin SC, Punch WF, Goodman ED (1994) Coarse-grain parallel genetic algorithms: categorization and new approach. In: Sixth IEEE symposium on parallel and distributed processing. IEEE Computer Society Press, Los Alamitos, pp 28\u201337"},{"key":"40_CR108","doi-asserted-by":"crossref","unstructured":"Luque G, Alba E, Dorronsoro B (2005) Parallel genetic algorithms. In: Alba E (ed) Parralel metaheuristics: a new class of algorithms. Wiley, Hoboken, pp 107\u2013125","DOI":"10.1002\/0471739383.ch5"},{"key":"40_CR109","doi-asserted-by":"crossref","unstructured":"Malek M, Guruswamy M, Pandya M, Owens H (1989) Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann Oper Res 21:59\u201384","DOI":"10.1007\/BF02022093"},{"key":"40_CR110","doi-asserted-by":"crossref","unstructured":"Martins SL, Ribeiro CC, Souza MC (1998) A parallel GRASP for the Steiner problem in graphs. In: Ferreira A, Rolim J (eds) Proceedings of IRREGULAR\u201998 \u2013 5th international symposium on solving irregularly structured problems in parallel. Lecture notes in computer science, vol 1457. Springer, Berlin\/New York, pp 285\u2013297","DOI":"10.1007\/BFb0018547"},{"key":"40_CR111","doi-asserted-by":"crossref","unstructured":"Martins SL, Resende MGC, Ribeiro CC, Parlados PM (2000) A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy. J Glob Optim 17:267\u2013283","DOI":"10.1023\/A:1026546708757"},{"key":"40_CR112","unstructured":"Michels R, Middendorf M (1999) An ant system for the shortest common supersequence problem. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, London, pp 51\u201361"},{"key":"40_CR113","doi-asserted-by":"crossref","unstructured":"Middendorf M, Reischle F, Schmeck H (2002) Multi colony ant algorithms. J Heuristics 8(3):305\u2013320. doihttp:\/\/dx.doi.org\/10.1023\/A:1015057701750","DOI":"10.1023\/A:1015057701750"},{"key":"40_CR114","doi-asserted-by":"crossref","unstructured":"Miki M, Hiroyasu T, Wako J, Yoshida T (2003) Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing. In: CEC\u201903 \u2013 the 2003 congress on evolutionary computation, Canberra, vol 1, pp 459\u2013466","DOI":"10.1109\/CEC.2003.1299611"},{"key":"40_CR115","doi-asserted-by":"crossref","unstructured":"Mingozzi A (2005) The multi-depot periodic vehicle routing problem. In: Abstraction, reformulation and approximation. Lecture notes in computer science. Springer, Berlin\/Heidelberg, pp 347\u2013350","DOI":"10.1007\/11527862_27"},{"key":"40_CR116","doi-asserted-by":"crossref","unstructured":"Moreno-P\u00e9rez JA, Hansen P, Mladenovi\u0107 N (2005) Parallel variable neighborhood search. In: Alba E (ed) Parallel metaheuristics: a new class of metaheuristics. Wiley, Hoboken, pp 247\u2013266","DOI":"10.1002\/0471739383.ch11"},{"key":"40_CR117","unstructured":"M\u00fchlenbein H (1989) Parallel genetic algorithms, population genetics and combinatorial optimization. In: Schaffer J (ed) Proceedings of the third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 416\u2013421"},{"key":"40_CR118","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein H (1991) Parallel genetic algorithms, population genetics, and combinatorial optimization. In: Becker JD, Eisele I, M\u00fcndemann FW (eds) Parallelism, learning, evolution. Workshop on evolutionary models and strategies \u2013 WOPPLOT 89. Springer, Berlin, pp 398\u2013406","DOI":"10.1007\/3-540-55027-5_23"},{"key":"40_CR119","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein H (1992) Parallel genetic algorithms in combinatorial optimization. In: Balci O, Sharda R, Zenios S (eds) Computer science and operations research: new developments in their interface. Pergamon Press, New York, pp 441\u2013456","DOI":"10.1016\/B978-0-08-040806-4.50034-4"},{"key":"40_CR120","doi-asserted-by":"crossref","unstructured":"Niar S, Fr\u00e9ville A (1997) A parallel tabu search algorithm for the 0\u20131 multidimensional knapsack problem. In: 11th international parallel processing symposium (IPPS \u201997), Geneva. IEEE, pp 512\u2013516","DOI":"10.1109\/IPPS.1997.580948"},{"key":"40_CR121","doi-asserted-by":"crossref","unstructured":"Oduntan I, Toulouse M, Baumgartner R, Bowman C, Somorjai R, Crainic TG (2008) A multilevel tabu search algorithm for the feature selection problem in biomedical data sets. Comput Math Appl 55(5):1019\u20131033","DOI":"10.1016\/j.camwa.2006.12.098"},{"key":"40_CR122","unstructured":"Ouyang M, Toulouse M, Thulasiraman K, Glover F, Deogun JS (2000) Multi-level cooperative search: application to the netlist\/hypergraph partitioning problem. In: Proceedings of international symposium on physical design. ACM, New York, pp 192\u2013198"},{"key":"40_CR123","doi-asserted-by":"crossref","unstructured":"Ouyang M, Toulouse M, Thulasiraman K, Glover F, Deogun JS (2002) Multilevel cooperative search for the circuit\/hypergraph partitioning problem. IEEE Trans Comput-Aided Des 21(6):685\u2013693","DOI":"10.1109\/TCAD.2002.1004312"},{"key":"40_CR124","doi-asserted-by":"crossref","unstructured":"Pardalos PM, Li Y, KA M (1992) Computational experience with parallel algorithms for solving the quadratic assignment problem. In: Balci O, Sharda R, Zenios S (eds) Computer science and operations research: new developments in their interface. Pergamon Press, New York, pp 267\u2013278","DOI":"10.1016\/B978-0-08-040806-4.50023-X"},{"key":"40_CR125","doi-asserted-by":"crossref","unstructured":"Pardalos PM, Pitsoulis L, Mavridou T, Resende MGC (1995) 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. Springer, Berlin, pp 317\u2013331","DOI":"10.1007\/3-540-60321-2_26"},{"key":"40_CR126","doi-asserted-by":"crossref","unstructured":"Pardalos PM, Pitsoulis L, Resende MGC (1995) A parallel GRASP implementation for the quadratic assignment problem. In: Ferreira A, Rolim J (eds) Solving irregular problems in parallel: state of the art. Kluwer Academic, Norwell, pp 115\u2013130","DOI":"10.1007\/978-1-4757-6130-6_6"},{"key":"40_CR127","doi-asserted-by":"crossref","unstructured":"Polacek M, Benkner S, Doerner KF, Hartl RF (2008) A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Bus Res 1(2):1\u201312","DOI":"10.1007\/BF03343534"},{"key":"40_CR128","doi-asserted-by":"crossref","unstructured":"Porto SCS, Ribeiro CC (1995) A tabu search approach to task scheduling on heteregenous processors under precedence constraints. Int J High-Speed Comput 7:45\u201371","DOI":"10.1142\/S012905339500004X"},{"key":"40_CR129","unstructured":"Porto SCS, Ribeiro CC (1996) Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. J Heuristics 1(2):207\u2013223"},{"key":"40_CR130","doi-asserted-by":"crossref","unstructured":"Porto SCS, Kitajima JPFW, Ribeiro CC (2000) Performance evaluation of a parallel tabu search task scheduling algorithm. Parallel Comput 26:73\u201390","DOI":"10.1016\/S0167-8191(99)00096-4"},{"key":"40_CR131","doi-asserted-by":"crossref","unstructured":"Rahimi Vahed A, Crainic TG, Gendreau M, Rei W (2013) A path relinking algorithm for a multi-depot periodic vehicle routing problem. J Heuristics 19(3):497\u2013524","DOI":"10.1007\/s10732-013-9221-2"},{"key":"40_CR132","doi-asserted-by":"crossref","unstructured":"Rahoual M, Hadji R, Bachelet V (2002) Parallel ant system for the set covering problem. In: Dorigo M, Di Caro G, Sampels M (eds) Ant algorithms \u2013 proceedings of the third international workshop, ANTS 2002. Lecture notes in computer science, vol 2463. Springer, Berlin, pp 262\u2013267","DOI":"10.1007\/3-540-45724-0_25"},{"key":"40_CR133","doi-asserted-by":"crossref","unstructured":"Ram DJ, Sreenivas TH, Subramaniam KG (1996) Parallel simulated annealing algorithms. J Parallel Distrib Comput 37:207\u2013212","DOI":"10.1006\/jpdc.1996.0121"},{"key":"40_CR134","doi-asserted-by":"crossref","unstructured":"Randall M, Lewis A (2002) A parallel implementation of ant colony optimisation. J Parallel Distrib Comput 62:1421\u20131432","DOI":"10.1006\/jpdc.2002.1854"},{"key":"40_CR135","doi-asserted-by":"crossref","unstructured":"Rego C (2001) Node ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput 27:201\u2013222","DOI":"10.1016\/S0167-8191(00)00102-2"},{"key":"40_CR136","unstructured":"Rego C, Roucairol C (1996) A parallel tabu search algorithm using ejection chains for the VRP. In: Osman I, Kelly J (eds) Meta-heuristics: theory & applications. Kluwer Academic, Norwell, pp 253\u2013295"},{"key":"40_CR137","unstructured":"Reimann M, Stummer M, Doerner K (2002) A savings based ants system for the vehicle routing problem. In: Langton C, Cant\u00fa-Paz E, Mathias KE, Roy R, Davis L, Poli R, Balakrishnan K, Honavar V, Rudolph G, Wegener J, Bull L, Potter MA, Schultz AC, Miller JF, Burke EK, Jonoska N (eds) GECCO 2002: proceedings of the genetic and evolutionary computation conference, New York, 9\u201313 July 2002. Morgan Kaufmann, San Francisco, pp 1317\u20131326"},{"key":"40_CR138","doi-asserted-by":"crossref","unstructured":"Reimann M, Doerner K, Hartl R (2004) D-ants: savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31(4):563\u2013591","DOI":"10.1016\/S0305-0548(03)00014-5"},{"key":"40_CR139","doi-asserted-by":"crossref","unstructured":"Ribeiro CC, Rosseti I (2002) A parallel GRASP heuristic for the 2-path network design problem. 4 journ\u00e9e ROADEF, Paris, 20\u201322 Feb","DOI":"10.1007\/3-540-45706-2_131"},{"key":"40_CR140","doi-asserted-by":"crossref","unstructured":"Ribeiro CC, Rosseti I (2002) A parallel GRASP heuristic for the 2-path network design problem. Third meeting of the PAREO Euro working group, Guadeloupe, May","DOI":"10.1007\/3-540-45706-2_131"},{"key":"40_CR141","doi-asserted-by":"crossref","unstructured":"Ribeiro CC, Rosseti I (2002) Parallel grasp with path-relinking heuristic for the 2-path network design problem. In: AIRO\u20192002, L\u2019Aquila, Sept","DOI":"10.1007\/3-540-45706-2_131"},{"issue":"1","key":"40_CR142","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard ED (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147\u2013167","journal-title":"J Heuristics"},{"key":"40_CR143","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-46016-0_10","volume-title":"MICAI 2002: advances in artificial intelligence","author":"H Sanvicente-S\u00e1nchez","year":"2002","unstructured":"Sanvicente-S\u00e1nchez H, Frausto-Sol\u00eds J (2002) MPSA: a methodology to parallelize simulated annealing and its application to the traveling salesman problem. In: Coello Coello C, de Albornoz A, Sucar L, Battistutti O (eds) MICAI 2002: advances in artificial intelligence. Lecture notes in computer science, vol 2313. Springer, Heidelberg, pp 89\u201397"},{"key":"40_CR144","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-58484-6_264","volume-title":"Parallel problem solving from nature III","author":"D Schlierkamp-Voosen","year":"1994","unstructured":"Schlierkamp-Voosen D, M\u00fchlenbein H (1994) Strategy adaptation by competing subpopulations. In: Davidor Y, Schwefel H-P, M\u00e4nner R (eds) Parallel problem solving from nature III. Lecture notes in computer science, vol 866. Springer, Berlin, pp 199\u2013208"},{"key":"40_CR145","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1023\/A:1018948011707","volume":"86","author":"J Schulze","year":"1999","unstructured":"Schulze J, Fahle T (1999) A parallel algorithm for the vehicle routing problem with time window constraints. Ann Oper Res 86:585\u2013607","journal-title":"Ann Oper Res"},{"issue":"2","key":"40_CR146","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/imaman\/dpm009","volume":"18","author":"M Sevkli","year":"2007","unstructured":"Sevkli M, Aydin ME (2007) Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA J Manag Math 18(2):117\u2013133","journal-title":"IMA J Manag Math"},{"key":"40_CR147","first-page":"199","volume-title":"Proceedings of the fifth international conference on genetic algorithms","author":"R Shonkwiler","year":"1993","unstructured":"Shonkwiler R (1993) Parallel genetic algorithms. In: Forrest S (ed) Proceedings of the fifth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 199\u2013205"},{"issue":"9","key":"40_CR148","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1016\/S0305-0548(01)00026-0","volume":"29","author":"M Solar","year":"2002","unstructured":"Solar M, Parada V, Urrutia R (2002) A parallel genetic algorithm to solve the set-covering problem. Comput Oper Res 29(9):1221\u20131235","journal-title":"Comput Oper Res"},{"key":"40_CR149","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/BFb0056914","volume-title":"Proceedings of parallel problem solving from nature V","author":"T Stutzle","year":"1998","unstructured":"Stutzle T (1998) Parallelization strategies for ant colony optimization. In: Eiben AE, Back T, Schoenauer M, Schwefel H-P (eds) Proceedings of parallel problem solving from nature V. Lecture notes in computer science, vol 1498. Springer, Heidelberg, pp 722\u2013731"},{"key":"40_CR150","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9D Taillard","year":"1991","unstructured":"Taillard \u00c9D (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17:443\u2013455","journal-title":"Parallel Comput"},{"key":"40_CR151","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9D Taillard","year":"1993","unstructured":"Taillard \u00c9D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661\u2013673","journal-title":"Networks"},{"issue":"2","key":"40_CR152","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"\u00c9D Taillard","year":"1994","unstructured":"Taillard \u00c9D (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6(2):108\u2013117","journal-title":"ORSA J Comput"},{"key":"40_CR153","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"\u00c9D Taillard","year":"1997","unstructured":"Taillard \u00c9D, Gambardella LM, Gendreau M, Potvin JY (1997) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135:1\u201310","journal-title":"Eur J Oper Res"},{"key":"40_CR154","first-page":"117","volume":"10","author":"\u00c9D Taillard","year":"1998","unstructured":"Taillard \u00c9D, Gambardella LM, Gendreau M, Potvin JY (1998) Programmation \u00e0 m\u00e9moire adaptative. Calculateurs Parall\u00e8les, R\u00e9seaux et Syst\u00e8mes r\u00e9partis 10:117\u2013140","journal-title":"Calculateurs Parall\u00e8les, R\u00e9seaux et Syst\u00e8mes r\u00e9partis"},{"volume-title":"Parallel combinatorial optimization","year":"2006","key":"40_CR155","unstructured":"Talbi EG (ed) (2006) Parallel combinatorial optimization. Wiley, Hoboken"},{"key":"40_CR156","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1016\/S0167-8191(98)00086-6","volume":"24","author":"EG Talbi","year":"1998","unstructured":"Talbi EG, Hafidi Z, Geib JM (1998) Parallel adaptive tabu search approach. Parallel Comput 24:2003\u20132019","journal-title":"Parallel Comput"},{"key":"40_CR157","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BFb0097905","volume-title":"11th IPPS\/SPDP\u201999 workshops held in conjunction with the 13th international parallel processing symposium and 10th symposium on parallel and distributed processing, San Juan, 12\u201316 Apr","author":"EG Talbi","year":"1999","unstructured":"Talbi EG, Roux O, Fonlupt C, Robillard D (1999) Parallel ant colonies for combinatorial optimization problems. In: Rolim J et al (ed) 11th IPPS\/SPDP\u201999 workshops held in conjunction with the 13th international parallel processing symposium and 10th symposium on parallel and distributed processing, San Juan, 12\u201316 Apr. Lecture notes in computer science, vol 1586. Springer, Berlin, pp 239\u2013247"},{"key":"40_CR158","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1009669824615","volume":"4","author":"S Talukdar","year":"1998","unstructured":"Talukdar S, Baerentzen L, Gove A, de Souza P (1998) Asynchronous teams: cooperation schemes for autonomous agents. J Heuristics 4:295\u2013321","journal-title":"J Heuristics"},{"key":"40_CR159","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/0-306-48056-5_19","volume-title":"Handbook in metaheuristics","author":"S Talukdar","year":"2003","unstructured":"Talukdar S, Murthy S, Akkiraju R (2003) Assynchronous teams. In: Glover F, Kochenberger G (eds) Handbook in metaheuristics. Kluwer Academic, Norwell, pp 537\u2013556"},{"key":"40_CR160","first-page":"359","volume-title":"Meta-heuristics 98: theory & applications","author":"HMM Eikelder ten","year":"1999","unstructured":"ten Eikelder HMM, Aarts BJL, Verhoeven MGA, Aarts EHL (1999) Sequential and parallel local search for job shop scheduling. In: Vo\u00df S, Martello S, Roucairol C, Osman IH (eds) Meta-heuristics 98: theory & applications. Kluwer Academic, Norwell, pp 359\u2013371"},{"key":"40_CR161","unstructured":"Tongcheng G, Chundi M (2002) 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, Shanghai, vol 3, pp 1840\u20131843"},{"key":"40_CR162","first-page":"501","volume-title":"Meta-heuristics: theory & applications","author":"M Toulouse","year":"1996","unstructured":"Toulouse M, Crainic TG, Gendreau M (1996) Communication issues in designing cooperative multi thread parallel searches. In: Osman IH, Kelly JP (eds) Meta-heuristics: theory & applications. Kluwer Academic, Norwell, pp 501\u2013522"},{"key":"40_CR163","first-page":"2379","volume-title":"Proceedings of the 1998 IEEE international conference on systems, man, and cybernetics","author":"M Toulouse","year":"1998","unstructured":"Toulouse M, Crainic TG, Sans\u00f3 B, Thulasiraman K (1998) Self-organization in cooperative search algorithms. In: Proceedings of the 1998 IEEE international conference on systems, man, and cybernetics. Omnipress, Madisson, pp 2379\u20132385"},{"key":"40_CR164","first-page":"373","volume-title":"Meta-heuristics 98: theory & applications","author":"M Toulouse","year":"1999","unstructured":"Toulouse M, Crainic TG, Sans\u00f3 B (1999) An experimental study of systemic behavior of cooperative search algorithms. In: Vo\u00df S, Martello S, Roucairol C, Osman IH (eds) Meta-heuristics 98: theory & applications. Kluwer Academic, Norwell, pp 373\u2013392"},{"key":"40_CR165","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-48311-X_75","volume-title":"5th international Euro-par parallel processing conference","author":"M Toulouse","year":"1999","unstructured":"Toulouse M, Thulasiraman K, Glover F (1999) Multi-level cooperative search: a new paradigm for combinatorial optimization and an application to graph partitioning. In: Amestoy P, Berger P, Dayd\u00e9 M, Duff I, Frayss\u00e9 V, Giraud L, Ruiz D (eds) 5th international Euro-par parallel processing conference. Lecture notes in computer science, vol 1685. Springer, Heidelberg, pp 533\u2013542"},{"issue":"1","key":"40_CR166","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-8191(99)00097-6","volume":"26","author":"M Toulouse","year":"2000","unstructured":"Toulouse M, Crainic TG, Thulasiraman K (2000) Global optimization properties of parallel cooperative search algorithms: a simulation study. Parallel Comput 26(1):91\u2013112","journal-title":"Parallel Comput"},{"issue":"1","key":"40_CR167","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.parco.2002.07.001","volume":"30","author":"M Toulouse","year":"2004","unstructured":"Toulouse M, Crainic TG, Sans\u00f3 B (2004) Systemic behavior of cooperative search algorithms. Parallel Comput 30(1):57\u201379","journal-title":"Parallel Comput"},{"issue":"1","key":"40_CR168","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"MGA Verhoeven","year":"1995","unstructured":"Verhoeven MGA, Aarts EHL (1995) Parallel local search. J Heuristics 1(1):43\u201365","journal-title":"J Heuristics"},{"issue":"3","key":"40_CR169","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"},{"key":"40_CR170","first-page":"333","volume-title":"Network optimization problems","author":"S Vo\u00df","year":"1993","unstructured":"Vo\u00df S (1993) Tabu search: applications and prospects. In: Du DZ, Pardalos P (eds) Network optimization problems. World Scientific, Singapore, pp 333\u2013353"},{"key":"40_CR171","first-page":"23","volume-title":"Proceedings of the 1998 ACM symposium on applied computing","author":"R Wilkerson","year":"1998","unstructured":"Wilkerson R, Nemer-Preece N (1998) Parallel genetic algorithm to solve the satisfiability problem. In: Proceedings of the 1998 ACM symposium on applied computing. ACM, New York, pp 23\u201328"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T03:22:22Z","timestamp":1571714542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":171,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_40","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}