{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T17:49:28Z","timestamp":1773424168951,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T00:00:00Z","timestamp":1213228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10100-008-0062-2","type":"journal-article","created":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T15:45:03Z","timestamp":1213199103000},"page":"331-343","source":"Crossref","is-referenced-by-count":29,"title":["An algorithm for the capacitated vehicle routing problem with route balancing"],"prefix":"10.1007","volume":"16","author":[{"given":"Istv\u00e1n","family":"Borgulya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"62_CR1","doi-asserted-by":"crossref","unstructured":"Berger J, Barkaoui M (2003) A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Cant\u00fa-Paz E et al. (eds) GECCO 2003. Lecture notes in computer science, vol 2723. Springer, Berlin, pp 646\u2013656","DOI":"10.1007\/3-540-45105-6_80"},{"issue":"3","key":"62_CR2","first-page":"233","volume":"13","author":"I Borgulya","year":"2005","unstructured":"Borgulya I (2005) A multi-objective evolutionary algorithm with a separate archive. Central Eur J Oper Res 13(3): 233\u2013254","journal-title":"Central Eur J Oper Res"},{"key":"62_CR3","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/3-540-34783-6_55","volume-title":"Computational intelligence, theory and applications advances in soft computing","author":"I Borgulya","year":"2006","unstructured":"Borgulya I (2006) An evolutionary algorithm for the biobjective QAP. In: Reusch B (eds) Computational intelligence, theory and applications advances in soft computing. Springer, Berlin, pp 577\u2013586"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Borgulya I (2007) An EC-memory based method for the multi-objective TSP. In: Proceedings of the 9th annual conference on Genetic and evolutionary computation GECCO \u201907. ACM Press, New York, pp 903","DOI":"10.1145\/1276958.1277133"},{"issue":"4","key":"62_CR5","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","volume":"7","author":"A Chen","year":"2006","unstructured":"Chen A, Yang G, Wu Z (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ Sci A 7(4): 607\u2013614","journal-title":"J Zhejiang Univ Sci A"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Chitty DM, Hernandez ML (2004) A hybrid ant colony optimisation technique for dynamic vehicle routing. In: Deb K et al. (eds) GECCO 2004, Lecture notes in computer science, vol 3102. Springer, Berlin, pp 48\u201359","DOI":"10.1007\/978-3-540-24854-5_5"},{"key":"62_CR7","unstructured":"Cordeau J, Laporte G (2002) Tabu search heuristics for the vehicle routing problem. Les Cahiers du GERAD G 2002-15"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Czarnas P, Zbigniew J, Czech ZJ, Gocyla P (2004) Parallel simulated annealing for bicriterion optimization problems. In: Wyrzykowski R et al. (eds) PPAM 2003, Lecture notes in computer science, vol 3019. Springer, Berlin, pp 233\u2013240","DOI":"10.1007\/978-3-540-24669-5_30"},{"key":"62_CR9","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratab A, Meyunivan T (2002) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. IEEE Trans Evol Comput 182\u2013197","DOI":"10.1109\/4235.996017"},{"key":"62_CR11","unstructured":"El-Sherbeny N (2001) Resolution of a vehicle routing problem with multi-objective simulated annealing method. Ph.D. thesis, Facultie Polytechnique de Mons"},{"issue":"3","key":"62_CR12","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2006.01.037","volume":"178","author":"K Ganesh","year":"2007","unstructured":"Ganesh K, Narendran TT (2007) CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up. Eur J Oper Res 178(3): 699\u2013717","journal-title":"Eur J Oper Res"},{"key":"62_CR13","volume-title":"Genetic algorithm for search, optimizatin and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithm for search, optimizatin and machine learning. Addison-Westley, Reading, MA"},{"key":"62_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02098280","volume":"61","author":"E Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou E, Christofides N (1995) A new exact algorithm for the vehicle muting problem based on q-paths and k-shortest paths relaxations. Ann Oper Res 61: 21\u201343","journal-title":"Ann Oper Res"},{"key":"62_CR15","doi-asserted-by":"crossref","unstructured":"Jozefowiez N, Semet F, Talbi E (2002) Parallel and hybrid models for multi-objective optimization: application to the vehicle routing problem. In: Merelo Guervos JJ et al. (eds) PPSN VII, Lecture notes in computer science, vol 2439. Springer, Berlin, pp 271\u2013280","DOI":"10.1007\/3-540-45712-7_26"},{"key":"62_CR16","doi-asserted-by":"crossref","unstructured":"Jozefowiez N, Semet F, Talbi E (2006) Enhancements of NSGA II and its application to the vehicle routing problem with route balancing. In: Talbi E et al. (eds) Evolutionary algorithms, 2005. Lecture notes in computer science, vol 3871. Springer, Berlin, pp 131\u2013142","DOI":"10.1007\/11740698_12"},{"issue":"3","key":"62_CR17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3): 345\u2013358","journal-title":"Eur J Oper Res"},{"key":"62_CR18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.endm.2004.06.029","volume":"18","author":"S Mazzeo","year":"2004","unstructured":"Mazzeo S, Loiseau I (2004) An ant colony algorithm for the capacitated vehicle routing. Electron Notes Discrete Math 18: 181\u2013186","journal-title":"Electron Notes Discrete Math"},{"key":"62_CR19","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2002) A new algorithm for a dynamic vehicle routing problem based on ant colony system. Technical Report IDSIA-23-02, IDSIA, November 2002. ftp:\/\/ftp.idsia.ch\/pub\/techrep\/IDSIA-23-02.pdf.gz"},{"key":"62_CR20","doi-asserted-by":"crossref","unstructured":"Pasia JM, Doerner KF, Hartl RF, Reimann M (2007a) A population-based local search for solving a Bi-objective vehicle routing problem. In: Cotta, van Hemert J (eds) EvoCOP 2007, Lecture notes in computer science, vol 4446, pp 166\u2013175, 2007","DOI":"10.1007\/978-3-540-71615-0_15"},{"key":"62_CR21","doi-asserted-by":"crossref","unstructured":"Pasia JM, Doerner KF, Hartl RF, Reimann M (2007b) Solving a bi-objective vehicle routing problem by pareto-ant colony optimization. In: Stutzle T, Birattari M, Hoos HH (eds) SLS 2007, Lecture notes in computer science, vol 4638, pp 187\u2013191","DOI":"10.1007\/978-3-540-74446-7_15"},{"key":"62_CR22","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31: 1985\u20132002","journal-title":"Comput Oper Res"},{"key":"62_CR23","doi-asserted-by":"crossref","unstructured":"Ribeiro R, Louren\u00e7o HR (2001) A multi-objective model for a multi period distribution management problem. In: MIC\u20192001, pp 97\u2013102","DOI":"10.2139\/ssrn.273419"},{"key":"62_CR24","doi-asserted-by":"crossref","unstructured":"Russel M, Lamont GB (2005) A genetic algorithm for unmanned aerial vehicle rouiting GECCO\u201905 Washington, DC, USA, ACM 2005, pp 1523\u20131530","DOI":"10.1145\/1068009.1068249"},{"key":"62_CR25","doi-asserted-by":"crossref","unstructured":"Sun H, Xie J, Xue Y (2005) A sweep-based TCNN algorithm for capacity vehicle routing problem. Lecture notes in computer science, vol 3496. Springer, Berlin, pp 756\u2013761","DOI":"10.1007\/11427391_121"},{"key":"62_CR26","doi-asserted-by":"crossref","unstructured":"Tavares J, Pereira FB, Machado P, Costa E (2003) On the influence of GVR in vehicle routing. In: Proceedings of the 2003 ACM symposium on applied computing, pp 753\u2013758, Melbourne, Florida, USA, March 2003","DOI":"10.1145\/952532.952679"},{"key":"62_CR27","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","volume":"28","author":"A Van Breedam","year":"2001","unstructured":"Van Breedam A (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Oper Res 28: 289\u2013315","journal-title":"Comput Oper Res"},{"issue":"2","key":"62_CR28","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2002","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, de Fonseca G (2002) Performance assessment of multiobjective optimizations: an analysis and rewiew. IEEE Trans Evol Comput 7(2): 117\u2013132","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-008-0062-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-008-0062-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-008-0062-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:26Z","timestamp":1559123366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-008-0062-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,12]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s10100-008-0062-2","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,12]]}}}