{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:22:17Z","timestamp":1780636937892,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T00:00:00Z","timestamp":1486080000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s12293-016-0222-1","type":"journal-article","created":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T07:55:41Z","timestamp":1486108541000},"page":"103-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["A decomposition-based chemical reaction optimization for multi-objective vehicle routing problem for simultaneous delivery and pickup with time windows"],"prefix":"10.1007","volume":"10","author":[{"given":"Hongye","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinghong","family":"Hei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiaoyong","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,2,3]]},"reference":[{"issue":"2","key":"222_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s12293-011-0070-y","volume":"4","author":"MC Goldbarg","year":"2012","unstructured":"Goldbarg MC, Asconavieta PH, Goldbarg EFG (2012) Memetic algorithm for the traveling car renter problem: an experimental investigation. Memet Comput 4(2):89\u2013108","journal-title":"Memet Comput"},{"key":"222_CR2","unstructured":"Xu Y, Lim MH, Ong YS (2008) Automatic configuration of metaheuristic algorithms for complex combinatorial optimization problems. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence). IEEE, pp 2380\u20132387"},{"issue":"4","key":"222_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s12293-010-0037-4","volume":"2","author":"P F\u00f6ldesi","year":"2010","unstructured":"F\u00f6ldesi P, Botzheim J (2010) Modeling of loss aversion in solving fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. Memet Comput 2(4):259\u2013271","journal-title":"Memet Comput"},{"key":"222_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cie.2015.02.005","volume":"83","author":"C Wang","year":"2015","unstructured":"Wang C, Mu D, Zhao F et al (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup\u2013delivery and time windows. Comput Ind Eng 83:111\u2013122","journal-title":"Comput Ind Eng"},{"key":"222_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.cor.2015.04.002","volume":"62","author":"M Cherkesly","year":"2015","unstructured":"Cherkesly M, Desaulniers G, Laporte G (2015) A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput Oper Res 62:23\u201335","journal-title":"Comput Oper Res"},{"issue":"1","key":"222_CR6","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(1):115\u2013151","journal-title":"Comput Optim Appl"},{"key":"222_CR7","doi-asserted-by":"publisher","unstructured":"Wang J, Zhou Y, Wang Y et al (2016) Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms IEEE Trans Cybern 46(3):582\u2013594. doi:\n                        10.1109\/TCYB.2015.2409837","DOI":"10.1109\/TCYB.2015.2409837"},{"key":"222_CR8","unstructured":"Hsu WH, Chiang TCA (2012) Multiobjective evolutionary algorithm with enhanced reproduction operators for the vehicle routing problem with time windows. In: IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1\u20138"},{"key":"222_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.swevo.2015.06.001","volume":"24","author":"S Iqbal","year":"2015","unstructured":"Iqbal S, Kaykobad M, Rahman MS (2015) Solving the multi-objective vehicle routing problem with soft time windows with the help of bees. Swarm Evol Comput 24:50\u201364","journal-title":"Swarm Evol Comput"},{"key":"222_CR10","doi-asserted-by":"crossref","unstructured":"Li H, Landa-Silva D (2011) An adaptive evolutionary multi-objective approach based on simulated annealing. Evol Comput 19(4):561\u2013595","DOI":"10.1162\/EVCO_a_00038"},{"issue":"6","key":"222_CR11","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 multi-objective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"222_CR12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TEVC.2013.2260862","volume":"18","author":"M Gong","year":"2014","unstructured":"Gong M, Cai Q, Chen X et al (2014) Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. IEEE Trans Evol Comput 18(1):82\u201397","journal-title":"IEEE Trans Evol Comput"},{"key":"222_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.cor.2015.04.009","volume":"62","author":"Y Qi","year":"2015","unstructured":"Qi Y, Hou Z, Li H et al (2015) A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows. Comput Oper Res 62:61\u201377","journal-title":"Comput Oper Res"},{"issue":"1","key":"222_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-012-0075-1","volume":"4","author":"AYS Lam","year":"2012","unstructured":"Lam AYS, Li VOK (2012) Chemical reaction optimization: a tutorial. Memet Comput 4(1):3\u201317","journal-title":"Memet Comput"},{"issue":"10","key":"222_CR15","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1109\/TPDS.2011.35","volume":"22","author":"J Xu","year":"2011","unstructured":"Xu J, Lam A, Li VOK (2011) Chemical reaction optimization for task scheduling in grid computing. IEEE Trans Parallel Distrib Syst 22(10):1624\u20131631","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"222_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TMAG.2014.2347962","volume":"51","author":"H Duan","year":"2015","unstructured":"Duan H, Gan L (2015) Orthogonal multiobjective chemical reaction optimization approach for the brushless DC motor design. IEEE Trans Magn 51(1):1\u20137","journal-title":"IEEE Trans Magn"},{"issue":"10","key":"222_CR17","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1109\/TCYB.2014.2363878","volume":"45","author":"S Bechikh","year":"2015","unstructured":"Bechikh S, Chaabani A, Said L (2015) An efficient chemical reaction optimization algorithm for multiobjective optimization. IEEE Trans Cybern 45(10):2051\u20132064","journal-title":"IEEE Trans Cybern"},{"key":"222_CR18","doi-asserted-by":"publisher","unstructured":"Li H, Wang L, Hei X (2015) Decomposition-based chemical reaction optimization (CRO) and an extended CRO algorithms for multiobjective optimization. J Comput Sci. doi:\n                        10.1016\/j.jocs.2015.09.003","DOI":"10.1016\/j.jocs.2015.09.003"},{"issue":"2","key":"222_CR19","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TEVC.2014.2315442","volume":"19","author":"H Ishibuchi","year":"2015","unstructured":"Ishibuchi H, Akedo N, Nojima Y (2015) Behavior of multiobjective evolutionary algorithms on many-objective knapsack problems. IEEE Trans Evol Comput 19(2):264\u2013283","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"222_CR20","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631\u2013657","journal-title":"SIAM J Optim"},{"key":"222_CR21","doi-asserted-by":"crossref","unstructured":"Liu HL, Gu F, Cheung Y (2010) T-MOEA\/D: MOEA\/D with objective transform in multi-objective problems. In: 2010 international conference of information science and management engineering (ISME), vol 2. IEEE, pp 282\u2013285","DOI":"10.1109\/ISME.2010.274"},{"issue":"6","key":"222_CR22","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang X, Tian Y, Jin Y (2015) A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 19(6):761\u2013776","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"222_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Multiobjective Thiele L (1999) 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"},{"issue":"6","key":"222_CR24","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1(6):80\u201383","journal-title":"Biom Bull"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-016-0222-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0222-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0222-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T10:03:27Z","timestamp":1518602607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-016-0222-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["222"],"URL":"https:\/\/doi.org\/10.1007\/s12293-016-0222-1","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,3]]}}}