{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T17:17:27Z","timestamp":1724951847216},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T00:00:00Z","timestamp":1460073600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00500-016-2112-3","type":"journal-article","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T20:50:32Z","timestamp":1460148632000},"page":"5159-5178","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A bi-criteria evolutionary algorithm for a constrained multi-depot vehicle routing problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Vikas","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constance","family":"Lightner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carin","family":"Lightner-Laws","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,8]]},"reference":[{"key":"2112_CR1","first-page":"1","volume":"26","author":"R Abounacer","year":"2012","unstructured":"Abounacer R, Rekik M, Renaud J (2012) An exact solution approach for multi-objective location transportation problem for disaster response. CIRRELT 26:1\u201332","journal-title":"CIRRELT"},{"issue":"1","key":"2112_CR2","first-page":"73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja YP, Nair PK (1979) Bicriteria transportation problem. Manag Sci 25(1):73\u201378","journal-title":"Bicriteria transportation problem. Manag Sci"},{"issue":"2","key":"2112_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math Program 120(2):347\u2013380","journal-title":"Math Program"},{"issue":"2","key":"2112_CR4","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/opre.1100.0881","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Bartolini E, Mingozzi A (2011) An exact algorithm for the pickup and delivery problem with time windows. Oper Res 59(2):414\u2013426","journal-title":"Oper Res"},{"issue":"5","key":"2112_CR5","doi-asserted-by":"crossref","first-page":"1696","DOI":"10.1016\/j.eswa.2012.09.012","volume":"40","author":"R Banos","year":"2013","unstructured":"Banos R, Ortega J, Gil C, Fernandez A, De Toro F (2013) A simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows. Expert Syst Appl 40(5):1696\u20131707","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2112_CR6","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2010.04.008","volume":"38","author":"J Brandao","year":"2011","unstructured":"Brandao J (2011) A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput Oper Res 38(1):140\u2013151","journal-title":"Comput Oper Res"},{"issue":"1","key":"2112_CR7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10479-012-1118-1","volume":"203","author":"W Chen","year":"2012","unstructured":"Chen W, Song J, Shi L, Pi L, Sun P (2012) Data mining-based dispatching system for solving the local pickup and delivery problem. Ann Oper Res 203(1):351\u2013370","journal-title":"Ann Oper Res"},{"issue":"7","key":"2112_CR8","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E Choi","year":"2007","unstructured":"Choi E, Tcha D (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comput Oper Res 34(7):2080\u20132095","journal-title":"Comput Oper Res"},{"key":"2112_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"CA Coello","year":"2002","unstructured":"Coello CA, van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer Academic Publishers, Dordrecht"},{"key":"2112_CR10","volume-title":"A parallel iterated tabu search heuristic for vehicle routing problems","author":"JF Cordeau","year":"2011","unstructured":"Cordeau JF, Maichberger M (2011) A parallel iterated tabu search heuristic for vehicle routing problems. Tech rep, CIRRELT"},{"issue":"1","key":"2112_CR11","first-page":"80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"The truck dispatching problem. Manag Sci"},{"issue":"1","key":"2112_CR12","doi-asserted-by":"crossref","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. Eur J Oper Res 54(1):7\u201322","journal-title":"Eur J Oper Res"},{"key":"2112_CR13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580111","volume":"5","author":"JP Evans","year":"1973","unstructured":"Evans JP, Steuer RP (1973) A revised simplex method for multiple objective programs. Math Program 5:54\u201372","journal-title":"Math Program"},{"key":"2112_CR14","doi-asserted-by":"crossref","unstructured":"Gal T (1975) Rim multiparametric linear programming. Manag Sci 21:567\u2013575","DOI":"10.1287\/mnsc.21.5.567"},{"key":"2112_CR15","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"key":"2112_CR16","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1016\/j.ress.2005.11.018","volume":"91","author":"A Konak","year":"2006","unstructured":"Konak A, Coit D, Smith A (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91:992\u20131007","journal-title":"Reliab Eng Syst Saf"},{"issue":"2","key":"2112_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/TASE.2009.2019265","volume":"7","author":"H Lau","year":"2010","unstructured":"Lau H, Chan T, Tsui W, Pang W (2010) Application of genetic algorithms to solve the multidepot vehicle routing problem. IEEE Trans Autom Sci Eng 7(2):383\u2013392","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"2112_CR18","doi-asserted-by":"crossref","unstructured":"Lightner-Laws C, Agrawal V, Lightner C, Wagner N (2016) An evolutionary algorithm approach for the constrained multi-depot vehicle routing problem. Int J Intell Comput Cybern 9(1):2\u201322","DOI":"10.1108\/IJICC-06-2015-0018"},{"issue":"3","key":"2112_CR19","first-page":"1099","volume":"3","author":"R Likaj","year":"2013","unstructured":"Likaj R, Shala A, Bruqi M (2013) Application of graph theory to find optimal paths for the transportation problem. Int J Curr Eng Technol 3(3):1099\u20131103","journal-title":"Int J Curr Eng Technol"},{"key":"2112_CR20","doi-asserted-by":"crossref","unstructured":"Michalewicz Z (1995) A Survey of constraint handling techniques in evolutionary computation methods. In: Proceedings of the 4th annual conference on evolutionary programming. MIT Press, Cambridge, pp 135\u2013155. https:\/\/cs.adelaide.edu.au\/~zbyszek\/Papers\/p17.pdf","DOI":"10.7551\/mitpress\/2887.003.0018"},{"key":"2112_CR21","volume-title":"Nonlinear multiobjective optimization","author":"KM Miettinen","year":"1999","unstructured":"Miettinen KM (1999) Nonlinear multiobjective optimization. Kluwer Academic Publishers, Dordrecht"},{"issue":"1","key":"2112_CR22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.ejor.2009.04.029","volume":"202","author":"J Muller","year":"2010","unstructured":"Muller J (2010) Approximative solutions to the bicriterion vehicle routing problem with time windows. Eur J Oper Res 202(1):223\u2013231","journal-title":"Eur J Oper Res"},{"key":"2112_CR23","doi-asserted-by":"crossref","unstructured":"Ombuki-Berman B, Hanshar T (2009) Using genetic algorithms for multi-depot vehicle routing. In: Pereira AMS, Tavares J (eds) Bio-inspired algorithms for the vehicle routing problem, pp 77\u201399","DOI":"10.1007\/978-3-540-85152-3_4"},{"issue":"4","key":"2112_CR24","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"D Pisinger","year":"2006","unstructured":"Pisinger D, Ropke S (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"},{"key":"2112_CR25","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403\u20132435","journal-title":"Comput Oper Res"},{"key":"2112_CR26","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"JY Potvin","year":"1995","unstructured":"Potvin JY, Rousseau JM (1995) An exchange heuristic for routing problems with time windows. J Oper Res Soc 46:1433\u20131466","journal-title":"J Oper Res Soc"},{"issue":"2","key":"2112_CR27","first-page":"13","volume":"2","author":"S Prakash","year":"2014","unstructured":"Prakash S, Saluja RK, Singh P (2014) Pareto optimal solutions to the cost-time trade-off bulk transportation problem through a newly evolved efficacious novel algorithm. J Data Inf Process 2(2):13\u201325","journal-title":"J Data Inf Process"},{"issue":"4","key":"2112_CR28","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problem with time windows. Networks 49(4):258\u2013272","journal-title":"Networks"},{"issue":"3","key":"2112_CR29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke S, Cordeau JF (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"},{"issue":"2","key":"2112_CR30","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M Solomon","year":"1987","unstructured":"Solomon M (1987) Algorithms for vehicle routing and scheduling problem with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"key":"2112_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"TC Tan","year":"2006","unstructured":"Tan TC, Chew YH, Lee LH (2006) A hybrid multi-objective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34:115\u2013151","journal-title":"Comput Optim Appl"},{"issue":"3","key":"2112_CR32","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2011","unstructured":"Vidal T, Crainic T, Gendreau M, Lahrichi N, Rei W (2011a) A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"},{"key":"2112_CR33","unstructured":"Vidal T, Crainic T, Gendreau M, Prins C (2011b) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Tech Rep 61:CIRRELT"},{"key":"2112_CR34","first-page":"51","volume":"3","author":"PL Yu","year":"1974","unstructured":"Yu PL, Zeleny M (1974) The techniques of linear multiobjective programming. Revue Francoise d\u2019Automatique, Informatique et Recherche Operationnelle 3:51\u201371","journal-title":"Revue Francoise d\u2019Automatique, Informatique et Recherche Operationnelle"},{"key":"2112_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-80808-1","volume-title":"Linear multiobjective programming","author":"M Zeleny","year":"1974","unstructured":"Zeleny M (1974) Linear multiobjective programming. Springer, New York"},{"issue":"10","key":"2112_CR36","first-page":"2585","volume":"8","author":"S Zou","year":"2013","unstructured":"Zou S, Li J, Li X (2013) A hybrid particle swarm optimization algorithm for multi-objective pickup and delivery problem with time windows. J Comput 8(10):2585\u20132589","journal-title":"J Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2112-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2112-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2112-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2112-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T15:48:06Z","timestamp":1718466486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2112-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,8]]},"references-count":36,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2112"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2112-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,8]]}}}