{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T23:21:37Z","timestamp":1769815297251,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s11036-016-0709-5","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T16:18:14Z","timestamp":1458317894000},"page":"175-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Evolutionary Multiobjective Optimization for the Pickup and Delivery Problem with Time Windows and Demands"],"prefix":"10.1007","volume":"21","author":[{"given":"D\u0169ng H.","family":"Phan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junichi","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,16]]},"reference":[{"key":"709_CR1","unstructured":"Ackerman E (2015) Fetch robotics introduces fetch and freight: your warehouse is now automated. IEEE Spectrum"},{"key":"709_CR2","doi-asserted-by":"crossref","unstructured":"Auger A, Bader J, Brockhoff D, Zitzler E (2009) Theory of the hypervolume indicator: optimal \u03bc-distributions and the choice of the reference point. In: Proceedings of ACM workshop on foundations of genetic algorithms","DOI":"10.1145\/1527125.1527138"},{"issue":"4","key":"709_CR3","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1287\/opre.50.4.582.2864","volume":"50","author":"SF Baker","year":"2002","unstructured":"Baker SF, Morton DP, Rosenthal RE, Williams LM (2002) Optimizing military airlift. Oper Res 50(4):582\u2013 602","journal-title":"Oper Res"},{"issue":"4","key":"709_CR4","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent R, Hentenryck PV (2006) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput Oper Res 33(4):875\u2013893","journal-title":"Comput Oper Res"},{"key":"709_CR5","doi-asserted-by":"crossref","unstructured":"Brockhoff D, Wagner T, Trautmann H (2012) On the properties of the R2 indicator. In: Proceedings of ACM international genetic and evolutionary computation conference","DOI":"10.1145\/2330163.2330230"},{"key":"709_CR6","unstructured":"Brown C (2012) Autonomous vehicle technology in mining. Eng Min J 213(1):30\u201332"},{"issue":"1","key":"709_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/trsc.33.1.3","volume":"33","author":"M Christiansen","year":"1999","unstructured":"Christiansen M (1999) Decomposition of a combined inventory routing and time constrained ship routing problem. Transp Sci 33(1):3\u201316","journal-title":"Transp Sci"},{"key":"709_CR8","doi-asserted-by":"crossref","unstructured":"Creput J-C, Koukam A, Kozlak J, Lukasik J (2004) An evolutionary approach to pickup and delivery problem with time windows. In: Proceedings of international conference on computational science","DOI":"10.1007\/978-3-540-24688-6_142"},{"issue":"1","key":"709_CR9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Hubert J (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"Manag Sci"},{"key":"709_CR10","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2001) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. In: Proceedings of international conference on parallel problem solving from nature","DOI":"10.1007\/3-540-45356-3_83"},{"key":"709_CR11","doi-asserted-by":"crossref","unstructured":"Ding G, Li L, Ju Y (2009) Multi-strategy grouping genetic algorithm for the pickup and delivery problem with time windows. In: Proceedings of ACM international genetic and evolutionary computation conference","DOI":"10.1145\/1543834.1543849"},{"issue":"1","key":"709_CR12","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.eswa.2011.07.022","volume":"39","author":"C D\u2019Souza","year":"2012","unstructured":"D\u2019Souza C, Omkar SN, Senthilnath J (2012) Pickup and delivery problem using metaheuristic techniques. Expert Syst Appl Int J 39(1):328\u2013334","journal-title":"Expert Syst Appl Int J"},{"key":"709_CR13","doi-asserted-by":"crossref","unstructured":"Durillo J, Nebro A, Alba E (2010) The jMetal framework for multi-objective optimization: design and architecture. In: Proceedings of IEEE congress on evolutionary computation","DOI":"10.1109\/CEC.2010.5586354"},{"key":"709_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/1520-6750(198902)36:1<27::AID-NAV3220360103>3.0.CO;2-0","volume":"35","author":"ML Fisher","year":"1989","unstructured":"Fisher ML, Rosenwein MB (1989) An interactive optimization system for bulk-cargo ship scheduling. Naval Res Logist Q 35:27\u201342","journal-title":"Naval Res Logist Q"},{"key":"709_CR15","unstructured":"Hansen MP, Jaszkiewicz A (1998) Evaluating the quality of approximations of the non-dominated set. Technical Report IMM-REP-1998-7, Technical University of Denmark"},{"key":"709_CR16","unstructured":"Knight W (2015) Inside amazon\u2019s warehouse, human-robot symbiosis. MIT Technology Review"},{"key":"709_CR17","doi-asserted-by":"crossref","unstructured":"Lau HC, Liang Z (2001) Pickup and delivery with time windows: algorithms and test case generation. In: Proceedings of IEEE international conference on tools with artificial intelligence","DOI":"10.1109\/ICTAI.2001.974481"},{"key":"709_CR18","doi-asserted-by":"crossref","unstructured":"Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings of IEEE international conference on tools with artificial intelligence","DOI":"10.1109\/ICTAI.2001.974461"},{"key":"709_CR19","unstructured":"Liang C, Chee KJ, Zou Y, Zhu H, Causo A, Vidas S, Teng T, Chen IM, Low KH, Cheah CC (2015) Automated robot picking system for e-commerce fulfillment warehouse application. In: International federation for the promotion of mechanism and machine science"},{"key":"709_CR20","unstructured":"Lien L (2011) Mining\u2019s new future: how the industry will change in the next decade. Min Eng 63(2):41\u201346"},{"issue":"1","key":"709_CR21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OBG Madsen","year":"1995","unstructured":"Madsen OBG, Ravn HF, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities and multiple objectives. Ann Oper Res 60(1):193\u2013208","journal-title":"Ann Oper Res"},{"key":"709_CR22","doi-asserted-by":"crossref","unstructured":"Najera AG, Bullinaria JA (2009) Bi-objective optimization for the vehicle routing problem with time windows: using route similarity to enhance performance. In: Proceedings of international conference on evolutionary multi-criterion optimization","DOI":"10.1007\/978-3-642-01020-0_24"},{"issue":"2","key":"709_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry WP, Barnes J (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transp Res B Methodol 34(2):107\u2013121","journal-title":"Transp Res B Methodol"},{"issue":"1","key":"709_CR24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24(1):17\u201330","journal-title":"Appl Intell"},{"issue":"1","key":"709_CR25","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00291-004-0173-7","volume":"27","author":"G Pankratz","year":"2005","unstructured":"Pankratz G (2005) A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectr 27(1):21\u201341","journal-title":"OR Spectr"},{"issue":"2","key":"709_CR26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh S, Doerner K, Hartl R (2008) A survey on pickup and delivery problems: part I: transportation between customers and depot. Journal f\u00fcr Betriebswirtschaft 58(2):21\u201351","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"709_CR27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh S, Doerner K, Hartl R (2008) A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft 58(2):81\u2013117","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"709_CR28","doi-asserted-by":"crossref","unstructured":"Phan D, Suzuki J (2015) R2 indicator based multiobjective memetic optimization for the pickup and delivery problem with time windows and demands (PDP-TW-D). In: International conference on bio-inspired information and communications technologies","DOI":"10.4108\/icst.bict.2014.258229"},{"issue":"2","key":"709_CR29","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis HN (1980) A dynamic programming solution to the single-vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 14(2):130\u2013154","journal-title":"Transp Sci"},{"issue":"3","key":"709_CR30","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis HN (1983) An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 17(3):351\u2013357","journal-title":"Transp Sci"},{"key":"709_CR31","unstructured":"Psaraftis HN, Orlin JB, Bienstock D, Thompson PM (1985) Analysis and solution algorithms of sealift routing and scheduling problems. Technical Report 1700-85, Massachusetts Institute of Technology, Sloan School of Management"},{"issue":"3","key":"709_CR32","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/inte.22.3.73","volume":"22","author":"HK Rappoport","year":"1992","unstructured":"Rappoport HK, Levy LS, Golden BL, Toussaint K (1992) A planning heuristic for military airlift. Interfaces 22(3):73\u201387","journal-title":"Interfaces"},{"issue":"1","key":"709_CR33","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF02085656","volume":"50","author":"HK Rappoport","year":"1994","unstructured":"Rappoport HK, Levy LS, Toussaint K, Golden BL (1994) A transportation problem formulation for the mac airlift planning problem. Ann Oper Res 50(1):505\u2013523","journal-title":"Ann Oper Res"},{"issue":"4","key":"709_CR34","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"issue":"4","key":"709_CR35","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/inte.21.4.121","volume":"21","author":"RS Solanki","year":"1991","unstructured":"Solanki RS, Shouthworth F (1991) An execution planning algorithm for military airlift. Interfaces 21 (4):121\u2013131","journal-title":"Interfaces"},{"issue":"2","key":"709_CR36","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"issue":"3","key":"709_CR37","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/inte.22.3.88","volume":"22","author":"MM Solomon","year":"1992","unstructured":"Solomon MM, Chalifour A, Desrosiers J, Boisvert J (1992) An application of vehicle routing methodology to large-scale larvicide control programs. Interfaces 22(3):88\u201399","journal-title":"Interfaces"},{"key":"709_CR38","doi-asserted-by":"crossref","unstructured":"Takoudjou RT, Deschamps JC, Dupas R (2012) A hybrid multi-start heuristic for the pickup and delivery problem with and without transshipment. In: Proceedings of international conference of modeling, optimization and simulation","DOI":"10.3182\/20120523-3-RO-2023.00109"},{"key":"709_CR39","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"KC Tan","year":"2006","unstructured":"Tan KC, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34:115\u2013151","journal-title":"Comput Optim Appl"},{"issue":"1","key":"709_CR40","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1287\/trsc.31.1.60","volume":"31","author":"P Toth","year":"1997","unstructured":"Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31(1):60\u201371","journal-title":"Transp Sci"},{"key":"709_CR41","doi-asserted-by":"crossref","unstructured":"Trautmann H, Wagner T, Brockhoff D (2013) R2-EMOA: focused multiobjective search using R2-indicator-based selection. In: Proceedings of learning and intelligent optimization conference","DOI":"10.1007\/978-3-642-44973-4_8"},{"key":"709_CR42","doi-asserted-by":"crossref","unstructured":"Velasco N, Castagliola P, Dejax P, Guret C, Prins C (2009) A memetic algorithm for a pick-up and delivery problem by helicopter. In: Pereira F, Tavares J (eds) Bio-inspired algorithms for the vehicle routing problem. Springer, pp 173\u2013190","DOI":"10.1007\/978-3-540-85152-3_8"},{"key":"709_CR43","doi-asserted-by":"crossref","unstructured":"Wang H, Lee D-H, Cheu R (2009) PDPTW based taxi dispatch modeling for booking service. In: Proceedings of international conference on natural computation","DOI":"10.1109\/ICNC.2009.676"},{"issue":"1","key":"709_CR44","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2011.08.018","volume":"62","author":"HF Wang","year":"2012","unstructured":"Wang HF, Chen YY (2012) A genetic algorithm for the simultaneous delivery and pickup problems with time window. Comput Ind Eng 62(1):84\u201395","journal-title":"Comput Ind Eng"},{"issue":"6","key":"709_CR45","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"709_CR46","doi-asserted-by":"crossref","unstructured":"Zitzler E, Knowles J, Thiele L (2008) Quality assessment of pareto set approximations. In: Branke J, Deb K, Miettinen K, Slowinski R (eds) Multiobjective optimization: interactive and evolutionary approaches. Springer, pp 373\u2013404","DOI":"10.1007\/978-3-540-88908-3_14"},{"key":"709_CR47","doi-asserted-by":"crossref","unstructured":"Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms: a comparative study. In: Proceedings of international conference on parallel problem solving from nature","DOI":"10.1007\/BFb0056872"},{"issue":"4","key":"709_CR48","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"709_CR49","doi-asserted-by":"crossref","unstructured":"Zitzler E, Thiele L, Bader J (2008) SPAM: set preference algorithm for multiobjective optimization. In: Proceedings of international conference on parallel problem solving from nature","DOI":"10.1007\/978-3-540-87700-4_84"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-016-0709-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-016-0709-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-016-0709-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T17:55:55Z","timestamp":1567706155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-016-0709-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["709"],"URL":"https:\/\/doi.org\/10.1007\/s11036-016-0709-5","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}