{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:43:31Z","timestamp":1743054211090,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886358"},{"type":"electronic","value":"9783540886365"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88636-5_64","type":"book-chapter","created":{"date-parts":[[2008,10,16]],"date-time":"2008-10-16T22:19:04Z","timestamp":1224195544000},"page":"675-685","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Simulated Annealing Algorithm for Feasible Solutions of Course Timetabling"],"prefix":"10.1007","author":[{"given":"Juan","family":"Frausto-Sol\u00eds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Alonso-Pecina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaime","family":"Mora-Vargas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Rossi-Doria, O., Sampels, M., Biratrari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowles, J., Manfrin, M., Mastrolilli, L., Paetcher, B., Paquete, L., St\u00fctzle, T.: A comparison of the performance of different metaheuristic on the timetabling problem. Napier University, Universit\u00e9 Libre de Bruxelles, Technische Universitaet Darmstadt (2002)","DOI":"10.1007\/978-3-540-45157-0_22"},{"key":"64_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., Sampels, M.: A MAX-MIN Ant System for the University Timetabling Problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"64_CR3","unstructured":"Krzysztof, S.: MAX-MIN Ant Systems for International Timetabling Competition. International Timetabling Competition, March 31 (2003)"},{"key":"64_CR4","unstructured":"Bykov, Y.: The Description of the Algorithm for International Timetabling Competition. Timetabling Competition, University of Nottingham, School of Computer Science & IT, Wollaton Road, Nottingham NG8 1BB, UK"},{"key":"64_CR5","unstructured":"Halvard Arntzen, Arne Lokketangen. A local search heuristic for a university timetabling problem, March 31 (2003)"},{"issue":"11","key":"64_CR6","first-page":"2849","volume":"5","author":"J. Frausto-Solis","year":"2006","unstructured":"Frausto-Solis, J., Alonso-Pecina, F., Larre, M., Gonzalez-Segura., C., Gomez-Ramos, J.L.: Solving the Timetabling Problem with three heuristics. WSEAS Transactions on Computers\u00a05(11), 2849\u20132855 (2006)","journal-title":"WSEAS Transactions on Computers"},{"key":"64_CR7","unstructured":"Lewis, R.: (June 2007), \n                    \n                      http:\/\/www.emergentcomputing.org\/timetabling\/harderinstances"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31996-2_14","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"R. Lewis","year":"2005","unstructured":"Lewis, R., Paechter, B.: Application of the Grouping Genetic Algorithm to University Course Timetabling. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol.\u00a03448. Springer, Heidelberg (2005)"},{"key":"64_CR9","unstructured":"Lewis, R., Paechter, B.: Finding Feasible Timetables using Group-Based Operators. Technical Report NUS-2005-01, Centre for Emergent Computing, Edinburgh, Scotland 2005. IEEE Transactions on Evolutionary Computation (2005) (accepted for publication)"},{"key":"64_CR10","unstructured":"International Timetabling Competition, Consultant date: Wednesday (June 2007), \n                    \n                       http:\/\/www.idsia.ch\/Files\/ttcomp2002\/"},{"key":"64_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11593577_7","volume-title":"Practice and Theory of Automated Timetabling V","author":"P.A. Kostuch","year":"2005","unstructured":"Kostuch, P.A.: The University Course Timetabling Problem with 3-Phase approach. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 251\u2013266. Springer, Heidelberg (2005)"},{"key":"64_CR12","unstructured":"Di Gaspero, L., Schaerf, A.: Timetabling Competition TTComp 2002: Solver Description, March 31 (2003)"},{"key":"64_CR13","unstructured":"Cordeau, J.-F., Jaumard, B., Morales, R.: Efficient Timetabling Solution with Tabu Search, March 31 (2003)"},{"key":"64_CR14","unstructured":"Di Gaspero, L., Schaerf, A.: Timetabling Competition TTComp 2002: Solver Description, March 31 (2003)"},{"key":"64_CR15","unstructured":"Caballero, S.A.: Desarrollo y aplicaci\u00f3n de un algoritmo h\u00edbrido de c\u00f3mputo evolutivo y Recocido Simulado para la soluci\u00f3n de problemas de Timetabling (The development and application of a hybrid algorithm of Evolutionary Computation and Simulated Annealing for the solution of problems of Timetabling) Master Thesis, ITESM Campus Estado de M\u00e9xico (July 2007)"},{"key":"64_CR16","unstructured":"Frausto-Solis, Federico, A.-P.: Analytically Tuned Parameters of Simulated Annealing for the Timetabling Problem. In: WSEAS International Conferences Puerto De La Cruz, Tenerife, Canary Islands, Spain, December 14-16 (2007)"},{"key":"64_CR17","doi-asserted-by":"crossref","unstructured":"Sanvicente-Sanchez, H., Frausto Sol\u00eds, J.: Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms, M\u00e9xico (2003)","DOI":"10.1007\/978-3-540-24767-8_80"},{"key":"64_CR18","volume-title":"Simulated annealing and Boltzmann machines : a stochastic approach to combinatorial optimization and neural computing. hichester [England]","author":"E. Aarts","year":"1989","unstructured":"Aarts, E., Korst, J.: Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. hichester [England]. Wiley, New York (1989)"},{"key":"64_CR19","unstructured":"Frausto-Solis, J., Alonso-Pecina, F.: FRALONSO: A Hybrid Simulated Annealing-Tabu Search Algorithm for Post Enrolment Course Timetabling. In: PATAT Conferences 2008, Montreal Canada (accepted, 2008)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2008: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88636-5_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:35:48Z","timestamp":1558265748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88636-5_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886358","9783540886365"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88636-5_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}