{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:43:12Z","timestamp":1774453392783,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642122415","type":"print"},{"value":"9783642122422","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12242-2_44","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T13:12:14Z","timestamp":1270041134000},"page":"431-440","source":"Crossref","is-referenced-by-count":1,"title":["A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves"],"prefix":"10.1007","author":[{"given":"Volkan","family":"\u00c7\u0131nar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Temel","family":"\u00d6ncan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haldun","family":"S\u00fcral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0167-6377(94)90016-7","volume":"16","author":"S.E. Anily","year":"1994","unstructured":"Anily, S.E., Mosheiov, G.: Traveling Salesman Problem with Delivery and Backhauls. Operations Research Letters\u00a016, 11\u201318 (1994)","journal-title":"Operations Research Letters"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1002\/net.10079","volume":"42","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An Exact Algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks\u00a042, 26\u201341 (2004)","journal-title":"Networks"},{"key":"44_CR3","unstructured":"Dongarra, J.J.: Performance of Various Computers Using Standard Linear Equations Software, Technical Report CS-89-85, University of Tennessee CS Dept. (2009)"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","volume":"26","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Vigo, D.: Heuristics for the Traveling Salesman Problem with Pickup and Delivery. Computers and Operations Research\u00a026, 699\u2013714 (1999)","journal-title":"Computers and Operations Research"},{"key":"44_CR5","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"2","key":"44_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/trsc.1030.0086","volume":"38","author":"H. Hern\u00e1ndez-Perez","year":"2004","unstructured":"Hern\u00e1ndez-Perez, H., Salazar-Gonz\u00e1lez, J.-J.: Heuristics for the One-commodity Pickup and Delivery Traveling Salesman Problem. Transportation Science\u00a038(2), 245\u2013255 (2004)","journal-title":"Transportation Science"},{"key":"44_CR7","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell System Technical Journal\u00a044, 2245\u20132269 (1965)","journal-title":"Bell System Technical Journal"},{"key":"44_CR8","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C. Miller","year":"1960","unstructured":"Miller, C., Tucker, A., Zemlin, R.: Integer Programming Formulation of Traveling Salesman Problem Formulations. Journal of the Association for Computing Machinery\u00a07, 326\u2013329 (1960)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"44_CR9","first-page":"215","volume-title":"Genetic Algorithms + Data structures = Evolutions Programs","author":"Z. Michalewicz","year":"1999","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data structures = Evolutions Programs, pp. 215\u2013219. Springer, Heidelberg (1999)"},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-662-04131-4_9","volume-title":"How To Solve It: Modern Heuristics","author":"Z. Michalewicz","year":"2000","unstructured":"Michalewicz, Z., David, F.: How To Solve It: Modern Heuristics, pp. 189\u2013224. Springer, Heidelberg (2000)"},{"key":"44_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","volume":"79","author":"G. Mosheiov","year":"1994","unstructured":"Mosheiov, G.: Traveling Salesman Problem with Pickup and Delivery. European Journal of Operational Research\u00a079, 299\u2013310 (1994)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"44_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/net.10067","volume":"41","author":"H. S\u00fcral","year":"2003","unstructured":"S\u00fcral, H., Bookbinder, J.: The Single-Vehicle Routing Problem with Unrestricted Backhauls. Networks\u00a041(3), 127\u2013136 (2003)","journal-title":"Networks"},{"issue":"1","key":"44_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s11633-009-0097-4","volume":"6","author":"F.-G.. Zhao","year":"2009","unstructured":"Zhao, F.-G., Sun, J.S., Li, S.J., Liu, W.-M.: A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery. International Journal of Automation and Computing\u00a06(1), 97\u2013102 (2009)","journal-title":"International Journal of Automation and Computing"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12242-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T04:37:21Z","timestamp":1552451841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12242-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122415","9783642122422"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12242-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}