{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:23:38Z","timestamp":1766157818534},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,15]],"date-time":"2015-01-15T00:00:00Z","timestamp":1421280000000},"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":["J Heuristics"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10732-015-9280-7","type":"journal-article","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T05:23:55Z","timestamp":1421213035000},"page":"359-390","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A memetic NSGA-II for the bi-objective mixed capacitated general routing problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Santosh Kumar","family":"Mandal","sequence":"first","affiliation":[]},{"given":"Dario","family":"Pacciarelli","sequence":"additional","affiliation":[]},{"given":"Arne","family":"L\u00f8kketangen","sequence":"additional","affiliation":[]},{"given":"Geir","family":"Hasle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,15]]},"reference":[{"key":"9280_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-540-24652-7_2","volume-title":"Evolutionary Computation in Combinatorial","author":"E Alba","year":"2004","unstructured":"Alba, E., Dorronsoro, B.: Solving the vehicle routing problem by using cellular genetic algorithms. Evolutionary Computation in Combinatorial, pp. 11\u201320. Springer, Berlin (2004)"},{"issue":"4","key":"9280_CR2","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.cor.2012.11.014","volume":"40","author":"L Bach","year":"2013","unstructured":"Bach, L., Hasle, G., W\u00f8hlk, S.: A lower bound for the node, edge, and arc routing problem. Comput. Oper. Res. 40(4), 943\u2013952 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9280_CR3","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cie.2013.01.007","volume":"65","author":"R Ba\u00f1os","year":"2013","unstructured":"Ba\u00f1os, R., Ortega, J., Gil, C., M\u00e1quez, A.L., de Toro, F.: A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Comput. Ind. Eng. 65(2), 286\u2013296 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"9280_CR4","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, C., Aguirre, A., Zitzler, E. (eds.) Evolutionary Multi-criterion Optimization, vol. 3410, pp. 120\u2013134. Springer, Berlin (2005)"},{"issue":"4","key":"9280_CR5","first-page":"403","volume":"11","author":"JE Beasley","year":"1983","unstructured":"Beasley, J.E.: Route first-cluster seconds methods for vehicle routing. J. Manag. Sci. 11(4), 403\u2013408 (1983)","journal-title":"J. Manag. Sci."},{"issue":"1","key":"9280_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/5992.814660","volume":"2","author":"I Beichl","year":"2000","unstructured":"Beichl, I., Sullivan, F.: The metropolis algorithm. Comput. Sci. Eng. 2(1), 65\u201369 (2000)","journal-title":"Comput. Sci. Eng."},{"issue":"12","key":"9280_CR7","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1057\/palgrave.jors.2601635","volume":"54","author":"J Berger","year":"2003","unstructured":"Berger, J., Barkaoui, M.: A new hybrid genetic algorithm for the capacitated vehicle routing problem. J. Oper. Res. Soc. 54(12), 1254\u20131262 (2003)","journal-title":"J. Oper. Res. Soc."},{"issue":"7","key":"9280_CR8","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1007\/s11590-012-0552-y","volume":"7","author":"A Bosco","year":"2013","unstructured":"Bosco, A., Lagan\u00e0, D., Musmanno, R., Vocaturo, F.: Modeling and solving the mixed capacitated general routing problem. Optim. Lett. 7(7), 1451\u20131469 (2013)","journal-title":"Optim. Lett."},{"issue":"6","key":"9280_CR9","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/opre.40.6.1095","volume":"40","author":"J Bramel","year":"1991","unstructured":"Bramel, J., Coffman, E.G., Shor, P.W., Simchi-Levi, D.: Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands. Oper. Res. 40(6), 1095\u20131106 (1991)","journal-title":"Oper. Res."},{"key":"9280_CR10","unstructured":"Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.): Chapter 11. Combinatorial Optimization. John Willey, Chichester (1979)"},{"issue":"4","key":"9280_CR11","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"issue":"8","key":"9280_CR12","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8), 928\u2013936 (2001)","journal-title":"J. Oper. Res. Soc."},{"key":"9280_CR13","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"9280_CR14","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/inte.12.4.42","volume":"12","author":"ML Fisher","year":"1982","unstructured":"Fisher, M.L., Greenfield, A.J., Jaikumar, R.: A computrized vehicle routing application. Interfaces 12(4), 42\u201352 (1982)","journal-title":"Interfaces"},{"issue":"10","key":"9280_CR15","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276\u20131290 (1994)","journal-title":"Manag. Sci."},{"key":"9280_CR16","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"B Gillett","year":"1974","unstructured":"Gillett, B., Miller, L.: A heuristic for the vehicle dispatching problem. Oper. Res. 22, 340\u2013349 (1974)","journal-title":"Oper. Res."},{"key":"9280_CR17","unstructured":"Goldberg, D.E., Robert Lingle, J.: Alleles loci and the travelling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms and their applications pp.154\u2013159. (1985)"},{"key":"9280_CR18","volume-title":"Metaheuristics in Vehicle Routing","author":"BL Golden","year":"1998","unstructured":"Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I.M.: Metaheuristics in Vehicle Routing. Springer, Kluwer, Boston (1998)"},{"issue":"5","key":"9280_CR19","first-page":"15","volume":"22","author":"JCA Guti\u00e9rrez","year":"2002","unstructured":"Guti\u00e9rrez, J.C.A., Soler, D., Herv\u00e1s, A.: The capacitated general routing problem on mixed graphs. Revita Invest. Oper. 22(5), 15\u201326 (2002)","journal-title":"Revita Invest. Oper."},{"key":"9280_CR20","unstructured":"Hasle, G.: Routing applications in newspaper delivery. Report A23753, SINTEF, Oslo, Norway. ISBN: 978-82-14-05310-4 (2012)"},{"key":"9280_CR21","doi-asserted-by":"crossref","unstructured":"He, R., Xu, W., Sun, J., Zu, B.: Balanced k-means algorithm for partitioning areas in large-scale vehicle routing problem. In: IEEE Third International Symposium on Intelligent Information Technology Application, Vol. 3 pp. 87\u201390 (2009)","DOI":"10.1109\/IITA.2009.307"},{"key":"9280_CR22","doi-asserted-by":"crossref","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Enhancements of NSGA II and its application to the vehicle routing problem with route balancing. In: Proceedings of the 7th international conference on Artificial Evolution pp. 131\u2013142. (2006)","DOI":"10.1007\/11740698_12"},{"issue":"5","key":"9280_CR23","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10732-007-9022-6","volume":"13","author":"N Jozefowiez","year":"2007","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Target aiming pareto search and its application to the vehicle routing problem with route balancing. J. Heuristics 13(5), 455\u2013469 (2007)","journal-title":"J. Heuristics"},{"issue":"2","key":"9280_CR24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293\u2013309 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9280_CR25","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/j.ejor.2007.06.065","volume":"195","author":"N Jozefowiez","year":"2009","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: An evolutionary algorithm for the vehicle routing problem with route balancing. Eur. J. Oper. Res. 195(3), 761\u2013769 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"9280_CR26","doi-asserted-by":"crossref","first-page":"3624","DOI":"10.1016\/j.cor.2005.02.045","volume":"33","author":"B-I Kim","year":"2006","unstructured":"Kim, B.-I., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Comput. Oper. Res. 33(12), 3624\u20133642 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9280_CR27","first-page":"136","volume-title":"Proceedings of the International conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics, volume 4638 of Lecture Notes in Computer Science","author":"H Kokubugata","year":"2007","unstructured":"Kokubugata, H., Moriyama, A., Kawashima, H.: A practical solution using simulated annealing for general routing problems with nodes, edges, and arcs. In: Stuetzle, T., Birattari, M., Hoos, H.H. (eds.) Proceedings of the International conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics, volume 4638 of Lecture Notes in Computer Science, pp. 136\u2013149. Springer, Berlin, Heidelberg (2007)"},{"issue":"12","key":"9280_CR28","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1016\/j.cor.2005.02.017","volume":"33","author":"P Lacomme","year":"2006","unstructured":"Lacomme, P., Prins, C., Sevaux, M.: A genetic algorithm for a bi-objective capacitated arc routing problem. Comput. Oper. Res. 33(12), 3473\u20133493 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9280_CR29","doi-asserted-by":"crossref","unstructured":"Murata, T., Itai, R.: Multi-objective vehicle routing problems using two-fold EMO algorithms to enhance solution similarity on non-dominated solutions. In: Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization, pp. 885\u2013896. Springer, Berlin, Heidelberg (2005)","DOI":"10.1007\/978-3-540-31880-4_61"},{"issue":"4","key":"9280_CR30","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20333","volume":"54","author":"Y Nagata","year":"2009","unstructured":"Nagata, Y., Br\u00e4ysy, O.: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54(4), 205\u2013215 (2009)","journal-title":"Networks"},{"issue":"1","key":"9280_CR31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.cor.2010.05.004","volume":"38","author":"AG Najera","year":"2011","unstructured":"Najera, A.G., Bullinaria, J.A.: An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 38(1), 287\u2013300 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9280_CR32","unstructured":"Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the travellng salesman problem. In: Proceedings of 2nd International Conference on Genetic Algorithms and Their Application pp. 224\u2013230. (1987)"},{"issue":"4","key":"9280_CR33","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(4), 421\u2013451 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"9280_CR34","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0305-0548(94)00035-7","volume":"22","author":"R Pandit","year":"1995","unstructured":"Pandit, R., Muralidharan, B.: A capacitated general routing problem on mixed networks. Comput. Oper. Res. 22(5), 465\u2013478 (1995)","journal-title":"Comput. Oper. Res."},{"key":"9280_CR35","doi-asserted-by":"crossref","unstructured":"Pasia, J.M., Derner, K.F., Hartl, R.F., Reimann, M.: A population-based local search for solving a bi-objective vehicle routing. In: European conference on Evolutionary computation in combinatorial optimization pp. 166\u2013175 (2007)","DOI":"10.1007\/978-3-540-71615-0_15"},{"key":"9280_CR36","doi-asserted-by":"crossref","unstructured":"Pasia, J.M., Derner, K.F., Hartl, R.F., Reimann, M.: Solving a bi-objective vehicle rouitng problem by pareto ant colony optimization. In: Proceedings of Engineering Stochastic Local Search Algorithms pp. 187\u2013191. Springer, Brussels, Belgium (2007)","DOI":"10.1007\/978-3-540-74446-7_15"},{"issue":"4","key":"9280_CR37","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.: An adaptive large neighborhood search heuristic for the pick up and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"12","key":"9280_CR38","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.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"key":"9280_CR39","series-title":"Studies in Fuzziness and Soft Computing","first-page":"65","volume-title":"Recent Advances in Memetic Algorithms","author":"C Prins","year":"2004","unstructured":"Prins, C., Bouchenoua, S.: A memetic algorithm solving the VRP, the CARP and GENERAL routing problems with nodes, edges and arcs. In: Hart, W.E., Krasnogor, N., Smith, J.E. (eds.) Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol. 166, pp. 65\u201385. Springer, Berlin, Heidelberg (2004)"},{"issue":"4","key":"9280_CR40","doi-asserted-by":"crossref","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.F.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31(4), 563\u2013591 (2004)","journal-title":"Comput. Oper. Res."},{"key":"9280_CR41","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"issue":"2","key":"9280_CR42","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"3","key":"9280_CR43","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.ejor.2004.11.019","volume":"172","author":"KC Tan","year":"2006","unstructured":"Tan, K.C., Chew, Y.H., Lee, L.H.: A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Eur. J. Oper. Res. 172(3), 855\u2013885 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9280_CR44","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4), 333\u2013346 (2003)","journal-title":"INFORMS J. Comput."},{"key":"9280_CR45","first-page":"133","volume-title":"In: Proceedings of the 3rd International Conference on Genetic Algorithms","author":"LD Whitley","year":"1989","unstructured":"Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 133\u2013140. George Mason University, Fairfax, Virginia, USA (1989)"},{"key":"9280_CR46","first-page":"309","volume-title":"IEEE International Conference on Automation Science and Engineering","author":"H Xu","year":"2008","unstructured":"Xu, H., Fan, W., Wei, T., Yu, L.: An or-opt NSGA-II algorithm for multi-objective vehicle routing problem with time windows. IEEE International Conference on Automation Science and Engineering, pp. 309\u2013314. Key Bridge, Marriott, Washington DC, USA (2008)"},{"key":"9280_CR47","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: Evolutionary Methods for Design, Optimisation, and Control, chapter SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization pp. 19\u201326, CIMNE, Barcelona, Spain (2002)"},{"issue":"4","key":"9280_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.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9280-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9280-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9280-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T18:00:03Z","timestamp":1566237603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9280-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,15]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9280"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9280-7","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,15]]}}}