{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:02:51Z","timestamp":1725987771593},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319984452"},{"type":"electronic","value":"9783319984469"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98446-9_24","type":"book-chapter","created":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T07:37:47Z","timestamp":1533627467000},"page":"257-267","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Uncapacitated Traveling Purchaser Problem with the MAX\u2013MIN Ant System"],"prefix":"10.1007","author":[{"given":"Rafa\u0142","family":"Skinderowicz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,8]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0305-0548(02)00020-5","volume":"30","author":"FF Boctor","year":"2003","unstructured":"Boctor, F.F., Laporte, G., Renaud, J.: Heuristics for the traveling purchaser problem. Comput. OR 30(4), 491\u2013504 (2003)","journal-title":"Comput. OR"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.cor.2006.03.023","volume":"35","author":"B Bontoux","year":"2008","unstructured":"Bontoux, B., Feillet, D.: Ant colony optimization for the traveling purchaser problem. Comput. OR 35(2), 628\u2013637 (2008)","journal-title":"Comput. OR"},{"key":"24_CR3","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. 7514, pp. 735\u2013749. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_53"},{"key":"24_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.10.027","volume":"199","author":"MC Goldbarg","year":"2009","unstructured":"Goldbarg, M.C., Bagi, L.B., Goldbarg, E.F.G.: Transgenetic algorithm for the traveling purchaser problem. Eur. J. Oper. Res. 199(1), 36\u201345 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"24_CR6","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., Gonz\u00e1lez, J.J.S.: A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper. Res. 51(6), 940\u2013951 (2003)","journal-title":"Oper. Res."},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","volume":"259","author":"D Manerba","year":"2017","unstructured":"Manerba, D., Mansini, R., Riera-Ledesma, J.: The traveling purchaser problem and its variants. Eur. J. Oper. Res. 259(1), 1\u201318 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"24_CR8","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/S0305-0548(98)00032-X","volume":"25","author":"WL Pearn","year":"1998","unstructured":"Pearn, W.L., Chien, R.C.: Improved solutions for the traveling purchaser problem. Comput. OR 25(11), 879\u2013885 (1998)","journal-title":"Comput. OR"},{"issue":"1","key":"24_CR9","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., Gonz\u00e1lez, J.J.S.: A heuristic approach for the travelling purchaser problem. Eur. J. Oper. Res. 162(1), 142\u2013152 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.04.012","volume":"86","author":"R Skinderowicz","year":"2017","unstructured":"Skinderowicz, R.: An improved ant colony system for the sequential ordering problem. Comput. Oper. Res. 86, 1\u201317 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"24_CR11","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN ant system. Fut. Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Fut. Gener. Comput. Syst."},{"issue":"2","key":"24_CR12","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. Ann. Oper. Res. 63(2), 253\u2013275 (1996)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98446-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T19:37:30Z","timestamp":1571686650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98446-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319984452","9783319984469"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98446-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}