{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T15:41:12Z","timestamp":1783352472069,"version":"3.54.6"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf02125407","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T15:38:18Z","timestamp":1126712298000},"page":"437-461","source":"Crossref","is-referenced-by-count":219,"title":["Genetic and hybrid algorithms for graph coloring"],"prefix":"10.1007","volume":"63","author":[{"given":"Charles","family":"Fleurent","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacques A.","family":"Ferland","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02125407_CR1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0141-9331(92)90003-C","volume":"16","author":"R. Battiti","year":"1992","unstructured":"R. Battiti and G. Tecchiolli, Parallel biased search for combinatorial optimization: Genetic algorithms and tabu, Microproc. Microsyst. 16(1992)351\u2013367.","journal-title":"Microproc. Microsyst."},{"key":"BF02125407_CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"R. Battiti and G. Tecchiolli, The reactive tabu search, ORSA J. Comp. 6(1994)126\u2013140.","journal-title":"ORSA J. Comp."},{"key":"BF02125407_CR3","first-page":"69","volume-title":"A comparison of genetic sequencing operators","author":"T. Starkweather","year":"1991","unstructured":"T. Starkweather, S. McDaniel, K. Mathias, D. Whitley and C. Whitley, A comparison of genetic sequencing operators,Proc. 4th Int. Conf. on Genetic Algorithms, ed. R.K. Belew and L.B. Booker (Morgan Kaufmann, San Mateo, CA, 1991) pp. 69\u201376."},{"key":"BF02125407_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"D. Brelaz, New methods to color vertices of a graph, Commun. ACM 22(1979)251\u2013256.","journal-title":"Commun. ACM"},{"key":"BF02125407_CR5","unstructured":"B. Carter and K. Park, How good are genetic algorithms at finding large cliques: An experimental study, Technical Report BU-CS-93-015, Boston University (1994)."},{"key":"BF02125407_CR6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M. Chams","year":"1987","unstructured":"M. Chams, A. Hertz and D. de Werra, Some experiments with simulated annealing for coloring graphs, Euro. J. Oper. Res. 32(1987)260\u2013266.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02125407_CR7","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"L. Davis,Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991)."},{"key":"BF02125407_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02022561","volume":"41","author":"F. Dammeyer","year":"1993","unstructured":"F. Dammeyer and S. Voss, Dynamic tabu list management using the reverse elimination method, Ann. Oper. Res. 41(1993)31\u201346.","journal-title":"Ann. Oper. Res."},{"key":"BF02125407_CR9","unstructured":"DIMACS, Discrete Mathematics and Theoretical Computer Science anonymous ftp site at dimacs.rutgers.edu."},{"key":"BF02125407_CR10","first-page":"265","volume-title":"Foundations of Genetic Algorithms","author":"L.J. Eshelman","year":"1992","unstructured":"L.J. Eshelman, The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 265\u2013283."},{"key":"BF02125407_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","volume":"16","author":"C. Fleurent","year":"1994","unstructured":"C. Fleurent and J.A. Ferland, Genetic hybrids for the quadratic assignment problem, DIMACS Series, Discr. Math. Theor. Comp. Sci. 16(1994)173\u2013187","journal-title":"DIMACS Series, Discr. Math. Theor. Comp. Sci."},{"key":"BF02125407_CR12","first-page":"284","volume-title":"Foundations of Genetic Algorithms","author":"B.R. Fox","year":"1992","unstructured":"B.R. Fox and M.B. McMahon, Genetic operators for sequencing problems, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 284\u2013300."},{"key":"BF02125407_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C Friden","year":"1989","unstructured":"C, Friden, A. Hertz and D. de Werra, STABULUS: A technique for finding stable sets in large graphs with tabu search, Computing 42(1989)35\u201344.","journal-title":"Computing"},{"key":"BF02125407_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)."},{"key":"BF02125407_CR15","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977)156\u2013166.","journal-title":"Dec. Sci."},{"key":"BF02125407_CR16","unstructured":"F. Glover, Genetic algorithms and scatter search: Unsuspected potentials, Technical Report, University of Colorado at Boulder (1993)."},{"key":"BF02125407_CR17","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 13(1986)533\u2013549.","journal-title":"Comp. Oper. Res."},{"key":"BF02125407_CR18","unstructured":"F. Glover, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), to appear in Discr. Appl. Math."},{"key":"BF02125407_CR19","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"F. Glover and M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (Blackwell Scientific, Oxford, 1993) pp. 70\u2013141."},{"key":"BF02125407_CR20","unstructured":"D.E. Goldberg,Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, 1989)."},{"key":"BF02125407_CR21","unstructured":"J.J. Grefenstette, Incorporating problem specific knowledge into genetic algorithms, in:Genetic Algorithms and Simulated Annealing (Morgan Kaufmann, 1987) pp. 42\u201360."},{"key":"BF02125407_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"A. Hertz and D. de Werra, Using tabu search techniques for graph coloring, Computing 39(1987)345\u2013351.","journal-title":"Computing"},{"key":"BF02125407_CR23","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland,Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975)."},{"key":"BF02125407_CR24","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation, Part II; Graph coloring and number partitioning, Oper. Res. 39(1991)378\u2013406.","journal-title":"Oper. Res."},{"key":"BF02125407_CR25","series-title":"Technical Report","volume-title":"Probabilistic bounds and heuristic algorithms for coloring large random graphs","author":"A. Johri","year":"1982","unstructured":"A. Johri and D.W. Matula, Probabilistic bounds and heuristic algorithms for coloring large random graphs, Technical Report, Southern Methodist University, Dallas, TX (1982)."},{"key":"BF02125407_CR26","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1145\/62959.62969","volume":"31","author":"P. L'\u00c9cuyer","year":"1988","unstructured":"P. L'\u00c9cuyer, Efficient and portable combined random number generators, Commun. ACM 31(1988)742\u2013774.","journal-title":"Commun. ACM"},{"key":"BF02125407_CR27","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F. Leighton","year":"1979","unstructured":"F. Leighton, A graph coloring algorithm for large scheduling problems, J. Res. Nat. Bureau of Standards 84(1979)489\u2013505.","journal-title":"J. Res. Nat. Bureau of Standards"},{"key":"BF02125407_CR28","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin, Computer solutions of the traveling salesman problem, Bell. Syst. Tech. J. 44(1965)2245\u20132269.","journal-title":"Bell. Syst. Tech. J."},{"key":"BF02125407_CR29","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B.W. Kernighan, An effective heuristic for the traveling salesman problem, Oper. Res. 21(1973)498\u2013516.","journal-title":"Oper. Res."},{"key":"BF02125407_CR30","unstructured":"C. Morgenstern, Distributed coloration neighborhood search, presented at the15th Int. Symp. on Mathematical Programming, Ann Arbor (1994)."},{"key":"BF02125407_CR31","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. Muhlenbein","year":"1988","unstructured":"H. Muhlenbein, M. Gorges-Schleuter and O. Kramer, Evolution algorithms in combinatorial optimization, Parallel Comp. 7(1988)65\u201388.","journal-title":"Parallel Comp."},{"key":"BF02125407_CR32","first-page":"316","volume-title":"Foundations of Genetic Algorithms","author":"H. Muhlenbein","year":"1992","unstructured":"H. Muhlenbein, Evolution in time and space \u2014 the parallel genetic algorithm, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 316\u2013335."},{"key":"BF02125407_CR33","first-page":"102","volume-title":"Foundations of Genetic Algorithms","author":"J.D. Schaffer","year":"1992","unstructured":"J.D. Schaffer, L.J. Eshelman and D. Offutt, Spurious correlations and premature convergence in genetic algorithms, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 102\u2013112."},{"key":"BF02125407_CR34","unstructured":"G. Syswerda, Uniform crossover in genetic algorithms,Proc. 3rd Int. Conf. on Genetic Algorithms (Morgan Kaufmann, 1989) pp. 2\u20139."},{"key":"BF02125407_CR35","first-page":"94","volume-title":"Foundations of Genetic Algorithms","author":"G. Syswerda","year":"1992","unstructured":"G. Syswerda, A study of reproduction in generational and steady-state genetic algorithms, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 94\u2013101."},{"key":"BF02125407_CR36","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comp. 17(1991)443\u2013455.","journal-title":"Parallel Comp."},{"key":"BF02125407_CR37","unstructured":"E. Taillard, Recherches it\u00e9ratives dirig\u00e9es parall\u00e8les, Ph.D. Thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (1993)."},{"key":"BF02125407_CR38","unstructured":"E. Taillard, Comparison of iteratives searches for the quadratic assignment problem, Technical Report ORWP94\/04, DMA, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (1994)."},{"key":"BF02125407_CR39","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","volume":"22","author":"D.E. Tate","year":"1995","unstructured":"D.E. Tate and A.E. Smith, A genetic approach to the quadratic assignment problem, Comp. Oper. Res. 22(1995)73\u201383.","journal-title":"Comp. Oper. Res."},{"key":"BF02125407_CR40","volume-title":"Codes and Cryptography","author":"D. Welsh","year":"1988","unstructured":"D. Welsh,Codes and Cryptography (Oxford University Press, New York, 1988)."},{"key":"BF02125407_CR41","first-page":"350","volume-title":"Handbook of Genetic Algorithms","author":"D. Whitley","year":"1991","unstructured":"D. Whitley, T. Starkweather and D. Shaner, The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination, in:Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991) pp. 350\u2013372."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125407.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02125407\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:31:09Z","timestamp":1557797469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02125407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF02125407"],"URL":"https:\/\/doi.org\/10.1007\/bf02125407","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}