{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:22:57Z","timestamp":1759530177120},"reference-count":34,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1051\/ro:2007003","type":"journal-article","created":{"date-parts":[[2007,2,13]],"date-time":"2007-02-13T09:18:42Z","timestamp":1171358322000},"page":"355-379","source":"Crossref","is-referenced-by-count":18,"title":["Large neighborhood improvements for solving car sequencing problems"],"prefix":"10.1051","volume":"40","author":[{"given":"Bertrand","family":"Estellon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Gardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Nouioua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2007,2,14]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"Ahuja","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"R2","unstructured":"E. Aarts and J.K. Lenstra,Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, UK (1997)."},{"key":"R3","unstructured":"V-.D. Cung and A. Nguyen (2003). Challenge ROADEF'2005. http:\/\/www.prism.uvsq.fr\/\u00a0vdc\/ROADEF\/CHALLENGES\/2005\/"},{"key":"R4","unstructured":"V-.D. Cung and A. Nguyen Le probl\u00e8me du Car Sequencing RENAULT et le Challenge ROADEF'2005, inActes des JFPC 2005, les 1resJourn\u00e9es Francophones de Programmation par Contraintes, Lens, France, edited by C. Solnon (2005) 3\u201310"},{"key":"R5","unstructured":"B. Estellon, F. Gardi and K. Nouioua, Ordonnancement de v\u00e9hicules dans les usines RENAULT: une approche par recherche locale \u00e0 voisinage large, inActes de ROADEF 2005, le\u00a06eCongr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d'Aide \u00e0 la D\u00e9cision, Tours, France, edited by J.-C. Billaut (2005) 33\u201334."},{"key":"R6","unstructured":"B. Estellon, F. Gardi and K. Nouioua, Ordonnancement de v\u00e9hicules dans les usines RENAULT: une approche par recherche locale \u00e0 voisinage r\u00e9duit, inActes de ROADEF 2005, le 6eCongr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d'Aide \u00e0 la D\u00e9cision, Tours, France, edited by J.-C. Billaut (2005) 35\u201336."},{"key":"R7","unstructured":"B. Estellon, F. Gardi and K. Nouioua, Ordonnancement de v\u00e9hicules: une approche par recherche locale \u00e0 voisinage large, inActes des JFPC 2005, les 1resJourn\u00e9es Francophones de Programmation par Contraintes, Lens, France, edited by C. Solnon (2005) 21\u201328."},{"key":"R8","unstructured":"B. Estellon, F. Gardi and K. Nouioua, Two local search approaches for solving real-life car sequencing problems. Submitted toEuropean Journal of Operational Research(2006)."},{"key":"R9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"Fischetti","year":"2003","journal-title":"Mathematical Programming Series B"},{"key":"R10","unstructured":"I.P. Gent,Two results on car sequencing problem. APES Research Report 02-1998. Department of Computer Science, University of Strathclyde, Glasgow, Scotland, UK (1998)."},{"key":"R11","unstructured":"I.P. Gent and T. Walsh,CSPlib: a benchmark library for constraints. APES Research Report 09-1999. Department of Computer Science, University of Strathclyde, Glasgow, Scotland, UK (1999). http:\/\/www.csplib.org\/"},{"key":"R12","unstructured":"J. Gottlieb, M. Puchta and C. Solnon, A study of greedy, local search and ant colony optimization approaches for car sequencing problems, inProceedings of EvoWorkshops 2003 on Applications of Evolutionary Computing, edited by G.R. Raidlet al., Springer-Verlag, Berlin, Germany,Lect. Notes. Comput Sci.2611(2003) 246\u2013257."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1057\/palgrave.jors.2601955","volume":"56","author":"Gravel","year":"2005","journal-title":"J. Oper. Res. Soc."},{"key":"R14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"key":"R15","unstructured":"Y. Khacheni and A. Nguyen, Personnal communication (2006)."},{"key":"R16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.orl.2003.09.003","volume":"32","author":"Kis","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"R17","unstructured":"A. Makhorin, GLPK library (GNU Linear Programming Kit, version 4.9) (2006). http:\/\/www.gnu.org\/software\/glpk\/"},{"key":"R18","unstructured":"T. Mautor and P. Michelon, MIMAUSA: a new hybrid method combining exact solution and local search, inMIC 97, the 2nd Metaheuristics International Conference, Sophia-Antipolis, France (1997)."},{"key":"R19","unstructured":"S. Morin, C. Gagn\u00e9, M. Gravel and W.L. Price, Trace de ph\u00e9romone sp\u00e9cialis\u00e9e dans un algorithme de fourmi pour le probl\u00e8me de \u201ccar sequencing\u201d, inActes de MOSIM 2006, la 6\u00e8me Conf\u00e9rence Francophone de Mod\u00e9lisation et Simulation, Rabat, Maroc, edited by M. Gournand and F. Riane (2006) 22\u201329."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"L. Michel and P. Van Hentenryck, A constraint-based architecture for local search, inProceedings of OOPSLA 2002, the 2002 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, ACM Press, New York, NYSIGPLAN Notices37(2002) 83\u2013100.","DOI":"10.1145\/583854.582430"},{"key":"R21","unstructured":"M. Palpant,Recherche exacte et approch\u00e9e en optimisation combinatoire: sch\u00e9mas d'int\u00e9gration et applications, Ph.D. Thesis. Laboratoire d'Informatique d'Avignon, Universit\u00e9 d'Avignon et des Pays de Vaucluse, Avignon, France (2005)."},{"key":"R22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","volume":"31","author":"Palpant","year":"2004","journal-title":"Ann. Oper. Res."},{"key":"R23","unstructured":"L. Perron and P. Shaw, Combining forces to solve the car sequencing problem, inProceedings of CPAIOR 2004, the 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, edited by J.-C. R\u00ebgin and M. Rueher, Springer-Verlag, Berlin, Germany,Lect. Note Comput Sci.3011(2004) 225\u2013239."},{"key":"R24","unstructured":"L. Perron, P. Shaw and V. Furnon, Propagation guided large neighborhood search, inProceedings of CP 2004, the 10th International Conference on Principles and Practice of Constraint Programming, edited by M. Wallace, Springer-Verlag, Berlin, Germany,Lect. Note Comput Sci.3258(2004) 468\u2013481."},{"key":"R25","unstructured":"M. Prandtstetter and G.R. Raidl, A variable neighborhood search approach for solving the car sequencing problem, inProceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, edited by P. Hansen, N. Mladenovic, J.A. Moreno P\u00e9rez, J.M. Moreno Vega and B. Meli\u00e1n Batista, Tenerife, Spain (2005)."},{"key":"R26","unstructured":"M. Prandtstetter and G.R. Raidl, Aninteger linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Technical Report TR-186-1-05-01. Institut for Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria (2005)."},{"key":"R27","unstructured":"M. Prandtstetter, Personnal communication (2006)."},{"key":"R28","unstructured":"M. Puchta and J. Gottlieb, Solving car sequencing problems by local optimization, inProceedings of EvoWorkshops 2002 on Applications of Evolutionary Computing, edited by S. Cagnoniet\u00a0al., Springer-Verlag, Berlin, Germany,Lect. Note Comput Sci.2279(2002) 132\u2013142."},{"key":"R29","unstructured":"J.-C. R\u00e9gin and J.-F. Puget, A filtering algorithm for global sequencing constraints, inProceedings of CP 97, the 3rd International Conference on Principles and Practice of Constraint Programming, edited by G. Smolka, Springer-Verlag, Berlin, Germany,Lect. Note Comput Sci.1330(1997) 32\u201346."},{"key":"R30","unstructured":"C. Ribeiro, D. Aloise, T. Noronha, C. Rocha and S. Urrutia, A hybrid heuristic for a real-life car sequencing problem with multiple requirements, inProceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, edited by P. Hansen, N. Mladenovic, J.A. Moreno P\u00e9rez, J.M. Moreno Vega and B. Meli\u00e1n Batista, Tenerife, Spain (2005)."},{"key":"R31","unstructured":"A. Schrijver,Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, Berlin, Germany,Algorithms and Combinatorics24(2003)."},{"key":"R32","unstructured":"C. Solnon, Solving permutation contraint satisfaction problems with artificial ants, inProceedings of ECAI 2000, the 14th European Conference on Artificial Intelligence, edited by H. Werner, IOS Press, Amsterdam, The Netherlands, (2000) 118\u2013122."},{"key":"R33","unstructured":"C. Solnon, Des fourmis pour le probl\u00e8me de l'ordonnancement de voitures, inActes des JFPC 2006, les 2esJourn\u00e9es Francophones de Programmation par Contraintes, N\u00eemes, France, edited by L. Henocque (2006) 305\u2013316."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan,Data Structures and Network Algorithms. SIAM Publications, Philadelphie, PA,CBMS-NSF Regional Conference Series in Applied Mathematics44(1983).","DOI":"10.1137\/1.9781611970265"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007003\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,8]],"date-time":"2021-08-08T17:41:50Z","timestamp":1628444510000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":34,"journal-issue":{"issue":"4"},"alternative-id":["ro0651"],"URL":"https:\/\/doi.org\/10.1051\/ro:2007003","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}