{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T17:11:52Z","timestamp":1726333912882},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410185"},{"type":"electronic","value":"9783642410192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41019-2_13","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T11:31:38Z","timestamp":1379503898000},"page":"173-183","source":"Crossref","is-referenced-by-count":7,"title":["An Application of Late Acceptance Hill-Climbing to the Traveling Purchaser Problem"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Goerler","sequence":"first","affiliation":[]},{"given":"Frederik","family":"Schulte","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","first-page":"192","volume":"10","author":"A. Abuhamdah","year":"2010","unstructured":"Abuhamdah, A.: Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems. International Journal of Computer Science and Network Security\u00a010(1), 192\u2013200 (2010)","journal-title":"International Journal of Computer Science and Network Security"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1016\/j.cor.2011.02.021","volume":"38","author":"E. Angelelli","year":"2011","unstructured":"Angelelli, E., Mansini, R., Vindigni, M.: Look-ahead heuristics for the dynamic traveling purchaser problem. Computers & Operations Research\u00a038, 1867\u20131876 (2011)","journal-title":"Computers & Operations Research"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M. Bellmore","year":"1968","unstructured":"Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: A survey. Operations Research\u00a016, 538\u2013558 (1968)","journal-title":"Operations Research"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0305-0548(02)00020-5","volume":"30","author":"F. Boctor","year":"2003","unstructured":"Boctor, F., Laporte, G., Renaud, J.: Heuristics for the traveling purchaser problem. Computers & Operations Research\u00a030, 491\u2013504 (2003)","journal-title":"Computers & Operations Research"},{"unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: Proceedings of the 7th Int. Conf. on the Practice and Theory of Automated Timetabling, PATAT 2008 (2008)","key":"13_CR5"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/978-3-642-33558-7_53","volume-title":"Principles and Practice of Constraint Programming","author":"H. Cambazard","year":"2012","unstructured":"Cambazard, H., Penz, B.: A constraint programming approach for the traveling purchaser problem. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 735\u2013749. Springer, Heidelberg (2012)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.10.027","volume":"199","author":"M.C. Goldbarg","year":"2009","unstructured":"Goldbarg, M.C., Bagi, L.B., Goldbarg, E.F.G.: Transgenetic algorithm for the traveling purchaser problem. European Journal of Operational Research\u00a0199, 36\u201345 (2009)","journal-title":"European Journal of Operational Research"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","volume":"9","author":"B. Golden","year":"1981","unstructured":"Golden, B., Levy, L., Dahl, R.: Two generalizations of the traveling salesman problem. Omega\u00a09, 439\u2013441 (1981)","journal-title":"Omega"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.cor.2010.07.016","volume":"38","author":"L. Gouveia","year":"2011","unstructured":"Gouveia, L., Paias, A., Vo\u00df, S.: Models for a traveling purchaser problem with additional side-constraints. Computers & Operations Research\u00a038, 550\u2013558 (2011)","journal-title":"Computers & Operations Research"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1057\/mel.2009.6","volume":"11","author":"D. Infante","year":"2009","unstructured":"Infante, D., Paletta, G., Vocaturo, F.: A ship-truck intermodal transportation problem. Maritime Economics & Logistics\u00a011, 247\u2013259 (2009)","journal-title":"Maritime Economics & Logistics"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","volume":"10","author":"R.L. Karg","year":"1964","unstructured":"Karg, R.L., Thompson, G.L.: A heuristic approach to solving travelling salesman problems. Management Science\u00a010, 225\u2013248 (1964)","journal-title":"Management Science"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1287\/opre.51.6.940.24921","volume":"51","author":"G. Laporte","year":"2003","unstructured":"Laporte, G., Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.: A branch-and-cut algorithm for the undirected traveling purchaser problem. Operations Research\u00a051, 940\u2013951 (2003)","journal-title":"Operations Research"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0167-6377(82)90041-4","volume":"1","author":"H.L. Ong","year":"1982","unstructured":"Ong, H.L.: Approximate algorithms for the travelling purchaser problem. Operations Research Letters\u00a01, 201\u2013205 (1982)","journal-title":"Operations Research Letters"},{"doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Bykov, Y., Birben, M., Burke, E.K.: Examination timetabling using late acceptance hyper-heuristics. In: IEEE Congress on Evolutionary Computation, CEC 2009, pp. 997\u20131004 (2009)","key":"13_CR14","DOI":"10.1109\/CEC.2009.4983054"},{"key":"13_CR15","first-page":"78","volume":"18","author":"T. Ramesh","year":"1981","unstructured":"Ramesh, T.: Traveling purchaser problem. Opsearch\u00a018, 78\u201391 (1981)","journal-title":"Opsearch"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ejor.2003.10.032","volume":"162","author":"J. Riera-Ledesma","year":"2005","unstructured":"Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.: A heuristic approach for the travelling purchaser problem. European Journal of Operational Research\u00a0162, 142\u2013152 (2005)","journal-title":"European Journal of Operational Research"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-006-0014-y","volume":"144","author":"J. Riera-Ledesma","year":"2006","unstructured":"Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.: Solving the asymmetric traveling purchaser problem. Annals of Operations Research\u00a0144, 83\u201397 (2006)","journal-title":"Annals of Operations Research"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","volume":"97","author":"K.N. Singh","year":"1997","unstructured":"Singh, K.N., van Oudheusden, D.L.: A branch and bound algorithm for the traveling purchaser problem. European Journal of Operational Research\u00a097, 571\u2013579 (1997)","journal-title":"European Journal of Operational Research"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0305-0548(02)00193-4","volume":"31","author":"A. Teeninga","year":"2004","unstructured":"Teeninga, A., Volgenant, A.: Improved heuristics for the traveling purchaser problem. Computers & Operations Research\u00a031, 139\u2013150 (2004)","journal-title":"Computers & Operations Research"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-7908-2362-2_23","volume-title":"Logistik Management","author":"J. Verstichel","year":"2009","unstructured":"Verstichel, J., Berghe, G.: A late acceptance algorithm for the lock scheduling problem. In: Vo\u00df, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 457\u2013478. Physica, Heidelberg (2009)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02125457","volume":"63","author":"S. Vo\u00df","year":"1996","unstructured":"Vo\u00df, S.: Dynamic tabu search strategies for the traveling purchaser problem. Annals of Operations Research\u00a063, 253\u2013275 (1996)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41019-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T01:44:56Z","timestamp":1563932696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41019-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410185","9783642410192"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41019-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}