{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:22:02Z","timestamp":1759666922209},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,24]],"date-time":"2013-04-24T00:00:00Z","timestamp":1366761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10732-013-9219-9","type":"journal-article","created":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T08:24:56Z","timestamp":1366705496000},"page":"465-495","source":"Crossref","is-referenced-by-count":6,"title":["The consultation timetabling problem at Danish high schools"],"prefix":"10.1007","volume":"19","author":[{"given":"Simon","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael B.","family":"Herold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas R.","family":"Stidsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,24]]},"reference":[{"key":"9219_CR1","unstructured":"Adenso-Diaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental designs and local search. Oper. Res. 54(1), 99\u2013114 (2006)"},{"key":"9219_CR2","unstructured":"Azi, N., Gendreau, M., Potvin, J.Y.: An adaptive large neighborhood search for a vehicle routing problem with multiple trips. Technical report, CIRRELT (2010)"},{"key":"9219_CR3","doi-asserted-by":"crossref","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T.: Improvement strategies for the f-race algorithm: sampling design and iterative refinement. In: Proceedings of the 4th International Conference on Hybrid Metaheuristics, HM\u201907, pp. 108\u2013122. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-75514-2_9"},{"key":"9219_CR4","doi-asserted-by":"crossref","unstructured":"Becker, S., Gottlieb, J., St\u00fctzle, T.: Applications of racing algorithms: an industrial perspective. In: Talbi, E.G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) Artificial Evolution. Lecture Notes in Computer Science, vol. 3871, pp. 271\u2013283. Springer, Berlin (2006)","DOI":"10.1007\/11740698_24"},{"key":"9219_CR5","unstructured":"Birattari, M.: The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective, vol. 292: Dissertations in Artificial Intelligence\u2014Infix, 1st edn. Springer, Berlin (2005)"},{"key":"9219_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10951-008-0088-2","volume":"12","author":"T Birbas","year":"2009","unstructured":"Birbas, T., Daskalaki, S., Housos, E.: School timetabling for quality student and teacher schedules. J. Sched. 12, 177\u2013197 (2009)","journal-title":"J. Sched."},{"issue":"2","key":"9219_CR7","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E Burke","year":"2002","unstructured":"Burke, E., Petrovic, S.: Recent research directions in automated timetabling. Eur. J. Oper. Res. 140(2), 266\u2013280 (2002). doi: 10.1016\/S0377-2217(02)00069-3","journal-title":"Eur. J. Oper. Res."},{"key":"9219_CR8","doi-asserted-by":"crossref","unstructured":"Carter, M., Laporte, G.: Recent developments in practical course timetabling. In: Burke, E., Carter, M. (eds.) Practice and Theory of Automated Timetabling II. Lecture Notes in Computer Science, vol. 1408, pp. 3\u201319. Springer, Berlin (1998)","DOI":"10.1007\/BFb0055878"},{"key":"9219_CR9","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M Chiarandini","year":"2006","unstructured":"Chiarandini, M., Birattari, M., Socha, K., Rossi-Doria, O.: An effective hybrid algorithm for university course timetabling. J. Sched. 9, 403\u2013432 (2006)","journal-title":"J. Sched."},{"key":"9219_CR10","doi-asserted-by":"crossref","unstructured":"de Haan, P., Landman, R., Post, G., Ruizenaar, H.: A case study for timetabling in a dutch secondary school. In: Burke, E., Rudova, H. (eds.) Practice and Theory of Automated Timetabling VI. Lecture Notes in Computer Science, vol. 3867, pp. 267\u2013279. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-77345-0_17"},{"key":"9219_CR11","doi-asserted-by":"crossref","unstructured":"Diao, Y., Eskesen, F., Froehlich, S., Hellerstein, J., Spainhower, L., Surendra, M.: Generic online optimization of multiple configuration parameters with application to a database server. In: Brunner, M., Keller, A. (eds.) Self-Managing Distributed Systems. Lecture Notes in Computer Science, vol. 2867, pp. 79\u201393. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-39671-0_2"},{"key":"9219_CR12","doi-asserted-by":"crossref","unstructured":"Erben, W., Keppler, J.: A genetic algorithm solving a weekly course-timetabling problem. In: Burke, E., Ross, P. (eds.) Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, vol. 1153, pp. 198\u2013211. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61794-9_60"},{"key":"9219_CR13","first-page":"267","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: an automatic algorithm configuration framework. J. Artif. Int. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Int. Res."},{"key":"9219_CR14","unstructured":"Kristiansen, S., Stidsen, T.R.: Adaptive large neighborhood search for student sectioning at danish high schools. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT, 2012) (2012)"},{"issue":"3","key":"9219_CR15","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.ejor.2011.06.039","volume":"215","author":"S Kristiansen","year":"2011","unstructured":"Kristiansen, S., S\u00f8rensen, M., Stidsen, T.R.: Elective course planning. Eur. J. Oper. Res. 215(3), 713\u2013720 (2011). doi: 10.1016\/j.ejor.2011.06.039","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9219_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/trsc.1090.0290","volume":"44","author":"G Laporte","year":"2010","unstructured":"Laporte, G., Musmanno, R., Vocaturo, F.: An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transp. Sci. 44(1), 125\u2013135 (2010)","journal-title":"Transp. Sci."},{"issue":"12","key":"9219_CR17","doi-asserted-by":"crossref","first-page":"1775","DOI":"10.1016\/j.cor.2011.02.007","volume":"38","author":"H Lei","year":"2011","unstructured":"Lei, H., Laporte, G., Guo, B.: The capacitated vehicle routing problem with stochastic demands and time windows. Comput. Oper. Res. 38(12), 1775\u20131783 (2011). doi: 10.1016\/j.cor.2011.02.007","journal-title":"Comput. Oper. Res."},{"key":"9219_CR18","unstructured":"McCollum, B.: University timetabling: bridging the gap between research and practice. In: Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling, pp. 15\u201335. Springer, Berlin (2006)"},{"key":"9219_CR19","unstructured":"Mittelman, H.: Benchmarks for optimization software. http:\/\/plato.asu.edu\/bench.html (2012)"},{"key":"9219_CR20","doi-asserted-by":"crossref","unstructured":"Montero, E., Riff, M.C., Neveu, B.: An evaluation of off-line calibration techniques for evolutionary algorithms. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201910, pp. 299\u2013300. ACM, New York (2010). doi: 10.1145\/1830483.1830540","DOI":"10.1145\/1830483.1830540"},{"key":"9219_CR21","unstructured":"Muller, L.: An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In: MIC 2009: The VIII Metaheuristics International Conference (2009)"},{"key":"9219_CR22","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10479-010-0735-9","volume":"181","author":"T M\u00fcller","year":"2010","unstructured":"M\u00fcller, T., Murray, K.: Comprehensive approach to student sectioning. Ann. Oper. Res. 181, 249\u2013269 (2010)","journal-title":"Ann. Oper. Res."},{"key":"9219_CR23","unstructured":"Muller, L.F., Spoorendonk, S.: A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem. Tech. Report, DTU Management Engineering (2010)"},{"issue":"3","key":"9219_CR24","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.ejor.2011.11.036","volume":"218","author":"L Muller","year":"2011","unstructured":"Muller, L., Spoorendonk, S., Pisinger, D.: A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. Eur. J. Oper. Res. 218(3), 614\u2013623 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9219_CR25","doi-asserted-by":"crossref","unstructured":"Pellegrini, P., Birattari, M.: Implementation effort and performance. In: SLS 2007, pp. 31\u201345. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74446-7_3"},{"key":"9219_CR26","doi-asserted-by":"crossref","unstructured":"Pellegrini, P., St\u00fctzle, T., Birattari , M.: Off-line vs On-line Tuning: A Study on Max\u2013Min Ant System for the TSP. In: Swarm Intelligence. Lecture Notes in Computer Science, vol. 6234, pp. 239\u2013250. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15461-4_21"},{"key":"9219_CR27","unstructured":"Pillay, N.: An overview of school timetabling research. In: Proceedings of the International Conference on the Theory and Practice of Automated Timetabling, pp. 321\u2013335, Belfast (2010)"},{"key":"9219_CR28","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403\u20132435 (2005)","journal-title":"Comput. Oper. Res."},{"key":"9219_CR29","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp 399\u2013419. Springer, Berlin (2010)","DOI":"10.1007\/978-1-4419-1665-5_13"},{"issue":"3","key":"9219_CR30","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"JY Potvin","year":"1993","unstructured":"Potvin, J.Y., Rousseau, J.M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66(3), 331\u2013340 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9219_CR31","doi-asserted-by":"crossref","unstructured":"Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.M.: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4), 190\u2013204 (2009). doi: 10.1002\/net.20332","DOI":"10.1002\/net.20332"},{"issue":"3","key":"9219_CR32","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G.M., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3), 728\u2013735 (2012). doi: 10.1016\/j.cor.2011.05.005","journal-title":"Comput. Oper. Res."},{"key":"9219_CR33","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"9219_CR34","doi-asserted-by":"crossref","unstructured":"Santos, H., Uchoa, E., Ochi, L., Maculan, N.: Strong bounds with cut and column generation for class-teacher timetabling. Ann. Oper. Res. 194, 399\u2013412 (2010). doi: 10.1007\/s10479-010-0709-y","DOI":"10.1007\/s10479-010-0709-y"},{"key":"9219_CR35","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13, 87\u2013127 (1999). doi: 10.1023\/A:1006576209967","journal-title":"Artif. Intell. Rev."},{"key":"9219_CR36","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Working Paper, University of Strathclyde, Glasgow (1997)"},{"key":"9219_CR37","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.F. (eds.) Principles and Practice of Constraint Programming-CP98. Lecture Notes in Computer Science, vol. 1520, pp. 417\u2013431. Springer, Berlin (1998)","DOI":"10.1007\/3-540-49481-2_30"},{"key":"9219_CR38","unstructured":"S\u00f8rensen, M., Stidsen, T.R.: High school timetabling: modeling and solving a large number of cases in denmark. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT, 2012) (2012)"},{"issue":"12","key":"9219_CR39","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1287\/mnsc.30.12.1473","volume":"30","author":"A Tripathy","year":"1984","unstructured":"Tripathy, A.: School timetabling\u2014a case in large binary integer linear programming. Manag. Sci. 30(12), 1473\u20131489 (1984)","journal-title":"Manag. Sci."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9219-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9219-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9219-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T23:24:52Z","timestamp":1562973892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9219-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,24]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9219"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9219-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,24]]}}}