{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:16Z","timestamp":1750307716088,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T00:00:00Z","timestamp":1244764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,12]]},"DOI":"10.1145\/1543834.1543885","type":"proceedings-article","created":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T21:59:19Z","timestamp":1245880759000},"page":"381-386","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A simulated annealing algorithm with a new neighborhood structure for the timetabling problem"],"prefix":"10.1145","author":[{"given":"Yongkai","family":"Liu","sequence":"first","affiliation":[{"name":"Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Defu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen C.H.","family":"Leung","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,12]]},"reference":[{"volume-title":"Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling LNCS 1153","year":"1995","author":"Cooper J.H.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Krzysztof Socha Joshua Knowles Michael Sampels. 2002. A MAX-MIN Ant System for the University Course Timetabling Problem. Lecture notes in computer science vol 2463 Berlin: Springer 1--13.   Krzysztof Socha Joshua Knowles Michael Sampels. 2002. A MAX-MIN Ant System for the University Course Timetabling Problem. Lecture notes in computer science vol 2463 Berlin: Springer 1--13.","DOI":"10.1007\/3-540-45724-0_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.08.010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646431.692915"},{"volume-title":"The Fifth Metaheuristics Internetional Conference.","year":"2003","author":"Halvard Arntzen","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Simulated annealing cooling schedules for the school timetabling problem","volume":"16","author":"Abramson D.","year":"1999","journal-title":"Asia--Pacific Journal of Operational Research"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Pasquale Avella Bernardo D'Auria Saverio Salerno Igor Vasil'ev. 2007. A computational study of local search algorithms for Italian high-school timetabling. Springer Science+Business Media LLC.  Pasquale Avella Bernardo D'Auria Saverio Salerno Igor Vasil'ev. 2007. A computational study of local search algorithms for Italian high-school timetabling. Springer Science+Business Media LLC.","DOI":"10.1007\/s10732-007-9025-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593577_7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"ZHANG De-Fu CHEN Sheng-Da LIU Yan-Juan. 2007. An improved heuristic recursive strategy for genetic algorithm of the orthogonal packing of rectangles ACTA AUTOMATICA SINICA 33(9):911--916.  ZHANG De-Fu CHEN Sheng-Da LIU Yan-Juan. 2007. An improved heuristic recursive strategy for genetic algorithm of the orthogonal packing of rectangles ACTA AUTOMATICA SINICA 33(9):911--916.","DOI":"10.1360\/aas-007-0911"},{"key":"e_1_3_2_1_11_1","unstructured":"ZHANG De-Fu Li Xin. 2005. A Personified Annealing Algorithm for Circles Packing Problem ACTA AUTOMATICA SINICA. 31(4):590--595.  ZHANG De-Fu Li Xin. 2005. A Personified Annealing Algorithm for Circles Packing Problem ACTA AUTOMATICA SINICA. 31(4):590--595."},{"key":"e_1_3_2_1_12_1","unstructured":"Lijun Wei Defu Zhang Qingshan Chen. 2008. A least wasted first heuristic algorithm for rectangular packing problem Computers & Operations Research 2008.In press http:\/\/dx.doi.org\/10.1016\/j.cor.  Lijun Wei Defu Zhang Qingshan Chen. 2008. A least wasted first heuristic algorithm for rectangular packing problem Computers & Operations Research 2008.In press http:\/\/dx.doi.org\/10.1016\/j.cor."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2845716.2845723"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/40.9.565"},{"key":"e_1_3_2_1_15_1","unstructured":"http:\/\/prlab.ceid.upatras.gr\/timetabling\/.  http:\/\/prlab.ceid.upatras.gr\/timetabling\/."},{"key":"e_1_3_2_1_16_1","unstructured":"http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/tableinfo.html.  http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/tableinfo.html."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(02)00180-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601495"}],"event":{"name":"GEC '09: GEC '09 - ACM\/SIGEVO Genetic and Evolutionary Computation Summit","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Shanghai China","acronym":"GEC '09"},"container-title":["Proceedings of the first ACM\/SIGEVO Summit on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1543834.1543885","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1543834.1543885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:21Z","timestamp":1750253421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1543834.1543885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,12]]},"references-count":17,"alternative-id":["10.1145\/1543834.1543885","10.1145\/1543834"],"URL":"https:\/\/doi.org\/10.1145\/1543834.1543885","relation":{},"subject":[],"published":{"date-parts":[[2009,6,12]]},"assertion":[{"value":"2009-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}