{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:24Z","timestamp":1774449084131,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s13675-014-0023-6","type":"journal-article","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T08:00:02Z","timestamp":1404892802000},"page":"279-296","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["A Lagrangian-ACO matheuristic for car sequencing"],"prefix":"10.1016","volume":"2","author":[{"given":"Dhananjay","family":"Thiruvady","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Ernst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-014-0023-6_CR1","doi-asserted-by":"crossref","unstructured":"Abramson D, Giddy J, Kotler L (2000) High performance parametric modeling with Nimrod\/G: killer application for the global grid? In: International Parallel and Distributed Processing Symposium (IPDPS). IEEE Computer Society, Washington, DC, USA, pp 520\u2013528","DOI":"10.1109\/IPDPS.2000.846030"},{"key":"10.1007\/s13675-014-0023-6_CR2","doi-asserted-by":"crossref","unstructured":"Anghinolfi D, Paolucci M, Sacone S, Siri S (2011) Integer programming and ant colony optimization for planning intermodal freight transportation operations. In: 2011 IEEE Conference on automation Science and Engineering (CASE), pages 214\u2013219","DOI":"10.1109\/CASE.2011.6042496"},{"issue":"1","key":"10.1007\/s13675-014-0023-6_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10107-007-0148-y","article-title":"Two \u201cwell-known\u201d properties of subgradient optimization","volume":"120","author":"Anstreicher","year":"2009","journal-title":"Math Progr"},{"key":"10.1007\/s13675-014-0023-6_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10479-007-0278-x","article-title":"A beam search approach for the optimization version of the car sequencing problem","volume":"159","author":"Bautista","year":"2008","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-014-0023-6_CR5","series-title":"Convex analysis and optimization","author":"Bertsekas","year":"2003"},{"key":"10.1007\/s13675-014-0023-6_CR6","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","article-title":"Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling","volume":"32","author":"Blum","year":"2005","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-014-0023-6_CR7","doi-asserted-by":"crossref","unstructured":"Blum C, Blesa M, Roli A, Sampels M (eds) (2008) Hybrid metaheuristics: an emerging approach to optimization. Studies in Computational Intelligence, vol 114. Springer, Berlin","DOI":"10.1007\/978-3-540-78295-7"},{"issue":"3","key":"10.1007\/s13675-014-0023-6_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10732-007-9064-9","article-title":"Benders decomposition, Lagrangian relaxation and metaheuristic design","volume":"15","author":"Boschetti","year":"2009","journal-title":"J Heuristics"},{"key":"10.1007\/s13675-014-0023-6_CR9","series-title":"Self-organization in biological systems","author":"Camazine","year":"2001"},{"key":"10.1007\/s13675-014-0023-6_CR10","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","article-title":"Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art","volume":"191","author":"Coello","year":"2002","journal-title":"Comput Methods in Appl Mech Eng"},{"key":"10.1007\/s13675-014-0023-6_CR11","unstructured":"Dincbus M, Simonis H, Hentenryck P (1988) Solving the car-sequencing problem in constraint logic programming. In: 8th European Conference on Artificial Intelligence-ECAI 88. Pitmann Publishing, London, pp 290\u2013295"},{"key":"10.1007\/s13675-014-0023-6_CR12","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis, Dip. Elettronica"},{"key":"10.1007\/s13675-014-0023-6_CR13","series-title":"Ant colony optimization","author":"Dorigo","year":"2004"},{"key":"10.1007\/s13675-014-0023-6_CR14","doi-asserted-by":"crossref","unstructured":"Ernst AT (2010) A hybrid Lagrangian particle swarm optimization algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona. IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2010.5585939"},{"issue":"12","key":"10.1007\/s13675-014-0023-6_CR15","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"50","author":"Fisher","year":"2004","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-014-0023-6_CR16","unstructured":"Gent I (1998) Two results on car sequencing problems. Technical Report APES02. University of St. Andrews, St. Andrews, UK"},{"key":"10.1007\/s13675-014-0023-6_CR17","doi-asserted-by":"crossref","unstructured":"Gent I, Walsh T (1999) CSPLIB: a benchmark library for constraints. Technical Report APES-09-1999. University of St. Andrews, St. Andrews, UK","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"10.1007\/s13675-014-0023-6_CR18","unstructured":"Glover FW, Kochenberger GA (eds) Handbook of metaheuristics, International series in operations research and management science, vol 57. Springer, Berlin"},{"key":"10.1007\/s13675-014-0023-6_CR19","first-page":"245","article-title":"A study of greedy, local search and ACO for car sequencing problems","volume":"2611","author":"Gottlieb","year":"2003","journal-title":"Lect Notes Comput Sci"},{"key":"10.1007\/s13675-014-0023-6_CR20","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1057\/palgrave.jors.2601955","article-title":"Review and comparison of three methods for the solution of the car-sequencing problem","volume":"56","author":"Gravel","year":"2004","journal-title":"J Oper Res Soc"},{"key":"10.1007\/s13675-014-0023-6_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","article-title":"Constraint satisfaction using constraint logic programming","volume":"58","author":"Hentenryck","year":"1992","journal-title":"Artif Intell"},{"key":"10.1007\/s13675-014-0023-6_CR22","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/978-3-540-68155-7_32","article-title":"CP with ACO","volume":"5015","author":"Khichane","year":"2008","journal-title":"Lect Notes Comput Sci"},{"key":"10.1007\/s13675-014-0023-6_CR23","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.orl.2003.09.003","article-title":"On the complexity of the car sequencing problem","volume":"32","author":"Kis","year":"2004","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-014-0023-6_CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-642-01009-5_9","article-title":"Beam-ACO based on stochastic sampling for makespan optimization concerning the TSP with time windows","volume":"5482","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2009","journal-title":"Lect Notes Comput Sci"},{"key":"10.1007\/s13675-014-0023-6_CR25","series-title":"Ant colony optimization and swarm intelligence","first-page":"37","article-title":"An ant approach to membership overlay design","author":"Maniezzo","year":"2004"},{"key":"10.1007\/s13675-014-0023-6_CR26","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics\u2014hybridizing metaheuristics and mathematical programming, Annals of information systems, vol 10. Springer, Berlin"},{"key":"10.1007\/s13675-014-0023-6_CR27","series-title":"Programming with constraints","author":"Marriott","year":"1998"},{"key":"10.1007\/s13675-014-0023-6_CR28","doi-asserted-by":"crossref","unstructured":"Meyer B, Ernst A (2004) Integrating ACO and constraint propagation. Lecture notes in computer science: ant colony, optimization and swarm intelligence, vol 3172, pp 166\u2013177","DOI":"10.1007\/978-3-540-28646-2_15"},{"key":"10.1007\/s13675-014-0023-6_CR29","unstructured":"Gurobi Optimization (2010) Gurobi optimizer version 5.0. Available from: http:\/\/www.gurobi.com\/"},{"key":"10.1007\/s13675-014-0023-6_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00246021","article-title":"Job-shop scheduling using automated reasoning: a case study of the car sequencing problem","volume":"2","author":"Parrello","year":"1986","journal-title":"J autom Reason"},{"key":"10.1007\/s13675-014-0023-6_CR31","doi-asserted-by":"crossref","unstructured":"Perron L, Shaw P (2004) Combining forces to solve the car sequencing problem. In: CPAIOR-04, vol 3011. Springer, Berlin, pp 225\u2013239","DOI":"10.1007\/978-3-540-24664-0_16"},{"key":"10.1007\/s13675-014-0023-6_CR32","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1007\/978-3-540-30217-9_65","article-title":"An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing","volume":"3242","author":"Puchinger","year":"2004","journal-title":"Lect Notes Comput Sci"},{"key":"10.1007\/s13675-014-0023-6_CR33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/11499305_5","article-title":"Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification","volume":"3562","author":"Puchinger","year":"2005","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"10.1007\/s13675-014-0023-6_CR34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2011.07.033","article-title":"Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem","volume":"182","author":"Ren","year":"2012","journal-title":"Inf. Sci."},{"key":"10.1007\/s13675-014-0023-6_CR35","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","article-title":"The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem","volume":"191","author":"Solnon","year":"2008","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-014-0023-6_CR36","unstructured":"Thiruvady D (2012) Hybrids of stochastic metaheuristics and constraint programming for combinatorial optimization. PhD thesis, Calyton School of Information Technology"},{"key":"10.1007\/s13675-014-0023-6_CR37","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-642-04918-7_3","article-title":"Hybridizing beam-ACO with constraint programming for single machine job scheduling","volume":"5818","author":"Thiruvady","year":"2009","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"10.1007\/s13675-014-0023-6_CR38","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.ijpe.2012.06.012","article-title":"Constraint-based ACO for a shared resource constrained scheduling problem","volume":"141","author":"Thiruvady","year":"2012","journal-title":"Int J Prod Econ"},{"key":"10.1007\/s13675-014-0023-6_CR39","doi-asserted-by":"crossref","unstructured":"Thiruvady DR, Meyer B, Ernst AT (2011) Car sequencing with constraint-based ACO. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201911. ACM, New York, pp 163\u2013170","DOI":"10.1145\/2001576.2001599"},{"issue":"7","key":"10.1007\/s13675-014-0023-6_CR40","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1016\/j.cor.2006.11.004","article-title":"Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups","volume":"35","author":"Valente","year":"2008","journal-title":"Comput Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-014-0023-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-014-0023-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000368?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000368?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-014-0023-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:09Z","timestamp":1761882369000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["S2192440621000368"],"URL":"https:\/\/doi.org\/10.1007\/s13675-014-0023-6","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2014,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Lagrangian-ACO matheuristic for car sequencing","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-014-0023-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}