{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:56:52Z","timestamp":1762444612664,"version":"3.37.3"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P27858-G27"],"award-info":[{"award-number":["P27858-G27"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00291-016-0454-y","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T06:44:30Z","timestamp":1467182670000},"page":"303-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["The multi-vehicle profitable pickup and delivery problem"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0039-4519","authenticated-orcid":false,"given":"Margaretha","family":"Gansterer","sequence":"first","affiliation":[]},{"given":"Murat","family":"K\u00fc\u00e7\u00fcktepe","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"454_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann H, Ewe H, Kopfer H, K\u00fcfer KH (2011) Combinatorial auctions in freight logistics. In: B\u00f6se JW, Hao H, Carlos C, Shi X, Stahlbock R, Voss S (eds) Computational Logistics, Lecture Notes in Computer Science, vol 6971. Springer, Berlin, pp 1\u201317","DOI":"10.1007\/978-3-642-24264-9_1"},{"issue":"45","key":"454_CR2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.dam.2011.12.021","volume":"161","author":"C Archetti","year":"2013","unstructured":"Archetti C, Bianchessi N, Speranza MG (2013) Optimal solutions for routing problems with profits. Discrete Appl Math 161(45):547\u2013557","journal-title":"Discrete Appl Math"},{"issue":"6","key":"454_CR3","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1057\/palgrave.jors.2602603","volume":"60","author":"C Archetti","year":"2009","unstructured":"Archetti C, Feillet D, Hertz A, Speranza MG (2009) The capacitated team orienteering and profitable tour problems. J Oper Res Soc 60(6):831\u2013842","journal-title":"J Oper Res Soc"},{"issue":"1","key":"454_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C Archetti","year":"2007","unstructured":"Archetti C, Hertz A, Speranza MG (2007) Metaheuristics for the team orienteering problem. J Heuristics 13(1):49\u201376","journal-title":"J Heuristics"},{"key":"454_CR5","doi-asserted-by":"crossref","unstructured":"Archetti C, Speranza MG, Vigo D (2014) Vehicle routing problems with profits. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization, Philadelphia, pp 273\u2013297","DOI":"10.1137\/1.9781611973594.ch10"},{"issue":"1","key":"454_CR6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202(1):8\u201315","journal-title":"Eur J Oper Res"},{"issue":"1","key":"454_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. Top 15(1):1\u201331","journal-title":"Top"},{"key":"454_CR8","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1057\/palgrave.jors.2602390","volume":"59","author":"M Bolduc","year":"2008","unstructured":"Bolduc M, Renaud J, Boctor F, Laporte G (2008) A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J Oper Res Soc 59:776\u2013787","journal-title":"J Oper Res Soc"},{"key":"454_CR9","doi-asserted-by":"crossref","unstructured":"Boussier S, Feillet D, Gendreau M (2007) An exact algorithm for team orienteering problems. 4OR 5(3):211\u2013230","DOI":"10.1007\/s10288-006-0009-1"},{"issue":"1","key":"454_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"SE Butt","year":"1994","unstructured":"Butt SE, Cavalier TM (1994) A heuristic for the multiple tour maximum collection problem. Comput Oper Res 21(1):101\u2013111","journal-title":"Comput Oper Res"},{"issue":"3","key":"454_CR11","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I-M Chao","year":"1996","unstructured":"Chao I-M, Golden BL, Wasil EA (1996b) The team orienteering problem. Eur J Oper Res 88(3):464\u2013474","journal-title":"Eur J Oper Res"},{"issue":"6","key":"454_CR12","first-page":"104","volume":"2","author":"A Chbichib","year":"2012","unstructured":"Chbichib A, Mellouli R, Chabchoub H (2012) Profitable vehicle routing problem with multiple trips: Modeling and variable neighborhood descent algorithm. Am J Oper Res 2(6):104\u2013119","journal-title":"Am J Oper Res"},{"issue":"3","key":"454_CR13","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2003.08.067","volume":"165","author":"C-W Chu","year":"2005","unstructured":"Chu C-W (2005) A heuristic algorithm for the truckload and less-than-truckload problem. Eur J Oper Res 165(3):657\u2013667","journal-title":"Eur J Oper Res"},{"issue":"6","key":"454_CR14","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"issue":"3","key":"454_CR15","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.dss.2011.02.018","volume":"51","author":"S Dahl","year":"2011","unstructured":"Dahl S, Derigs U (2011) Cooperative planning in express carrier networks an empirical study on the effectiveness of a real-time decision support system. Decis Support Syst 51(3):620\u2013626","journal-title":"Decis Support Syst"},{"key":"454_CR16","doi-asserted-by":"crossref","unstructured":"Dang DC, Guibadj R, Moukrim A (2011) A pso-based memetic algorithm for the team orienteering problem. In: Di Chio C, Brabazon A, Di Caro GA, Drechsler R, Farooq M, Grahl J, Greenfield G, Prins C, Romero J, Squillero G, Tarantino E, Tettamanzi AGB, Urquhart N, Uyar AS (eds) Applications of Evolutionary Computation, Lecture Notes in Computer Science, vol 6625. Springer, Berlin, pp 471\u2013480","DOI":"10.1007\/978-3-642-20520-0_48"},{"issue":"2","key":"454_CR17","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/trsc.1060.0169","volume":"41","author":"O Ergun","year":"2007","unstructured":"Ergun O, Kuyzu G, Savelsbergh MWP (2007a) Reducing truckload transportation costs through collaboration. Trans Sci 41(2):206\u2013221","journal-title":"Trans Sci"},{"key":"454_CR18","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1016\/j.cor.2005.07.026","volume":"34","author":"O Ergun","year":"2007","unstructured":"Ergun O, Kuyzu G, Savelsbergh MWP (2007b) Shipper collaboration. Comput Oper Res 34:1551\u20131560","journal-title":"Comput Oper Res"},{"issue":"2","key":"454_CR19","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Trans Sci 39(2):188\u2013205","journal-title":"Trans Sci"},{"issue":"9","key":"454_CR20","doi-asserted-by":"crossref","first-page":"2908","DOI":"10.1016\/j.cor.2007.01.007","volume":"35","author":"I Gribkovskaia","year":"2008","unstructured":"Gribkovskaia I, Laporte G, Shyshou A (2008) The single vehicle routing problem with deliveries and selective pickups. Comput Oper Res 35(9):2908\u20132924","journal-title":"Comput Oper Res"},{"key":"454_CR21","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez JAM (2008) Variable neighbourhood search: methods and applications. 4OR 6(4):319\u2013360","DOI":"10.1007\/s10288-008-0089-1"},{"key":"454_CR22","doi-asserted-by":"crossref","unstructured":"Hartl RF, Romauch M (2013) The influence of routing on lateral transhipment. In: Moreno-Daz R, Pichler F, Quesada-Arencibia A (eds) Computer Aided Systems Theory\u2014EUROCAST 2013. Lecture Notes in Computer Science. vol 8111. Springer, Berlin. pp 267\u2013275","DOI":"10.1007\/978-3-642-53856-8_34"},{"issue":"1","key":"454_CR23","first-page":"28","volume":"52","author":"A Hemmati","year":"2014","unstructured":"Hemmati A, Hvattum LM, Fagerholt K, Norstad I (2014) Benchmark suite for industrial and tramp ship routing and scheduling problems. INFOR Inf Syst Oper Res 52(1):28\u201338","journal-title":"INFOR Inf Syst Oper Res"},{"key":"454_CR24","unstructured":"Hu B, Raidl G (2006) Variable neighborhood descent with self-adaptive neighborhood-ordering. In: Cotta C, Fernandez AJ, Gallardo JE (eds) Proceedings of the 7th EU\/Meeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics, Malaga, Spain"},{"issue":"2","key":"454_CR25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","volume":"206","author":"A Ili\u0107","year":"2010","unstructured":"Ili\u0107 A, Uro\u0161evi\u0107 D, Brimberg J, Mladenovi\u0107 N (2010) A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res 206(2):289\u2013300","journal-title":"Eur J Oper Res"},{"key":"454_CR26","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.disopt.2014.08.001","volume":"14","author":"MK Jepsen","year":"2014","unstructured":"Jepsen MK, Petersen B, Spoorendonk S, Pisinger D (2014) A branch-and-cut algorithm for the capacitated profitable tour problem. Discrete Optim 14:78\u201396","journal-title":"Discrete Optim"},{"issue":"3","key":"454_CR27","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","volume":"54","author":"L Ke","year":"2008","unstructured":"Ke L, Archetti C, Feng Z (2008) Ants can solve the team orienteering problem. Comput Ind Eng 54(3):648\u2013665","journal-title":"Comput Ind Eng"},{"issue":"2","key":"454_CR28","first-page":"80","volume":"9","author":"CS Ko","year":"2010","unstructured":"Ko CS, Lee HK, Ferdinand FN, Kim T (2010) A genetic algorithm based approach to the profitable tour problem with pick-up and delivery. Ind Eng Manag Syst 9(2):80\u201387","journal-title":"Ind Eng Manag Syst"},{"issue":"3","key":"454_CR29","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00291-005-0031-2","volume":"28","author":"M Krajewska","year":"2006","unstructured":"Krajewska M, Kopfer H (2006) Collaborating freight forwarding enterprises. OR Spectr 28(3):301\u2013317","journal-title":"OR Spectr"},{"key":"454_CR30","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.1057\/palgrave.jors.2602489","volume":"59","author":"M Krajewska","year":"2008","unstructured":"Krajewska M, Kopfer H, Laporte G, Ropke S, Zaccour G (2008) Horizontal cooperation among freight carriers: request allocation and profit sharing. J Oper Res Soc 59:1483\u20131491","journal-title":"J Oper Res Soc"},{"issue":"1","key":"454_CR31","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N Labadie","year":"2012","unstructured":"Labadie N, Mansini R, Melechovsk\u00fd J, Wolfler Calvo R (2012) The team orienteering problem with time windows: an LP-based granular variable neighborhood search. Eur J Oper Res 220(1):15\u201327","journal-title":"Eur J Oper Res"},{"key":"454_CR32","doi-asserted-by":"crossref","unstructured":"Lahyani R, Khemakhem M, Semet F (2013) Heuristics for rich profitable tour problems. In: 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), Hammamet, Tunisia. pp 1\u20133","DOI":"10.1109\/ICMSAO.2013.6552660"},{"issue":"23","key":"454_CR33","doi-asserted-by":"crossref","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 Appl Math 26(23):193\u2013207","journal-title":"Discrete Appl Math"},{"issue":"1","key":"454_CR34","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2015.12.032","volume":"252","author":"Y Li","year":"2016","unstructured":"Li Y, Chen H, Prins C (2016) Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur J Oper Res 252(1):27\u201338","journal-title":"Eur J Oper Res"},{"issue":"2","key":"454_CR35","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.asoc.2012.09.022","volume":"13","author":"S-W Lin","year":"2013","unstructured":"Lin S-W (2013) Solving the team orienteering problem using effective multi-start simulated annealing. Appl Soft Comput 13(2):1064\u20131073","journal-title":"Appl Soft Comput"},{"issue":"1","key":"454_CR36","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ejor.2011.08.024","volume":"217","author":"S-W Lin","year":"2012","unstructured":"Lin S-W, Yu VF (2012) A simulated annealing heuristic for the team orienteering problem with time windows. Eur J Oper Res 217(1):94\u2013107","journal-title":"Eur J Oper Res"},{"issue":"3","key":"454_CR37","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.ejor.2013.08.042","volume":"236","author":"R Masson","year":"2014","unstructured":"Masson R, Ropke S, Lehu\u00e9d\u00e9 F, P\u00e9ton O (2014) A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. Eur J Oper Res 236(3):849\u2013862","journal-title":"Eur J Oper Res"},{"issue":"11","key":"454_CR38","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"1","key":"454_CR39","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.ejor.2012.01.036","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Hanafi S, Ili\u0107 A (2012) A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur J Oper Res 220(1):270\u2013285","journal-title":"Eur J Oper Res"},{"key":"454_CR40","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1016\/j.endm.2010.05.115","volume":"36","author":"VH Nguyen","year":"2010","unstructured":"Nguyen VH, Nguyen TTT (2010) Approximating the asymmetric profitable tour. Electron Notes Discrete Math 36:907\u2013914","journal-title":"Electron Notes Discrete Math"},{"issue":"1","key":"454_CR41","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/trsc.1070.0207","volume":"42","author":"M Nowak","year":"2008","unstructured":"Nowak M, Ergun O, White CC III (2008) Pickup and delivery with split loads. Transp Sci 42(1):32\u201343","journal-title":"Transp Sci"},{"key":"454_CR42","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, D\u00f6rner KF, Hartl RF (2008) A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft 58:21\u201351","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"6","key":"454_CR43","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"Sophie N Parragh","year":"2010","unstructured":"Parragh Sophie N, Doerner Karl F, Hartl Richard F (2010) Variable neighborhood search for the dial-a-ride problem. Comput Oper Res 37(6):1129\u20131138","journal-title":"Comput Oper Res"},{"issue":"9","key":"454_CR44","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1057\/palgrave.jors.2602087","volume":"57","author":"Julie Priv\u00e9","year":"2006","unstructured":"Priv\u00e9 Julie, Renaud Jacques, Boctor Fayez, Laporte Gilbert (2006) Solving a vehicle-routing problem arising in soft-drink distribution. J Oper Res Soc 57(9):1045\u20131052","journal-title":"J Oper Res Soc"},{"issue":"3","key":"454_CR45","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/j.ejor.2011.06.038","volume":"215","author":"HN Psaraftis","year":"2011","unstructured":"Psaraftis HN (2011) A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases. Eur J Oper Res 215(3):572\u2013580","journal-title":"Eur J Oper Res"},{"issue":"3","key":"454_CR46","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s00291-010-0211-6","volume":"32","author":"C Puettmann","year":"2010","unstructured":"Puettmann C, Stadtler H (2010) A collaborative planning approach for intermodal freight transportation. OR Spectr 32(3):809\u2013830","journal-title":"OR Spectr"},{"issue":"2","key":"454_CR47","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ejor.2013.06.011","volume":"232","author":"H Qian","year":"2014","unstructured":"Qian H, Andrew L (2014) An iterative three-component heuristic for the team orienteering problem with time windows. Eur J Oper Res 232(2):276\u2013286","journal-title":"Eur J Oper Res"},{"key":"454_CR48","doi-asserted-by":"crossref","unstructured":"Rainer-Harbach M, Papazek P, Hu B, Raidl GR (2013) Balancing bicycle sharing systems: a variable neighborhood search approach. In: Blum MMC (eds) Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, vol 7832. Springer, Berlin. pp 121\u2013132","DOI":"10.1007\/978-3-642-37198-1_11"},{"issue":"3","key":"454_CR49","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2013.10.038","volume":"235","author":"A Rais","year":"2014","unstructured":"Rais A, Alvelos F, Carvalho MS (2014) New mixed integer-programming model for the pickup-and-delivery problem with transshipment. Eur J Oper Res 235(3):530\u2013539","journal-title":"Eur J Oper Res"},{"issue":"3","key":"454_CR50","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s13676-012-0017-6","volume":"2","author":"Tal Raviv","year":"2013","unstructured":"Raviv Tal, Tzur Michal, Forma. IA (2013) Static repositioning in a bike-sharing system: models and solution approaches. EURO J Transp Logist 2(3):187\u2013229","journal-title":"EURO J Transp Logist"},{"issue":"3","key":"454_CR51","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke S, Cordeau J-F (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transp Sci 43(3):267\u2013286","journal-title":"Transp Sci"},{"key":"454_CR52","unstructured":"Ruijgrok C (2001) European transport: insights and challenges. In: Brewer A, Button KJ, Hensher DA (eds) Handbook of Logistics and Supply Chain Management, Amsterdam. pp 29\u201346"},{"issue":"1","key":"454_CR53","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MWP Savelsbergh","year":"1995","unstructured":"Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transp Sci 29(1):17\u201329","journal-title":"Transp Sci"},{"issue":"4","key":"454_CR54","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/inte.1040.0075","volume":"34","author":"Y Sheffi","year":"2004","unstructured":"Sheffi Y (2004) Combinatorial auctions in the procurement of transportation services. Interfaces 34(4):245\u2013252","journal-title":"Interfaces"},{"issue":"5","key":"454_CR55","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1108\/09600030010336144","volume":"30","author":"T Skjoett-Larsen","year":"2000","unstructured":"Skjoett-Larsen T (2000) European logistics beyond 2000. J Phys Distrib Logist Manag 30(5):377\u2013387","journal-title":"J Phys Distrib Logist Manag"},{"issue":"1","key":"454_CR56","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","volume":"196","author":"W Souffriau","year":"2009","unstructured":"Souffriau W, Vansteenwegen P, Vander Berghe G, van Oudheusden D (2009a) A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196(1):118\u2013127","journal-title":"Eur J Oper Res"},{"issue":"12","key":"454_CR57","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"W Souffriau","year":"2009","unstructured":"Souffriau W, Vansteenwegen P, Vander Berghe G, van Oudheusden D (2009b) Iterated local search for the team orienteering problem with time windows. Comput Oper Res 36(12):3281\u20133290","journal-title":"Comput Oper Res"},{"issue":"11","key":"454_CR58","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","volume":"37","author":"W Souffriau","year":"2010","unstructured":"Souffriau W, Vansteenwegen P, Vander Berghe G, van Oudheusden D (2010) A path relinking approach for the team orienteering problem. Comput Oper Res 37(11):1853\u20131859","journal-title":"Comput Oper Res"},{"issue":"1","key":"454_CR59","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/trsc.1110.0396","volume":"47","author":"Andreas Stenger","year":"2013","unstructured":"Stenger Andreas, Vigo Daniele, Enz Steffen, Schwind Michael (2013) An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transp Sci 47(1):64\u201380","journal-title":"Transp Sci"},{"issue":"6","key":"454_CR60","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang H, Miller-Hooks E (2005) A TABU search heuristic for the team orienteering problem. Comput Oper Res 32(6):1379\u20131407","journal-title":"Comput Oper Res"},{"issue":"11\u201312","key":"454_CR61","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1007\/s00170-005-0014-0","volume":"29","author":"L Tang","year":"2006","unstructured":"Tang L, Wang X (2006) Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. Int J Adv Manuf Technol 29(11\u201312):1246\u20131258","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"454_CR62","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ijpe.2012.06.009","volume":"141","author":"C-K Ting","year":"2013","unstructured":"Ting C-K, Liao X-L (2013) The selective pickup and delivery problem: formulation and a memetic algorithm. Int J Product Econ 141(1):199\u2013211","journal-title":"Int J Product Econ"},{"key":"454_CR63","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia","DOI":"10.1137\/1.9780898718515"},{"key":"454_CR64","doi-asserted-by":"crossref","unstructured":"Tricoire F, Romauch M, Doerner KF, Hartl RF (2013) Addendum to \u201cheuristics for the multi-period orienteering problem with multiple time windows\u201d (Computers & Operations Research 37(2), 351\u2013367). Comput Oper Res 40(5):1516\u20131519","DOI":"10.1016\/j.cor.2012.11.001"},{"key":"454_CR65","doi-asserted-by":"publisher","unstructured":"Vidal T, Maculan N, Vaz Penna PH, Satoru Ochi L (2016) Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transp Sci. doi: 10.1287\/trsc.2015.0584","DOI":"10.1287\/trsc.2015.0584"},{"key":"454_CR66","unstructured":"Voudouris C, Tsang EPK (1996) Partial constraint satisfaction problems and guided local search. In: Proceedings of PACT\u201996 (Practical Application of Constraint Technology), London. pp 337\u2013356"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0454-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-016-0454-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0454-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0454-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:25:16Z","timestamp":1498310716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-016-0454-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["454"],"URL":"https:\/\/doi.org\/10.1007\/s00291-016-0454-y","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2016,6,28]]}}}