{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T04:05:55Z","timestamp":1773201955242,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540716143","type":"print"},{"value":"9783540716150","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71615-0_15","type":"book-chapter","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T14:51:34Z","timestamp":1176907894000},"page":"166-175","source":"Crossref","is-referenced-by-count":15,"title":["A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Joseph M.","family":"Pasia","sequence":"first","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Reimann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G. Dantzig","year":"1959","unstructured":"Dantzig, G., Ramsey, J.: The truck dispatching problem. Management Science\u00a06, 80\u201391 (1959)","journal-title":"Management Science"},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Mingozzi, A., Hadjiconstantinou, E.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research\u00a052(5), 723\u2013738 (2004)","journal-title":"Operations Research"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Arag\u00e3o, M., Reis, M., Uchoa, E., Werneck, R.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming\u00a0106(3), 491\u2013511 (2006)","journal-title":"Mathematical Programming"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J. Lenstra","year":"1981","unstructured":"Lenstra, J., Kan, A.: Complexity of vehicle routing and scheduling problem. Networks\u00a011, 221\u2013227 (1981)","journal-title":"Networks"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research\u00a012, 568\u2013581 (1964)","journal-title":"Operations Research"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J. Cordeau","year":"2002","unstructured":"Cordeau, J., Gendreau, M., Laporte, G., Potvin, J., Semet, F.: A guide to vehicle routing heuristics. Journal of the Operational Research Society\u00a053, 512\u2013522 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum\u00a022, 425\u2013460 (2000)","journal-title":"OR Spektrum"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics\u00a01, 147\u2013167 (1995)","journal-title":"Journal of Heuristics"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-46004-7_2","volume-title":"Applications of Evolutionary Computing","author":"K. Doerner","year":"2002","unstructured":"Doerner, K., Gronalt, M., Hartl, R.F., Reimann, M., Strauss, C., Stummer, M.: SavingsAnts for the vehicle routing problem. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol.\u00a02279, pp. 11\u201320. Springer, Berlin Heidelberg New York (2002)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11740698_12","volume-title":"Artificial Evolution","author":"N. Jozefowiez","year":"2006","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Enhancements of NSGA-II and its application to the vehicle routing problem with route balancing. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol.\u00a03871, pp. 131\u2013142. Springer, Berlin Heidelberg New York (2006)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-45712-7_26","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"N. Jozefowiez","year":"2002","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN VII. LNCS, vol.\u00a02439, pp. 271\u2013280. Springer, Berlin Heidelberg New York (2002)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-540-31880-4_14","volume-title":"Evolutionary Multi-Criterion Optimization","author":"C. Haubelt","year":"2005","unstructured":"Haubelt, C., Gamenik, J., Teich, J.: Initial population construction for convergence improvement of moeas. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol.\u00a03410, pp. 191\u2013205. Springer, Heidelberg (2005)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-44719-9_30","volume-title":"Evolutionary Multi-Criterion Optimization","author":"X. Gandibleux","year":"2001","unstructured":"Gandibleux, X., Morita, H., Katoh, N.: The supported solutions used as a genetic information in a population heuristic. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol.\u00a01993, pp. 429\u2013442. Springer, Berlin Heidelberg New York (2001)"},{"issue":"1","key":"15_CR14","first-page":"23","volume":"26","author":"H. Morita","year":"2001","unstructured":"Morita, H., Gandibleux, X., Katoh, N.: Experimental feedback on biobjective permutation scheduling problems solved with a population heuristic. Foundations of Computing and Decision Sciences\u00a026(1), 23\u201350 (2001)","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.ejor.2004.07.017","volume":"167","author":"J. Arroyo","year":"2005","unstructured":"Arroyo, J., Armentano, V.: Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research\u00a0167, 717\u2013738 (2005)","journal-title":"European Journal of Operational Research"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/978-3-540-31880-4_9","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M. Basseur","year":"2005","unstructured":"Basseur, M., Seynhaeve, F., Talbi, E.: Path relinking in pareto multi-objective genetic algorithms. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol.\u00a03410, pp. 120\u2013134. Springer, Berlin Heidelberg New York (2005)"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M. Reimann","year":"2004","unstructured":"Reimann, M., Doerner, K., Hartl, R.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research\u00a031(4), 563\u2013591 (2004)","journal-title":"Computers & Operations Research"},{"key":"15_CR18","volume-title":"Cominbatorial Optimization","author":"N. Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Cominbatorial Optimization, John Wiley and Sons, New York, NY (1979)"},{"key":"15_CR19","unstructured":"Knowles, J., Thiele, L., Zitzler, E.: A tutorial on the performance assessment of stochastic multiobjective optimizers. Technical Report TIK-Report No. 214, Computer Engineering and Networks Laboratory, ETH Zurich, Gloriastrasse 35, ETH-Zentrum, 8092 Zurich, Switzerland (2006)"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Trans. Evolutionary Computation\u00a03(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"15_CR21","unstructured":"Hansen, M., Jaszkiewicz, A.: Evaluating the quality of approximations to the non-dominated set. Technical Report Technical Report IMM-REP-1998-7, Technical University of Denmark (1998)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimisation: NSGA-II. In: PPSN, pp. 849\u2013858 (2000)","DOI":"10.1007\/3-540-45356-3_83"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71615-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:16:32Z","timestamp":1556349392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71615-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716143","9783540716150"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71615-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}