{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:19:26Z","timestamp":1762017566546},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,29]],"date-time":"2011-12-29T00:00:00Z","timestamp":1325116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10601-011-9114-7","type":"journal-article","created":{"date-parts":[[2011,12,28]],"date-time":"2011-12-28T01:11:36Z","timestamp":1325034696000},"page":"87-122","source":"Crossref","is-referenced-by-count":12,"title":["Constraint-based Very Large-Scale Neighborhood search"],"prefix":"10.1007","volume":"17","author":[{"given":"S\u00e9bastien","family":"Mouthuy","sequence":"first","affiliation":[]},{"given":"Pascal Van","family":"Hentenryck","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,29]]},"reference":[{"key":"9114_CR1","unstructured":"Abdullah, S., Ahmadi, S., Burke, E., & Dror, M. (2004). Applying ahuja-orlin\u2019s large neighborhood for constructing examination timetabling solution. In Proceedings of the 5th international conference on the practice and theory of automated timetabling, no. 3616 in lecture notes in computer science (pp. 413\u2013420). Springer."},{"key":"9114_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s00291-006-0034-7","volume":"29","author":"S Abdullah","year":"2007","unstructured":"Abdullah, S., Ahmadi, S., Burke, E., & Dror, M. (2007). Investigating ahuja-orlin\u2019s large neighbourhood search approach for examination timetabling. OR Spectrum, 29, 351\u2013372.","journal-title":"OR Spectrum"},{"key":"9114_CR3","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1057\/palgrave.jors.2602258","volume":"58","author":"S Abdullah","year":"2007","unstructured":"Abdullah, S., Ahmadi, S., Burke, E., Dror, M., & McCollum, B. (2007). A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem. Journal of the Operational Research Society, 58, 1494\u20131502.","journal-title":"Journal of the Operational Research Society"},{"issue":"1-3","key":"9114_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja, R. K., Ergun, \u00d6., Orlin, J. B., & Punnen, A. P. (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1\u20133), 75\u2013102.","journal-title":"Discrete Applied Mathematics"},{"key":"9114_CR5","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications, ed. Prentice Hall, United States (accepted for publication)."},{"key":"9114_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"RK Ahuja","year":"2001","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2001). Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming, 91, 71\u201397.","journal-title":"Mathematical Programming"},{"key":"9114_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-6377(02)00236-5","volume":"31","author":"RK Ahuja","year":"2003","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2003). A composite Very Large-Scale Neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters, 31, 185\u2013194.","journal-title":"Operations Research Letters"},{"key":"9114_CR8","unstructured":"Benoist, T. (2010). Characterization and automation of matching-based neigborhood. In CPAIOR\u201910."},{"key":"9114_CR9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/11496915_32","volume":"3509","author":"A Bompadre","year":"2005","unstructured":"Bompadre, A., & Orlin, J. B. (2005). Using grammars to generate Very Large Scale Neighborhoods for the traveling salesman problem and other sequencing problems. Integer Programming and Combinatorial Optimization, 3509\/2005, 437\u2013451.","journal-title":"Integer Programming and Combinatorial Optimization"},{"key":"9114_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22, 251\u2013256. ACM, ID: 359101.","journal-title":"Communications of the ACM"},{"key":"9114_CR11","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1287\/moor.23.3.613","volume":"23","author":"RE Burkard","year":"1998","unstructured":"Burkard, R. E., Deineko, V. G., & Woeginger, G. J. (1998). The travelling salesman and the pq-tree. Mathematics of Operations Research, 23, 613\u2013623.","journal-title":"Mathematics of Operations Research"},{"key":"9114_CR12","doi-asserted-by":"crossref","unstructured":"Carter, M., & Laporte, G. (1996). Recent developments in practical examination timetabling. Practice and theory of automated timetabling (pp. 1\u201321).","DOI":"10.1007\/3-540-61794-9_49"},{"key":"9114_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-04918-7_11","volume-title":"Hybrid metaheuristics, Vol. 5818","author":"R Cipriano","year":"2009","unstructured":"Cipriano, R., Gaspero, L., & Dovier, A. (2009). A hybrid solver for large neighborhood search: Mixing gecode and easylocal+\u2009+. In M. J. Blesa, C. Blum, L. Gaspero, A. Roli, M. Sampels, & A. Schaerf (Eds.), Hybrid metaheuristics (Vol. 5818, pp. 141\u2013155). Berlin, Heidelberg: Springer."},{"key":"9114_CR14","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.disopt.2005.10.002","volume":"3","author":"O Ergun","year":"2006","unstructured":"Ergun, O., & Orlin, J. B. (2006). A dynamic programming methodology in Very Large Scale Neighborhood search applied to the traveling salesman problem. Discrete Optimization, 3, 78\u201385.","journal-title":"Discrete Optimization"},{"key":"9114_CR15","unstructured":"Ergun, O., Orlin, J. B., & Steele-Feldman, A. (2002). Creating Very Large Scale Neighborhoods out of smaller ones by compounding moves: A study on the vehicle routing problem. Tech. Rep. 4393-02, MIT Sloan School of Management."},{"issue":"3","key":"9114_CR16","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","volume":"5","author":"LR Esau","year":"1966","unstructured":"Esau, L. R., & Williams, K. C. (1966). On teleprocessing system design: Part II a method for approximating the optimal network. IBM Systems Journal, 5(3), 142\u2013147.","journal-title":"IBM Systems Journal"},{"key":"9114_CR17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F. (1996). Ejection chains with combinatorial leverage for the tsp. Discrete Applied Mathematics, 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"9114_CR18","unstructured":"Hentenryck, P. V., & Michel, L. (2005). Constraint-Based Local Search. MIT Press."},{"issue":"1","key":"9114_CR19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.20195","volume":"51","author":"KC Jha","year":"2008","unstructured":"Jha, K. C., Ahuja, R. K., & \u015eahin, G. (2008). New approaches for solving the block-to-train assignment problem. Networks, 51(1), 48\u201362.","journal-title":"Networks"},{"key":"9114_CR20","doi-asserted-by":"crossref","unstructured":"Merlot, L., Boland, N., Hughes, B., & Stuckey, P. (2003). A hybrid algorithm for the examination timetabling problem. Practice and theory of automated timetabling IV (pp. 207\u2013231).","DOI":"10.1007\/978-3-540-45157-0_14"},{"key":"9114_CR21","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/978-3-540-30201-8_35","volume-title":"Principles and practice of Constraint Programming\u2014CP 2004, Vol. 3258","author":"L Perron","year":"2004","unstructured":"Perron, L., Shaw, P., & Furnon, V. (2004). Propagation guided large neighborhood search. In M. Wallace (Ed.), Principles and practice of Constraint Programming\u2014CP 2004 (Vol. 3258, pp. 468\u2013481). Berlin, Heidelberg: Springer."},{"key":"9114_CR22","unstructured":"Solnon, C. (2000). Solving permutation constraint satisfaction problems with artificial ants. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI\u20192000) (pp. 118\u2013122). Berlin."},{"key":"9114_CR23","unstructured":"Thompson, P. M. (1988). Local search algorithms for vehicle routing and other combinatorial problems. Ph.D. thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science."},{"key":"9114_CR24","unstructured":"Thompson, P. M., & Orlin, J. B. (1989). The theory of cyclic transfers. Tech. Rep. OR 200-89, Massachusetts Institute of Technology, Operations Research Center."},{"key":"9114_CR25","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"PM Thompson","year":"1993","unstructured":"Thompson, P. M., & Psaraftis, H. N. (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research, 41, 935\u2013946.","journal-title":"Operations Research"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-011-9114-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-011-9114-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-011-9114-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T14:10:35Z","timestamp":1561126235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-011-9114-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,29]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9114"],"URL":"https:\/\/doi.org\/10.1007\/s10601-011-9114-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,29]]}}}