{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:29:41Z","timestamp":1760596181320},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540307051"},{"type":"electronic","value":"9783540324218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593577_17","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T02:32:45Z","timestamp":1131157965000},"page":"294-312","source":"Crossref","is-referenced-by-count":30,"title":["A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem"],"prefix":"10.1007","author":[{"given":"Pascal","family":"C\u00f4t\u00e9","sequence":"first","affiliation":[]},{"given":"Tony","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Sabourin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11593577_19","volume-title":"Practice and Theory of Automated Timetabling V","author":"H. Asmuni","year":"2005","unstructured":"Asmuni, H., Burke, E.K., Garibaldi, J.M.: Fuzzy Multiple Ordering Criteria for Examination Timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 51\u201365. Springer, Heidelberg (2005)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-44629-X_8","volume-title":"Practice and Theory of Automated Timetabling III","author":"E. Burke","year":"2001","unstructured":"Burke, E., Bykov, Y., Petrovic, S.: A Multicriteria Approach to Examination Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 118\u2013131. Springer, Heidelberg (2001)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-45157-0_13","volume-title":"Practice and Theory of Automated Timetabling IV","author":"E. Burke","year":"2003","unstructured":"Burke, E., Newall, J.: Enhancing Timetable Solutions with Local Search Methods. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 195\u2013206. Springer, Heidelberg (2003)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume-title":"Practice and Theory of Automated Timetabling","author":"E. Burke","year":"1996","unstructured":"Burke, E., Newall, J., Weare, R.: Memetic Algorithm for University Exam Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 241\u2013250. Springer, Heidelberg (1996)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44691-5_20","volume-title":"Algorithm Engineering","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Dell\u2019Olmo, P., Italiano, G.: New Algorithms for Examination Timetabling. In: N\u00e4her, S., Wagner, D. (eds.) WAE 2000. LNCS, vol.\u00a01982, pp. 230\u2013241. Springer, Heidelberg (2001)"},{"key":"17_CR6","unstructured":"Carter, M.W., Laporte, G., Yan Lee, S.: J. Oper. Res. Soc. 47, 373\u2013383 (1996)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-45157-0_15","volume-title":"Practice and Theory of Automated Timetabling IV","author":"S. Casey","year":"2003","unstructured":"Casey, S., Thompson, J.: Grasping the Examination Scheduling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 232\u2013244. Springer, Heidelberg (2003)"},{"key":"17_CR8","unstructured":"Deb, K.A.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Hoboken (2001)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-45157-0_17","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L. Gaspero Di","year":"2003","unstructured":"Di Gaspero, L.: Recolor, Shake and Kick: A Recipe for the Examination Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 404\u2013407. Springer, Heidelberg (2003)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Practice and Theory of Automated Timetabling III","author":"L. Gaspero Di","year":"2001","unstructured":"Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 104\u2013117. Springer, Heidelberg (2001)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck, G.: New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel. J. Comput. Phys.\u00a0104, 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy Randomized Adaptive Search Procedures. J. Global Optim. 6, 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/3468.650319","volume":"28","author":"C. Fonseca","year":"1998","unstructured":"Fonseca, C., Fleming, P.: Multiobjective Optimization and Multiple Constraint Handling with Evolutionary Algorithms. I: A Unified Formulation. IEEE Trans. on Systems, Man and Cybernetics, Part A (Systems and Humans) 28, 26\u201337 (1998)","journal-title":"IEEE Trans. on Systems, Man and Cybernetics, Part A (Systems and Humans)"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: Tabu Search Heuristic for the Vehicle Routing Problem. Manage. Sci. 40, 1276\u20131290 (1994)","journal-title":"Manage. Sci."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L. Merlot","year":"2003","unstructured":"Merlot, L., Boland, N., Hughes, B., Stuckey, P.: A Hybrid Algorithm for the Examination Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 207\u2013231. Springer, Heidelberg (2003)"},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"17_CR17","unstructured":"Morgenstern, C., Shapiro, H.: Coloration Neighborhood Structures for General Graph Coloring. In: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, San Francisco. Society for Industrial and Applied Mathematics, pp. 226\u2013235 (1990)"},{"key":"17_CR18","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC2000)","author":"A. Osyczka","year":"2000","unstructured":"Osyczka, A., Krenich, S.: New Constraint Tournament Selection Method for Multicriteria Optimization Using Genetic Algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC2000), vol.\u00a01. IEEE, Piscataway (2000)"},{"key":"17_CR19","unstructured":"Paquete, L., Fonseca, C.: A Study of Examination Timetabling with Multiobjective Evolutionary Algorithms. In: 4th Metaheuristics International Conference (MIC 2001), Porto, pp. 149\u2013154 (2001)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","first-page":"413","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L. Paquete","year":"2003","unstructured":"Paquete, L., Stutzle, T.: Empirical Analysis of Tabu Search for the Lexicographic Optimization of the Examination Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 413\u2013420. Springer, Heidelberg (2003)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","first-page":"179","volume-title":"Practice and Theory of Automated Timetabling IV","author":"S. Petrovic","year":"2003","unstructured":"Petrovic, S., Bykov, Y.: A Multiobjective Optimization Technique for Exam Timetabling Based on Trajectories. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 179\u2013192. Springer, Heidelberg (2003)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Evolutionary Computing","author":"N.J. Radcliffe","year":"1994","unstructured":"Radcliffe, N.J., Surry, P.D.: Formal Memetic Algorithms. In: Fogarty, T.C. (ed.) AISB-WS 1994. LNCS, vol.\u00a0865, pp. 1\u201316. Springer, Heidelberg (1994)"},{"key":"17_CR23","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-17144-4_4","volume-title":"MetaHeuristics for Multiobjective Optimisation","author":"J.D. Silva Linda","year":"2004","unstructured":"Silva Linda, J.D., Burke, E.K., Petrovic, S.: An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling. In: Gandibleux, X., Sevaux, M., Sorensen, K., T\u2019Kindt, V. (eds.) MetaHeuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0535, pp. 91\u2013129. Springer, Berlin (2004)"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"J.M. Thompson","year":"1998","unstructured":"Thompson, J.M., Dowsland, K.A.: Robust Simulated Annealing Based Examination Timetabling System. Comput. Oper. Res.\u00a025, 637\u2013648 (1998)","journal-title":"Comput. Oper. Res."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-44629-X_6","volume-title":"Practice and Theory of Automated Timetabling III","author":"G. White","year":"2001","unstructured":"White, G., Xie, B.: Examination Timetables and Tabu Search with Longer-Term Memory. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 85\u2013103. Springer, Heidelberg (2001)"},{"key":"17_CR26","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: Spea2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In: Evolutionary Methods for Design Optimisation and Control, Barcelona, Spain, CIMNE, pp. 95\u2013100 (2002)"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593577_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:51:55Z","timestamp":1619491915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11593577_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}