{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:23:23Z","timestamp":1761895403728},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003878"},{"type":"electronic","value":"9783642555374"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-642-55537-4_24","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T15:12:30Z","timestamp":1323961950000},"page":"150-155","source":"Crossref","is-referenced-by-count":4,"title":["A Combined Approach to Solve the Pickup and Delivery Selection Problem"],"prefix":"10.1007","author":[{"given":"J\u00f6rn","family":"Sch\u00f6nberger","sequence":"first","affiliation":[]},{"given":"Herbert","family":"Kopfer","sequence":"additional","affiliation":[]},{"given":"Dirk C.","family":"Mattfeld","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Institute of Physics Publishing","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034349","volume-title":"Evolutionary Computation 1 Basic Algorithms and Operators","author":"T B\u00e4ck","year":"2000","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (2000) Evolutionary Computation 1 Basic Algorithms and Operators, Institute of Physics Publishing"},{"key":"24_CR2","first-page":"310","volume-title":"On Permutation Representations for Scheduling Problems, Proc","author":"C Bierwirth","year":"1996","unstructured":"Bierwirth, C., Mattfeld, D.C., Kopfer, H. (1996) On Permutation Representations for Scheduling Problems, Proc. of PPSN IV, Springer, 310\u2013318"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"SE Butt","year":"1999","unstructured":"Butt, S.E., Ryan, D.M. (1999) An optimal Solution procedure for the multiple tour maximum collect ion problem using column generation, Computer & Operations Research 26, 427\u2013441","journal-title":"Computer & Operations Research"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., Soumis, F. (1991) The pickup and delivery problem with time windows, European Journal of Operational Research 54, 7\u201322","journal-title":"European Journal of Operational Research"},{"key":"24_CR5","volume-title":"Traveling Salesman problems with profits: an overview","author":"D Feillet","year":"2001","unstructured":"Feillet, D. (2001) Traveling Salesman problems with profits: an overview, Proceedings of OPR3, Paris"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., Martello, S. (1990) The Selective Travelling Salesman Problem, Discrete Applied Mathematics 26, 193\u2013207","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry, W.P., Barnes, J.W. (2000) Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B 34,107\u2013121","journal-title":"Transportation Research Part B"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MWP Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M. (1995) The General Pickup and Delivery Problem, Transportation Science 29, 17\u201329","journal-title":"Transportation Science"},{"key":"24_CR9","volume-title":"The Merchant Subtour Problem","author":"B Verweij","year":"2000","unstructured":"Verweij, B. Aardal, K. (2000) The Merchant Subtour Problem, technical report UU-CS-2000\u201325, Universiteit Utrecht"},{"key":"24_CR10","volume-title":"Model Building in Mathematical Programming","author":"HP Williams","year":"1999","unstructured":"Williams H.P. (1999) Model Building in Mathematical Programming, 4th Edition, Wiley, Chichester","edition":"4"}],"container-title":["Operations Research Proceedings 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55537-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T23:27:03Z","timestamp":1555889223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55537-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540003878","9783642555374"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55537-4_24","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}