{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:28:55Z","timestamp":1744903735801,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493809"},{"type":"electronic","value":"9783662493816"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49381-6_38","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:24:06Z","timestamp":1457375046000},"page":"399-409","source":"Crossref","is-referenced-by-count":3,"title":["How to Generate Benchmarks for Rich Routing Problems?"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Cwiek","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Nalepa","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Dublanski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"38_CR1","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"Jakub Nalepa","year":"2015","unstructured":"Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. 1\u201319 (2015). doi:10.1007\/s00500-015-1642-4","journal-title":"Soft Computing"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Kalina, P., Vokrinek, J.: Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation. In: Proceedings of IEEE SMC, pp. 1558\u20131563 (2012)","DOI":"10.1109\/ICSMC.2012.6377958"},{"issue":"03","key":"38_CR3","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1142\/S0218213002000988","volume":"11","author":"HC Lau","year":"2002","unstructured":"Lau, H.C., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. Int. J. Artif. Intell. Tools 11(03), 455\u2013472 (2002)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Laporte, G., Savelsbergh, M.W., Vigo, D.: Chapter 6 vehicle routing. In: Barnhart, C., Laporte, G. (eds.) Transportation. Handbooks in Operations Research and Management Science, vol. 14, pp. 367\u2013428. Elsevier (2007)","DOI":"10.1016\/S0927-0507(06)14006-2"},{"issue":"2","key":"38_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","volume":"36","author":"JF Bard","year":"2002","unstructured":"Bard, J.F., Kontoravdis, G., Yu, G.: A branch-and-cut procedure for the vehicle routing problem with time windows. Trans. Sci. 36(2), 250\u2013269 (2002)","journal-title":"Trans. Sci."},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4), 258\u2013272 (2007)","journal-title":"Networks"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.cie.2014.08.011","volume":"76","author":"KS Abdallah","year":"2014","unstructured":"Abdallah, K.S., Jang, J.: An exact solution for vehicle routing problems with semi-hard resource constraints. Comp. Ind. Eng. 76, 366\u2013377 (2014)","journal-title":"Comp. Ind. Eng."},{"issue":"2","key":"38_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s12532-014-0064-0","volume":"6","author":"A Bettinelli","year":"2014","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2), 171\u2013197 (2014)","journal-title":"Math. Program. Comput."},{"issue":"10","key":"38_CR9","doi-asserted-by":"publisher","first-page":"2972","DOI":"10.1016\/j.cor.2005.02.029","volume":"33","author":"A Chabrier","year":"2006","unstructured":"Chabrier, A.: Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10), 2972\u20132990 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"38_CR10","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1269\u20131283 (2011)","journal-title":"Oper. Res."},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-45193-8_9","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"R Bent","year":"2003","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 123\u2013137. Springer, Heidelberg (2003)"},{"issue":"1","key":"38_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Journal fur Betriebswirtschaft 58(1), 21\u201351 (2008)","journal-title":"Journal fur Betriebswirtschaft"},{"issue":"2","key":"38_CR13","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.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. 34(2), 107\u2013121 (2000)","journal-title":"Transp. Res."},{"issue":"4","key":"38_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-12139-5_18","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 202\u2013213. Springer, Heidelberg (2010)"},{"issue":"5","key":"38_CR16","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/s10766-014-0343-4","volume":"43","author":"J Nalepa","year":"2015","unstructured":"Nalepa, J., Blocho, M.: Co-operation in the parallel memetic algorithm. Int. J. Parallel Program. 43(5), 812\u2013839 (2015)","journal-title":"Int. J. Parallel Program."},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.cor.2015.04.002","volume":"62","author":"M Cherkesly","year":"2015","unstructured":"Cherkesly, M., Desaulniers, G., Laporte, G.: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62, 23\u201335 (2015)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49381-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:46:36Z","timestamp":1720788396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49381-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493809","9783662493816"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49381-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}