{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:44:18Z","timestamp":1769316258611,"version":"3.49.0"},"reference-count":134,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1016540724870","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T03:32:49Z","timestamp":1041132769000},"page":"541-564","source":"Crossref","is-referenced-by-count":664,"title":["A Taxonomy of Hybrid Metaheuristics"],"prefix":"10.1007","volume":"8","author":[{"given":"E.-G.","family":"Talbi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5091610_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0167-9260(86)90002-7","volume":"4","author":"E.H.L. Aarts","year":"1986","unstructured":"Aarts, E.H.L., F.M.I. De Bont, J.H.A. Habers, and P.J.M. Van Laarhoven. (1986). \u201cParallel Implementations of the Statistical Cooling Algorithms.\u201d Integration 4, 209\u2013238.","journal-title":"Integration"},{"key":"5091610_CR2","doi-asserted-by":"crossref","unstructured":"Abbattista, F., N. Abbattista, and L. Caponetti. (1995). \u201cAn Evolutionary and Cooperative Agent Model for Optimization.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 668\u2013671.","DOI":"10.1109\/ICEC.1995.487464"},{"key":"5091610_CR3","unstructured":"Abramson, D., P. Logothetis, A. Postula, and M. Randall. (1997). \u201cApplication Specific Computers for Combinatorial Optimisation.\u201d In The Australien Computer Architecture Workshop, Sydney, Australia."},{"key":"5091610_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/2.144393","volume":"25","author":"D.A. Abramson","year":"1992","unstructured":"Abramson, D.A. (1992). \u201cA Very High Speed Architecture to Support Simulated Annealing.\u201d IEEE Computer 25, 27\u201334.","journal-title":"IEEE Computer"},{"key":"5091610_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A Connectionist Machine for Genetic Hillclimbing","author":"D.H. Ackley","year":"1987","unstructured":"Ackley, D.H. (1987). A Connectionist Machine for Genetic Hillclimbing. Boston, USA: Kluwer Academic Pub."},{"key":"5091610_CR6","doi-asserted-by":"crossref","unstructured":"Adamidis, P. and V. Petridis. (1996). \u201cCo-Operating Populations with Different Evolution Behaviours.\u201d In IEEE Int. Conf. on Evolutionary Computation, ICEC'96, Nagoya, Japan, pp. 188\u2013191.","DOI":"10.1109\/ICEC.1996.542358"},{"key":"5091610_CR7","first-page":"1","volume":"50","author":"A.A. Andreatta","year":"1994","unstructured":"Andreatta, A.A. and C.C. Ribeiro. (1994). \u201cA Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinatorial Circuits.\u201d Operations Research 50, 1\u201336.","journal-title":"Operations Research"},{"key":"5091610_CR8","doi-asserted-by":"crossref","unstructured":"Areibi, S. and A. Vannelli. (1994). \u201cAdvanced Search Techniques for Circuit Partitioning.\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 77\u201397.","DOI":"10.1090\/dimacs\/016\/03"},{"key":"5091610_CR9","series-title":"LNCS","first-page":"290","volume-title":"Parallel Problem Solving from Nature PPSN4","author":"T. Asveren","year":"1996","unstructured":"Asveren, T. and P. Molitor. (1996). \u201cNew Crossover Methods for Sequencing Problems.\u201d In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schewefel (eds.), Parallel Problem Solving from Nature PPSN4, Vol. 1141 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 290\u2013299."},{"key":"5091610_CR10","unstructured":"Bachelet, V., Z. Hafidi, P. Preux, and E.-G. Talbi. (1998). \u201cDiversifying Tabu Search by Genetic Algorithms.\u201d In INFORMS'98 on Operations Research and Management Sciences Meeting, Montr\u00e9al, Canada."},{"key":"5091610_CR11","unstructured":"Bachelet, V., P. Preux, and E.-G. Talbi. (1996). \u201cParallel Hybrid Meta-heuristics: Application to the Quadratic Assignment Problem.\u201d In Parallel Optimization Colloquium POC96, Versailles, France, pp. 233\u2013242."},{"key":"5091610_CR12","volume-title":"RR CRT-95-84","author":"P. Badeau","year":"1995","unstructured":"Badeau, P., M. Gendreau, F. Guertin, J.-Y. Potvin, and E. Taillard. (1995). \u201cA Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows.\u201d RR CRT-95-84, Centre de Recherche sur les Transports, Universit\u00e8 de Montr\u00e9al, Canada."},{"issue":"2","key":"5091610_CR13","first-page":"109","volume":"5","author":"P. Badeau","year":"1997","unstructured":"Badeau, P., F. Guertin, M. Gendreau, J.-Y. Potvin, and E.D. Taillard. (1997). \u201cA Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows.\u201d Transportation Research 5(2), 109\u2013122.","journal-title":"Transportation Research"},{"key":"5091610_CR14","first-page":"34","volume-title":"IEEE Int. Conf. on Computer-Aided Design","author":"P. Banerjee","year":"1986","unstructured":"Banerjee, P. and M. Jones. (1986). \u201cA Parallel Simulated Annealing Algorithm for Standard Cell Placement on a Hypercube Computer.\u201d In IEEE Int. Conf. on Computer-Aided Design, Santa Clara, California, USA, pp. 34\u201337."},{"key":"5091610_CR15","volume-title":"Connectionist Models Summer School","author":"S. Becker","year":"1988","unstructured":"Becker, S. and Y. Le Cun. (1988). \u201cImproving the Convergence of Back-Propagation Learning with Second-Order Methods.\u201d In D. Touretzky, G. Hinton, and T. Sejnowski (eds.), Connectionist Models Summer School, Pittsburgh, USA, Morgan Kaufmann."},{"key":"5091610_CR16","volume-title":"Sixth Int. Conf. on Genetic Algorithms","author":"T. Belding","year":"1995","unstructured":"Belding, T. (1995). \u201cThe Distributed Genetic Algorithm Revisted.\u201d In D. Eshelmann (ed.), Sixth Int. Conf. on Genetic Algorithms. San Mateo, CA, Morgan Kaufmann."},{"key":"5091610_CR17","first-page":"511","volume-title":"Second Conf. on Artificial Life","author":"R.K. Belew","year":"1991","unstructured":"Belew, R.K., J. McInerny, and N.N. Schraudolph. (1991). \u201cEvolving Networks: Using Genetic Algorithms with Connectionist Learning.\u201d In C.G. Langton, C. Taylor, J.D. Doyne Farmer, and S. Rasmussen (eds.), Second Conf. on Artificial Life, Addison-Wesley, USA, pp. 511\u2013548."},{"key":"5091610_CR18","series-title":"Technical Report","volume-title":"\u201cParallel Genetic Algorithms on Distributed-Memory Architecturers,\u201d","author":"R. Bianchini","year":"1992","unstructured":"Bianchini, R. and C. Brown. (1992). \u201cParallel Genetic Algorithms on Distributed-Memory Architecturers,\u201d Technical Report 436, University of Rochester, Rochester, NY, USA."},{"issue":"2","key":"5091610_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"Boese, K.D., A.B. Kahng, and S. Muddu. (1994). \u201cNewAdaptive Multi-Start Techniques for Combinatorial Global Optimizations.\u201d Operation Research Letters 16(2), 101\u2013113.","journal-title":"Operation Research Letters"},{"key":"5091610_CR20","doi-asserted-by":"crossref","unstructured":"Bohnenberger, O., J. Hesser, and R. Manner. (1995). \u201cAutomatic Design of Truss Structures Using Evolutionary Algorithms\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 143\u2013147.","DOI":"10.1109\/ICEC.1995.489132"},{"key":"5091610_CR21","series-title":"LNCS","first-page":"129","volume-title":"Parallel Problem Solving from Nature","author":"H. Braun","year":"1990","unstructured":"Braun, H. (1990). \u201cOn Solving Traveling Salesman Problems by Genetic Algorithms.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature, Vol 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 129\u2013133."},{"key":"5091610_CR22","first-page":"406","volume-title":"A Parallel Genetic Heuristic for the Quadratic Assignment Problem","author":"D.E. Brown","year":"1989","unstructured":"Brown, D.E., C.L. Huntley, and A.R. Spillane. (1989). \u201cA Parallel Genetic Heuristic for the Quadratic Assignment Problem.\u201d In Third Int. Conf. on Genetic Algorithms ICGA'89, San Mateo, California, USA: Morgan Kauffmann, pp. 406\u2013415."},{"key":"5091610_CR23","doi-asserted-by":"crossref","unstructured":"Bruns, R. (1995). \u201cIntegration of Constraint Solving Techniques in Genetic Algorithms.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 33\u201338.","DOI":"10.1109\/ICEC.1995.489115"},{"key":"5091610_CR24","doi-asserted-by":"crossref","unstructured":"Bui, T.N. and B.R. Moon. (1994). \u201cA Genetic Algorithm for a Special Class of the Quadratic Assignment Problem.\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Special Issue on Quadratic Assignment and Related Problems 16, 99\u2013116.","DOI":"10.1090\/dimacs\/016\/04"},{"issue":"2","key":"5091610_CR25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1009625526657","volume":"5","author":"P. Cal\u00e9gari","year":"1999","unstructured":"Cal\u00e9gari, P., G. Coray, A. Hertz, D. Kobler, and P. Kuonen. (1999). \u201cA Taxonomy of Evolutionary Algorithms in Combinatorial Optimization.\u201d Journal of Heuristics 5(2), 145\u2013158.","journal-title":"Journal of Heuristics"},{"key":"5091610_CR26","unstructured":"Casotto, A., F. Romeo, and A.L. Sangiovanni-Vincentelli. (1986). \u201cA Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells.\u201d In IEEE Int. Conf. on Computer-Aided Design, Santa Clara, California, USA, pp. 30\u201333."},{"key":"5091610_CR27","doi-asserted-by":"crossref","unstructured":"Chak, C.K. and G. Feng. (1995). \u201cAccelerated Genetic Algorithms: Combined with Local Search Techniques for Fast and Accurate Global Search.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 378\u2013383.","DOI":"10.1109\/ICEC.1995.489177"},{"key":"5091610_CR28","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02022999","volume":"41","author":"J. Chakrapani","year":"1993","unstructured":"Chakrapani, J. and J. Skorin-Kapov. (1993). \u201cMassively Parallel Tabu Search for the Quadratic Assignment Problem.\u201d Annals of Operations Research 41, 327\u2013341.","journal-title":"Annals of Operations Research"},{"key":"5091610_CR29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I. Charon","year":"1993","unstructured":"Charon, I. and O. Hudry. (1993). \u201cThe Noising Method: A New Method for Combinatorial Optimization.\u201d Operations Research Letters 14, 133\u2013137.","journal-title":"Operations Research Letters"},{"key":"5091610_CR30","first-page":"428","volume-title":"Parallel Simulated Annealing and Genetic Algorithms: A Space of Hybrid Methods","author":"H. Chen","year":"1994","unstructured":"Chen, H. and N.S. Flann. (1994). \u201cParallel Simulated Annealing and Genetic Algorithms: A Space of Hybrid Methods.\u201d In Y. Davidor, H.-P. Schwefel, and R. Manner (eds.), Third Conf. on Parallel Problem Solving from Nature. Jerusalem, Israel, Berlin: Springer-Verlag, pp. 428\u2013436."},{"key":"5091610_CR31","volume-title":"A Genetic Algorithm Approach for Combinatorial Optimization Problems","author":"P.C. Chu","year":"1997","unstructured":"Chu, P.C. (1997). \u201cA Genetic Algorithm Approach for Combinatorial Optimization Problems.\u201d PhD Thesis, University of London, London, UK."},{"issue":"3","key":"5091610_CR32","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V. (1979). \u201cA Greedy Heuristic for the Set Covering Problem.\u201d Mathematics of Operations Research 4(3), 233\u2013235.","journal-title":"Mathematics of Operations Research"},{"key":"5091610_CR33","first-page":"148","volume-title":"Punctuated Equilibria: A Parallel Genetic Algorithm","author":"J. Cohoon","year":"1987","unstructured":"Cohoon, J., S. Hedge, W. Martin, and D. Richards. (1987). \u201cPunctuated Equilibria: A Parallel Genetic Algorithm\u201d In J.J. Grefenstette (ed.), Second Int. Conf. on Genetic Algorithms. Cambridge, MA, USA: MIT, pp. 148\u2013154."},{"issue":"4","key":"5091610_CR34","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/43.75631","volume":"10","author":"J. Cohoon","year":"1991","unstructured":"Cohoon, J., S. Hedge, W. Martin, and D. Richards. (1991). \u201cDistributed Genetic Algorithms for the Floorplan Design Problem.\u201d IEEE Trans. on Computer-Aided Design 10(4), 483\u2013492.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"5091610_CR35","series-title":"LNCS","first-page":"134","volume-title":"Parallel Problem Solving from Nature","author":"J.P. Cohoon","year":"1990","unstructured":"Cohoon, J.P., W.N. Martin, and D.S. Richards. (1990). \u201cGenetic Algorithms and Punctuated Equilibria.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 134\u2013141."},{"key":"5091610_CR36","first-page":"244","volume-title":"A Multi-Population Genetic Algorithm for Solving the k-Partition Problem on Hypercubes","author":"J.P. Cohoon","year":"1991","unstructured":"Cohoon, J.P., W.N. Martin, and D.S. Richards. (1991). \u201cA Multi-Population Genetic Algorithm for Solving the k-Partition Problem on Hypercubes.\u201d In R.K. Belew and L.B. Booker (eds.), Fourth Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, pp. 244\u2013248."},{"key":"5091610_CR37","unstructured":"Colorni, A., M. Dorigo, and V. Maniezzo. (1991). \u201cDistributed Optimization by Ant Colonies.\u201d In European Conf. on Artificial Life. Elsevier Publishing, pp. 134\u2013142."},{"key":"5091610_CR38","series-title":"Technical Report","volume-title":"Towards a Taxonomy of Parallel Tabu Search Algoithms","author":"T.D. Crainic","year":"1993","unstructured":"Crainic, T.D., M. Toulouse, and M. Gendreau. (1993). \u201cTowards a Taxonomy of Parallel Tabu Search Algoithms.\u201d Technical Report CRT-933, Centre de Recherche sur les Transports, Universit\u00e9 deMontr\u00e9al, Montr\u00e9al, Canada."},{"key":"5091610_CR39","series-title":"Technical Report","volume-title":"A Cooperative Parallel Tabu Search for Capacitated Network Design","author":"T.G. Crainic","year":"1997","unstructured":"Crainic, T.G., and M. Gendreau. (1997). \u201cA Cooperative Parallel Tabu Search for Capacitated Network Design,\u201d Technical Report CRT-97-27, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada."},{"key":"5091610_CR40","unstructured":"Crainic, T.G., A.T. Nguyen, and M. Gendreau. (1997). \u201cCooperative Multi-Thread Parallel Tabu Search with Evolutionary Adaptive Memory.\u201d In 2nd Int. Conf. on Metaheuristics, Sophia Antipolis, France."},{"key":"5091610_CR41","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01719254","volume":"17","author":"T.G. Crainic","year":"1995","unstructured":"Crainic, T.G., M. Toulouse, and M. Gendreau. (1995). \u201cSynchronous Tabu Search Parallelization Strategies for Multi-Commodity Location-Allocation with Balancing Requirements.\u201d OR Spektrum, 17, 113\u2013123.","journal-title":"OR Spektrum"},{"key":"5091610_CR42","unstructured":"Cung, V-D., T. Mautor, P. Michelon, and A. Tavares. (1997). \u201cA Scatter Search Based Approach for the Quadratic Assignment Problem.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'97, Indianapolis, USA."},{"key":"5091610_CR43","unstructured":"Cung, V.-D., T. Mautor, P. Michelon, and A. Tavares. (1999). \u201cRecherche Dispers\u00e9e Parall\u00e8le.\u201d In Deuxi\u00e8me Congr\u00e9s de la Soci\u00e8t\u00e9 Francaise de Recherche Op\u00e9ratinnelle et d'Aide \u00e0 la d\u00e9cision ROADEF'99, Autrans, France."},{"key":"5091610_CR44","unstructured":"Davis, L. (1985). \u201cJob-Shop Scheduling with Genetic Algorithms.\u201d In J.J. Grefenstette (ed.), Int. Conf. on Genetic Algorithms and their Applications, Pittsburgh, pp. 136\u2013140."},{"key":"5091610_CR45","doi-asserted-by":"crossref","unstructured":"Dozier, G., J. Bowen, and D. Bahler. (1995). \u201cSolving Randomly Generated Constraint Satisfaction Problems Using a Micro-Evolutionary Hybrid that Evolves a Population of Hill-Climbers.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 614\u2013619.","DOI":"10.1109\/ICEC.1995.487454"},{"key":"5091610_CR46","series-title":"LNCS","first-page":"574","volume-title":"Climbing up NP-Hard Hills","author":"D. Duvivier","year":"1996","unstructured":"Duvivier, D., P. Preux, and E.G. Talbi. (1996). \u201cClimbing up NP-Hard Hills.\u201d In The Fourth Int. Conf. on Parallel Problem Solving From Nature. Berlin, Germany: Springer-Verlag, LNCS No. 1141, pp. 574\u2013583."},{"key":"5091610_CR47","series-title":"LNCS","first-page":"408","volume-title":"Parallel Problem Solving from Nature PPSN4.","author":"I.R. East","year":"1996","unstructured":"East, I.R. and J. Rowe. (1996). \u201cEffects of Isolation in a Distributed Population Genetic Algorithm.\u201d In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schewefel (eds.), Parallel Problem Solving from Nature PPSN4. Vol. 1141 of LNCS, Dortmund, Germany: Springer-Verlag, pp. 408\u2013419."},{"key":"5091610_CR48","first-page":"38","volume-title":"Connectionist Models Summer School","author":"S.E. Fahlman","year":"1988","unstructured":"Fahlman, S.E. (1988). \u201cFaster-Learning Variations on Back-Propagation: An Empirical Study.\u201d In D. Touretzky, G. Hinton, and T. Sejnowsk (eds.), Connectionist Models Summer School, Pittsburgh, PA, USA, San Mateo, CA: Morgan Kaufmann, pp. 38\u201351."},{"key":"5091610_CR49","unstructured":"De Falco, I., R. Del Balio, and E. Tarantino. (1994). \u201cSolving the Mapping Problem by Parallel Tabu Search.\u201d In IASTED Conf., Paris, France."},{"key":"5091610_CR50","first-page":"59","volume":"3","author":"I. De Falco","year":"1995","unstructured":"De Falco, I., R. Del Balio, and E. Tarantino. (1995). \u201cAn Analysis of Parallel Heuristics for Task Allocation in Multicomputers.\u201d Computing 3, 59.","journal-title":"Computing"},{"key":"5091610_CR51","doi-asserted-by":"crossref","unstructured":"De Falco, I., R. Del Balio, E. Tarantino, and R. Vaccaro. (1994). \u201cImproving Search by Incorporating Evolution Principles in Parallel Tabu Search.\u201d In Int. Conf. on Machine Learning, pp. 823\u2013828.","DOI":"10.1109\/ICEC.1994.349949"},{"key":"5091610_CR52","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A. and M.G.C. Resende. (1995). \u201cGreedy Randomized Adaptive Search Procedures.\u201d Journal of Global Optimization 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"5091610_CR53","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., M.G.C. Resende, and S.H. Smith. (1994). \u201cA Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.\u201d Operations Research 42, 860\u2013878.","journal-title":"Operations Research"},{"key":"5091610_CR54","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/0305-0548(91)90001-8","volume":"18","author":"T.A. Feo","year":"1991","unstructured":"Feo, T.A., K. Venkatraman, and J.F. Bard. (1991). \u201cA GRASP for a Difficult Single Machine Scheduling Problem.\u201d Computers and Operations Research 18, 635\u2013643.","journal-title":"Computers and Operations Research"},{"key":"5091610_CR55","doi-asserted-by":"crossref","unstructured":"Fiechter, C.-N. (1994). \u201cA parallel Tabu Search Algorithm for Large Travelling Salesman Problems.\u201d Discrete Applied Mathematics.","DOI":"10.1016\/0166-218X(92)00033-I"},{"key":"5091610_CR56","doi-asserted-by":"crossref","unstructured":"Fleurent, C. and J.A. Ferland. (1994a). \u201cGenetic Hybrids for the Quardratic Assignment Problem.\u201d DI-MACS Series in Discrete Mathematics and Theoretical Computer Science 16, 173\u2013188.","DOI":"10.1090\/dimacs\/016\/08"},{"key":"5091610_CR57","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1090\/dimacs\/026\/29","volume":"26","author":"C. Fleurent","year":"1994","unstructured":"Fleurent, C. and J.A. Ferland. (1994b). \u201cObject-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique, and Satisfiability.\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, 619\u2013652.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"5091610_CR58","doi-asserted-by":"crossref","unstructured":"Fleurant, C. and J.A. Ferland. (1996). \u201cGenetic and Hybrid Algorithms for Graph Coloring.\u201d Annals of Operations Research 63.","DOI":"10.1007\/BF02125407"},{"key":"5091610_CR59","volume-title":"An Approach of Combining Simulated Annealing and Genetic Algorithm","author":"S.-M. Foo","year":"1991","unstructured":"Foo, S.-M. (1991). \u201cAn Approach of Combining Simulated Annealing and Genetic Algorithm.\u201d Master's Thesis, University of Illinois, Urbana-Champaign."},{"key":"5091610_CR60","unstructured":"Fourman, M.P. (1985). \u201cCompaction of Symbolic Layout Using Genetic Algorithms.\u201d In J.J. Grefenstette (ed.), Int. Conf. on Genetic Algorithms and their Applications, Pittsburgh, pp. 141\u2013153."},{"key":"5091610_CR61","doi-asserted-by":"crossref","unstructured":"Freisleben, B. and P. Merz. (1996). \u201cA Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems.\u201d In IEEE Int. Conf. on Evolutionary Computation, ICEC'96, Nagoya, Japan, pp. 616\u2013621.","DOI":"10.1109\/ICEC.1996.542671"},{"key":"5091610_CR62","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F. (1977). \u201cHeuristics for Integer Programming using Surrogate Constraints.\u201d Decision Sciences 8, 156\u2013166.","journal-title":"Decision Sciences"},{"issue":"3","key":"5091610_CR63","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search-Part I.\u201d ORSA Journal of Computing 1(3), 190\u2013206.","journal-title":"ORSA Journal of Computing"},{"key":"5091610_CR64","first-page":"422","volume-title":"3rd Int. Conf. Genetic Algorithms","author":"M. Gorges-Schleuter","year":"1989","unstructured":"Gorges-Schleuter, M. (1989). \u201cAsparagos, an Asynchronous Parallel Genetic Optimization Strategy.\u201d In 3rd Int. Conf. Genetic Algorithms. Morgan Kaufmann, USA. pp. 422\u2013427."},{"key":"5091610_CR65","series-title":"Research Notes in Artificial Intelligence","first-page":"42","volume-title":"Genetic Algorithms and Simulated Annealing","author":"J.J. Grefenstette","year":"1987","unstructured":"Grefenstette, J.J., (1987). \u201cIncorporating Problem Specific Knowledge into Genetic Algorithms.\u201d In L. Davis (ed.), Genetic Algorithms and Simulated Annealing, Research Notes in Artificial Intelligence, San Mateo, CA, USA: Morgan Kaufmann, pp. 42\u201360."},{"key":"5091610_CR66","series-title":"LNCS","first-page":"292","volume-title":"Parallel Problem Solving from Nature","author":"P.J.B. Hancock","year":"1990","unstructured":"Hancock, P.J.B. and L.S. Smith. (1990). \u201cGannet: Genetic Design of a Neural Net for Face Recognition.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 292\u2013296."},{"key":"5091610_CR67","volume-title":"Adaptive Global Optimization with Local Search","author":"W.E. Hart","year":"1994","unstructured":"Hart, W.E. (1994). \u201cAdaptive Global Optimization with Local Search.\u201d PhD Thesis, University of California, San Diego."},{"key":"5091610_CR68","doi-asserted-by":"crossref","unstructured":"Heijligers, M.J.M. and J.A.G. Jess. (1995). \u201cHigh-Level Synthesis Scheduling and Allocation Using Genetic Algorithms Based on Conctructive Topological Scheduling Techniques.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 56\u201361.","DOI":"10.1109\/ICEC.1995.489119"},{"key":"5091610_CR69","unstructured":"Hentenryck, V.P. (1989). Constraint Satisfaction in Logic Programming. MIT Press."},{"key":"5091610_CR70","volume-title":"Adaptation in Natural and Artificial Systems.","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI, USA: Michigan Press University."},{"key":"5091610_CR71","series-title":"Technical Report","volume-title":"Parallel Genetic Algorithms with Local Search","author":"C.L. Huntley","year":"1991","unstructured":"Huntley, C.L. and D.E. Brown. (1991a). \u201cParallel Genetic Algorithms with Local Search.\u201d Technical Report IPC-TR-90-006, University of Virginia, Charlottesvile, VA, USA."},{"key":"5091610_CR72","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(91)90029-Q","volume":"18","author":"C.L. Huntley","year":"1991","unstructured":"Huntley, C.L. and D.E. Brown. (1991b). \u201cA Parallel Heuristic for Quadratic Assignment Problems.\u201d Computers and Operations Research 18, 275\u2013289.","journal-title":"Computers and Operations Research"},{"key":"5091610_CR73","series-title":"LNCS","first-page":"80","volume-title":"Parallel Problem Solving From Nature","author":"P. Husbands","year":"1990","unstructured":"Husbands, P., F. Mill, and S. Warrington. (1990). \u201cGenetic Algorithms, Production Plan Optimisation and Scheduling.\u201d In H.-P. Schewefel and R. Manner (eds.), Parallel Problem Solving From Nature, Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 80\u201384."},{"key":"5091610_CR74","series-title":"LNCS","first-page":"32","volume-title":"Parallel Problem Solving from Nature PPSN4","author":"H. Iba","year":"1996","unstructured":"Iba, H. (1996). \u201cEmergent Cooperation for Multiple Agents Using Genetic Programming.\u201d In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schewefel (eds.), Parallel Problem Solving from Nature PPSN4, Vol. 1141 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 32\u201341."},{"key":"5091610_CR75","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H. and T. Murata. (1996). \u201cMulti-Objective Genetic Local Search Algorithm.\u201d In IEEE Int. Conf. on Evolutionary Computation, ICEC'96, Nagoya, Japan, pp. 119\u2013124.","DOI":"10.1109\/ICEC.1996.542345"},{"key":"5091610_CR76","volume-title":"The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem","author":"P. Jog","year":"1989","unstructured":"Jog, P., J.Y. Suh, and D. Van Gucht. (1989). \u201cThe Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem.\u201d In 3rd Int. Conf. Genetic Algorithms, Morgan Kaufmann, USA."},{"key":"5091610_CR77","unstructured":"Kim, H., Y. Hayashi, and K. Nara. (1995). \u201cThe Performance of Hybridized Algorithm of Genetic Algorithm Simulated Annealing and Tabu Search for Thermal Unit Maintenance Scheduling.\u201d In 2nd IEEE Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 114\u2013119."},{"issue":"4598","key":"5091610_CR78","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., C.D. Gelatt, and M.P. Vecchi. (1983). \u201cOptimization by Simulated Annealing.\u201d Science 220(4598), 671\u2013680.","journal-title":"Science"},{"key":"5091610_CR79","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., and G. Toulouse. (1985). \u201cConfiguration Space Analysis of the Travelling Salesman Problem.\u201d J. Phys. 46(1277).","DOI":"10.1051\/jphys:019850046080127700"},{"key":"5091610_CR80","unstructured":"Koza, J. and D. Andre. (1995). \u201cParallel Genetic Programming on a Network of Transputers.\u201d Technical Report CS-TR-95-1542, Stanford University."},{"key":"5091610_CR81","volume-title":"Genetic Programming.","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R. (1992). Genetic Programming. Cambridge, USA: MIT Press."},{"issue":"10","key":"5091610_CR82","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1002\/(SICI)1097-024X(199710)27:10<1121::AID-SPE119>3.0.CO;2-J","volume":"27","author":"L.V. Kragelund","year":"1997","unstructured":"Kragelund, L.V. (1997). \u201cSolving a Timetabling Problem Using Hybrid Genetic Algorithms.\u201d Software Practice and Experience 27(10), 1121\u20131134.","journal-title":"Software Practice and Experience"},{"key":"5091610_CR83","series-title":"LNCS","first-page":"160","volume-title":"Parallel Problem Solving from Nature","author":"B. Kroger","year":"1990","unstructured":"Kroger, B., P. Schwenderling, and O. Vornberger. (1990). \u201cParallel Genetic Packing of Rectangles.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany. Springer-Verlag, pp. 160\u2013164."},{"key":"5091610_CR84","unstructured":"Kroger, B., P. Schwenderling, and O. Vornberger. (1991). \u201cGenetic Packing of Rectangles on Transputers.\u201d In P. Welch et al. (eds.), Transputing 91. IOS Press."},{"key":"5091610_CR85","volume-title":"M\u00e9thodes d'analyse d'algorithmes d'optimisation stochastiques \u00e0 l'aide d'algorithmes g\u00e9n\u00e9tiques","author":"M. Krueger","year":"1993","unstructured":"Krueger, M. (1993). \u201cM\u00e9thodes d'analyse d'algorithmes d'optimisation stochastiques \u00e0 l'aide d'algorithmes g\u00e9n\u00e9tiques.\u201d Ph.D. Thesis, Ecole Nationale Sup\u00e8rieure des T\u00e9l\u00e9communications, Paris, France."},{"key":"5091610_CR86","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L. (1976). Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, USA."},{"key":"5091610_CR87","unstructured":"Lee, K.-G. and S.-Y. Lee. (1992). \u201cEfficient Parallelization of Simulated Annealing Using Multiple Markov Chains: An Application to Graph Partitioning.\u201d In T.N. Mudge (ed.), Int. Conf. on Parallel Processing. CRC Press, pp. 177\u2013180."},{"key":"5091610_CR88","doi-asserted-by":"crossref","DOI":"10.2172\/10161119","volume-title":"AParallel Genetic Algorithm for the Set Partitioning Problem","author":"D. Levine","year":"1994","unstructured":"Levine, D. (1994). \u201cAParallel Genetic Algorithm for the Set Partitioning Problem.\u201d Ph.D. Thesis, Argonne National Laboratory, Illinois Institute of Technology, Argonne, USA."},{"key":"5091610_CR89","first-page":"90","volume-title":"Greedy Genetics","author":"G.E. Liepins","year":"1987","unstructured":"Liepins, G.E. and M.R. Hilliard. (1987). \u201cGreedy Genetics.\u201d In 2nd Int. Conf. on Genetic Algorithms: Genetic Algorithms and Their Applications, Hillsdale, NJ, USA, Lawrence Erlbaum, pp. 90\u201399."},{"key":"5091610_CR90","unstructured":"Lin, F.T., C.Y. Kao, and C.C. Hsu. (1991). \u201cIncorporating Genetic Algorithms into Simulated Annealing.\u201d Proc. of the Fourth Int. Symp. on AI. pp. 290\u2013297."},{"key":"5091610_CR91","series-title":"LNCS","first-page":"198","volume-title":"Parallel Problem Solving from Nature","author":"R. Lohmann","year":"1990","unstructured":"Lohmann, R. (1990). \u201cApplication of Evolution Strategy in Parallel Populations.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature.Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 198\u2013208."},{"key":"5091610_CR92","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","volume":"21","author":"S.W. Mahfoud","year":"1995","unstructured":"Mahfoud, S.W. and D.E. Goldberg. (1995). \u201cParallel Recombinative Simulated Annealing: A Genetic Algorithm.\u201d Parallel Computing 21, 1\u201328.","journal-title":"Parallel Computing"},{"key":"5091610_CR93","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M. Malek","year":"1989","unstructured":"Malek, M., M. Guruswamy, M. Pandya, and H. Owens. (1989). \u201cSerial and Parallel Simulated Annealing and Tabu Search Algorithms for the Traveling Salesman Problem.\u201d Annals of Operations Research 21, 59\u201384.","journal-title":"Annals of Operations Research"},{"key":"5091610_CR94","unstructured":"Mariano, C.E. and E. Morales. (1998). \u201cA Multiple Objective Ant-q Algorithm for the Design of Water Distribution Irrigation Networks.\u201d In First International Workshop on Ant Colony Optimization ANTS'98, Bruxelles, Belgique."},{"key":"5091610_CR95","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02601639","volume":"63","author":"O.C. Martin","year":"1996","unstructured":"Martin, O.C. and S.W. Otto. (1996). \u201cCombining Simulated Annealing with Local Search Heuristics.\u201d Annals of Operations Research 63, 57\u201375.","journal-title":"Annals of Operations Research"},{"key":"5091610_CR96","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(92)90028-2","volume":"11","author":"O.C. Martin","year":"1992","unstructured":"Martin, O.C., S.W. Otto, and E.W. Felten. (1992). \u201cLarge-Step Markoy Chains for the TSP: Incorporating Local Search Heuristics.\u201d Operation Research Letters 11, 219\u2013224.","journal-title":"Operation Research Letters"},{"key":"5091610_CR97","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. Muhlenbein","year":"1998","unstructured":"Muhlenbein, H., M. Georges-Schleuter, and M. Kramer. (1998). \u201cEvolution Algorithms in Combinatorial Optimization.\u201d Parallel Computing 7, 65\u201385.","journal-title":"Parallel Computing"},{"key":"5091610_CR98","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0167-8191(05)80052-3","volume":"17","author":"H. Muhlenbein","year":"1991","unstructured":"Muhlenbein, H., M. Schomisch, and J. Born. (1991). \u201cThe Parallel Genetic Algorithm as Function Optimizer.\u201d Parallel Computing 17, 619\u2013632.","journal-title":"Parallel Computing"},{"key":"5091610_CR99","volume-title":"Int. Parallel Processing Symposium","author":"S. Niar","year":"1997","unstructured":"Niar, S. and A. Freville. (1997). \u201cA Parallel Tabu Search Algorithm for the 0-1 Multidimensional Knapsack Problem.\u201d In Int. Parallel Processing Symposium, Geneva, Switzerland. IEEE Society."},{"issue":"1","key":"5091610_CR100","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/72.265961","volume":"5","author":"V. Nissen","year":"1994","unstructured":"Nissen, V. (1994). \u201cSolving the Quadratic Assignment problem with Clues from Nature.\u201d IEEE Transactions on Neural Networks 5(1), 66\u201372.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"5091610_CR101","doi-asserted-by":"crossref","unstructured":"O'Reilly, U.-M. and F. Oppacher. (1995). \u201cHybridized Crossover-Based Techniques for Program Discovery.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 573\u2013578.","DOI":"10.1109\/ICEC.1995.487447"},{"key":"5091610_CR102","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H. and G. Laporte. (1996). \u201cMetaheuristics: A Bibliography.\u201d Annals of Operations Research 63, 513\u2013628.","journal-title":"Annals of Operations Research"},{"key":"5091610_CR103","unstructured":"Papadimitriou, C.H. and K. Steiglitz. (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall."},{"key":"5091610_CR104","first-page":"155","volume-title":"Proc. of the Second Int. Conf. on Genetic Algorithms","author":"C.B. Petty","year":"1987","unstructured":"Petty, C.B., M.R. Leuze, and J.J. Grefenstette. (1987). \u201cA Parallel Genetic Algorithm.\u201d In Proc. of the Second Int. Conf. on Genetic Algorithms. Cambridge: MIT, pp. 155\u2013161."},{"key":"5091610_CR105","series-title":"LNCS","first-page":"264","volume-title":"Parallel Problem Solving from Nature","author":"S. Piramuthu","year":"1990","unstructured":"Piramuthu, S. (1990). \u201cFeature Construction for Back-Propagation.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature, Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 264\u2013268."},{"issue":"2","key":"5091610_CR106","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF00127078","volume":"1","author":"S.C.S. Porto","year":"1996","unstructured":"Porto, S.C.S. and C. Ribeiro. (1996). \u201cParallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling Under Precedence Constraints.\u201d Journal of Heuristics 1(2), 207\u2013223.","journal-title":"Journal of Heuristics"},{"key":"5091610_CR107","first-page":"5","volume":"2","author":"W.D. Potter","year":"1992","unstructured":"Potter, W.D., J.A. Miller, B.E. Tonn, R.V. Gandham, and C.N. Lapena. (1992). \u201cImproving the Reliability of Heuristic Multiple Fault Diagnosis via the Ec-based Genetic Algorithm.\u201d Int. J. Artificial Intell., Neural Networks, Complex Problem-Solving Technol. 2, 5\u201323.","journal-title":"Int. J. Artificial Intell., Neural Networks, Complex Problem-Solving Technol."},{"key":"5091610_CR108","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0957-4174(90)90051-U","volume":"1","author":"W.D. Potter","year":"1990","unstructured":"Potter, W.D., J.A. Miller, and O.R. Weyrich. (1990). \u201cA Comparison of Methods for Diagnostic Decision Making.\u201d Expert Syst. Applicat. Int. J. 1, 425\u2013436.","journal-title":"Expert Syst. Applicat. Int. J."},{"key":"5091610_CR109","volume-title":"Evolutionsstrategie: Optimierung technischer systeme nach prizipien der biologischen evolution","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer systeme nach prizipien der biologischen evolution. Formann-Holzboog Verlag, Stuttgart, Germany."},{"key":"5091610_CR110","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C.R. Reeves","year":"1993","unstructured":"Reeves, C.R. (1993). Modern Heuristic Techniques for Combinatorial Problems. Oxford, UK: Black Scientific Publications."},{"key":"5091610_CR111","first-page":"253","volume-title":"Meta-Heuristics: Theory and Applications","author":"C. Rego","year":"1996","unstructured":"Rego, C. and C. Roucairol. (1996). \u201cA Parallel Tabu Search Algorithm for the Vehicle Routing Problem.\u201d In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer, Norwell, MA, USA, pp. 253\u2013295."},{"key":"5091610_CR112","unstructured":"Rose, J.S., D.R. Blythe, W.M. Snelgrove, and Z.G. Vranecic. (1986). \u201cFast, High Quality VLSI Placement on a MIMD Multiprocessor.\u201d In IEEE Int. Conf. on Computer-Aided Design, Santa Clara, pp. 42\u201345."},{"key":"5091610_CR113","series-title":"LNCS","first-page":"209","volume-title":"Parallel Problem Solving from Nature","author":"G. Rudolph","year":"1990","unstructured":"Rudolph, G. \u201cGlobal Optimization by Means of Distributed Evolution Strategies.\u201d (1990). In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 209\u2013213."},{"key":"5091610_CR114","doi-asserted-by":"crossref","first-page":"318","DOI":"10.7551\/mitpress\/5236.001.0001","volume-title":"Parallel Distributed Processing","author":"D.E. Rumelhart","year":"1986","unstructured":"Rumelhart, D.E., G.E. Hinton, and R.J. Williams. (1986). \u201cLearning Internal Representations by Error Propagation.\u201d In D.E. Rumelhart and J.L. McClelland (eds.), Parallel Distributed Processing, Vol. 1, MIT Press, USA, pp. 318\u2013362."},{"key":"5091610_CR115","volume-title":"Fifth Annual Conference on Evolutionary Programming EP'96","author":"M. Salami","year":"1996","unstructured":"Salami, M. and G. Cain. (1996). \u201cGenetic Algorithm Processor on Reprogrammable Architectures.\u201d In Fifth Annual Conference on Evolutionary Programming EP'96, San Diego, California, USA, MIT Press."},{"issue":"5","key":"5091610_CR116","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/43.55180","volume":"9","author":"K. Shahookar","year":"1990","unstructured":"Shahookar, K. and P. Mazumder. (1990). \u201cA Genetic Approach to Standard Cell Placement Using Metagenetic Parameter Optimization.\u201d IEEE Trans. Computer-Aided Design 9(5), 500\u2013511.","journal-title":"IEEE Trans. Computer-Aided Design"},{"issue":"5","key":"5091610_CR117","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1109\/3477.537320","volume":"26","author":"A. Shoukry","year":"1996","unstructured":"Shoukry, A. and M. Aboutabl. (1996). \u201cNeural Network Approach for Solving the Maximal Common Subgraph Problem.\u201d IEEE Trans. on Systems, Man, and Cybernetics 26(5), 785\u2013790.","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"key":"5091610_CR118","series-title":"Technical Report","volume-title":"\u201cDynamic Complex Systems: A New Approach to Parallel Computing in Computational Physics","author":"P.M. Sloot","year":"1995","unstructured":"Sloot, P.M., J.A. Kandorp, and A. Schoneveld. (1995). \u201cDynamic Complex Systems: A New Approach to Parallel Computing in Computational Physics.\u201d Technical Report TR-CS-95-08, University of Amsterdam, Netherlands."},{"key":"5091610_CR119","first-page":"1384","volume-title":"Proc. of the 1999 Congress on Evolutionary Computation","author":"J. Sprave","year":"1999","unstructured":"Sprave, J. (1999). \u201cA Unified Model of Non-panmictic Population Structures in Evolutionary Algorithms.\u201d In Proc. of the 1999 Congress on Evolutionary Computation, Vol. 2, Piscataway, NJ, IEEE Press, pp. 1384\u20131391."},{"key":"5091610_CR120","first-page":"191","volume-title":"2nd Int. Conf. on Metaheuristics","author":"T. Stutzle","year":"1997","unstructured":"Stutzle, T. and H.H. Hoos. (1997). \u201cThe MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization.\u201d In 2nd Int. Conf. on Metaheuristics, Sophia Antipolis, France, INRIA, pp. 191\u2013193."},{"key":"5091610_CR121","first-page":"100","volume-title":"2nd Int. Conf. Genetic Algorithms","author":"J.Y. Suh","year":"1987","unstructured":"Suh, J.Y. and D. Van Gucht. (1987). \u201cIncorporating Heuristic Information into Genetic Search.\u201d In 2nd Int. Conf. Genetic Algorithms, Lawrence Erlbaum Associates, USA, pp. 100\u2013107."},{"key":"5091610_CR122","unstructured":"Sun, Z. and Q. Wan. (1995). \u201cA Modified Genetic Algorithm: Meta-leval Control of Migration in Distributed Ga.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 312\u2013316."},{"key":"5091610_CR123","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. Taillard","year":"1993","unstructured":"Taillard, E. (1993). \u201cParallel Iterative Search Methods for Vehicle Routing Problem.\u201d Networks 23, 661\u2013673.","journal-title":"Networks"},{"key":"5091610_CR124","first-page":"217","volume-title":"2nd Int. Conf. on Metaheuristics","author":"E.D. Taillard","year":"1997","unstructured":"Taillard, E.D. and L.M. Gambardella. (1997). \u201cAn Ant Approach for Structured Quadratic Assignment Problems.\u201d In C. Roucairol, I.H. Osman, S. Martello, and S. Voss (eds.), 2nd Int. Conf. on Metaheuristics, Sophia Antipolis, France, INRIA, pp. 217\u2013222."},{"key":"5091610_CR125","unstructured":"Talbi, E.G., T. Muntean, and I. Samarandache. (1994). \u201cHybridation des AlgorithmesG\u00e9n\u00e9tiquesAvec la Recherche Tabou.\u201d In Evolution Artificielle EA94, Toulouse, France."},{"key":"5091610_CR126","first-page":"177","volume-title":"Proc. of the Second Int. Conf. on Genetic Algorithms","author":"R. Tanese","year":"1987","unstructured":"Tanese, R. (1987). \u201cParallel genetic Algorithms for a Hypercube.\u201d In Proc. of the Second Int. Conf. on Genetic Algorithms, MIT, Cambridge, MA, USA, pp. 177\u2013183."},{"issue":"4","key":"5091610_CR127","first-page":"226","volume":"32","author":"J. Thiel","year":"1994","unstructured":"Thiel, J. and S. Voss. (1994). \u201cSome Experiences on Solving Multiconstraint Zero-one Knapsack Problems with Genetic Algorithms.\u201d INFOR 32(4), 226\u2013242.","journal-title":"INFOR"},{"key":"5091610_CR128","series-title":"LNCS","first-page":"109","volume-title":"Parallel Problem Solving from Nature","author":"N.L.J. Ulder","year":"1990","unstructured":"Ulder, N.L.J., E.H.L. Aarts, H.-J. Bandelt, P.J.M. Van Laarhoven, and E. Pesch. (1990). \u201cGenetic Local Search Algorithms for the Traveling Salesman Problem.\u201d In H.-P. Schewefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 109\u2013116."},{"key":"5091610_CR129","unstructured":"Vaessens, R., E. Aarts, and J. Lenstra. (1992). \u201cA Local Search Template.\u201d In R. Manner and B. Manderick (eds.), Parallel Problem Solving From Nature. Belgique, pp. 67\u201376."},{"key":"5091610_CR130","series-title":"LNCS","first-page":"373","volume-title":"Parallel Problem Solving from Nature","author":"H.-M. Voigt","year":"1990","unstructured":"Voigt, H.-M., J. Born, and I. Santibanez-Koref. (1990). \u201cModelling and Simulation of Distributed Evolutionary Search Processes for Function Optimization.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 373\u2013380."},{"key":"5091610_CR131","series-title":"LNCS","first-page":"165","volume-title":"Parallel Problem Solving from Nature","author":"G. Von Laszewski","year":"1990","unstructured":"Von Laszewski, G. and H. Muhlenbein. (1990). \u201cPartitioning a Graph with Parallel Genetic Algorithm.\u201d In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany. Springer-Verlag, pp. 165\u2013169."},{"key":"5091610_CR132","first-page":"333","volume-title":"Network Optimization Problems","author":"S. Voss","year":"1993","unstructured":"Voss, S. (1993). \u201cTabu Search: Applications and Prospects.\u201d In Network Optimization Problems, World Scientific, USA, pp. 333\u2013353."},{"key":"5091610_CR133","unstructured":"Wang, L.-H., C.-Y. Kao, M. Ouh-Young, and W.-C. Chen, (1995). \u201cMolecular Binding: A Case Study of the Population-Based annealing Genetic Algorithms.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 50\u201355."},{"key":"5091610_CR134","unstructured":"Yang, S.Y., L.-J. Park, C.H. Park, and J.W. Ra. (1995). \u201cA Hybrid Algorithm Using Genetic Algorithm and Gradient-Based Algorithm for Iterative Microwave Inverse Scattering.\u201d In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 450\u2013455."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016540724870.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016540724870\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016540724870.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:03:34Z","timestamp":1747652614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016540724870"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":134,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["5091610"],"URL":"https:\/\/doi.org\/10.1023\/a:1016540724870","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}