{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:45:08Z","timestamp":1773798308391,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T00:00:00Z","timestamp":1425513600000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10479-015-1792-x","type":"journal-article","created":{"date-parts":[[2015,3,4]],"date-time":"2015-03-04T05:13:42Z","timestamp":1425446022000},"page":"303-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":131,"title":["An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot"],"prefix":"10.1007","volume":"242","author":[{"given":"Baozhen","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junjie","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,5]]},"reference":[{"issue":"5","key":"1792_CR1","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","volume":"36","author":"TJ Ai","year":"2009","unstructured":"Ai, T. J., & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 36(5), 1693\u20131702.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"1792_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-013-1366-8","volume":"206","author":"T Athanasopoulos","year":"2013","unstructured":"Athanasopoulos, T., & Minis, L. (2013). Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework. Annals of Operations Research, 206(1), 1\u201322.","journal-title":"Annals of Operations Research"},{"issue":"8","key":"1792_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"1","author":"JE Bell","year":"2004","unstructured":"Bell, J. E., & McMullen, P. R. (2004). Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics, 1(8), 41\u201348.","journal-title":"Advanced Engineering Informatics"},{"key":"1792_CR4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1080\/01966324.1993.10737363","volume":"13","author":"MI Chao","year":"1993","unstructured":"Chao, M. I., Golden, B. L., & Wasil, E. A. (1993). A new heuristic for the multi-depot vehicle routing problem that improves upon bestknown solutions. American Journal of Mathematical and Management Sciences, 13, 371\u2013406.","journal-title":"American Journal of Mathematical and Management Sciences"},{"issue":"3","key":"1792_CR5","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1016\/j.cor.2004.08.012","volume":"33","author":"A Chatterjee","year":"2006","unstructured":"Chatterjee, A., & Siarry, P. (2006). Nonlinear inertia weight variation for dynamic adaption in particle swarm optimization. Computer and Operations Research, 33(3), 859\u2013871.","journal-title":"Computer and Operations Research"},{"key":"1792_CR6","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/13658816.2011.598133","volume":"26","author":"BY Chen","year":"2012","unstructured":"Chen, B. Y., Lam, W. H. K., Sumalee, A., & Li, Z. L. (2012). Reliable shortest path finding in stochastic networks with spatial correlated link travel times. International Journal of Geographical Information Science, 26, 365\u2013386.","journal-title":"International Journal of Geographical Information Science"},{"key":"1792_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s11067-012-9175-1","volume":"13","author":"BY Chen","year":"2013","unstructured":"Chen, B. Y., Lam, W. H. K., Sumalee, A., Li, Q. Q., Shao, H., & Fang, Z. X. (2013a). Finding reliable shortest paths in road networks under uncertainty. Networks & Spatial Economics, 13, 123\u2013148.","journal-title":"Networks & Spatial Economics"},{"key":"1792_CR8","doi-asserted-by":"crossref","unstructured":"Chen, B. Y., Lam, W. H. K., Li, Q. Q., Sumalee, A., & Yan, K. (2013). Shortest path finding problem in stochastic time-dependent road networks with stochastic first-in-first-out property. IEEE Transactions on Intelligent Transportation Systems, 14(4), 1907\u20131917.","DOI":"10.1109\/TITS.2013.2270282"},{"key":"1792_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle dispatching problem. Journal of the Operational Research Society, 20, 309\u2013318.","journal-title":"Journal of the Operational Research Society"},{"key":"1792_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau, J. F., & GendreauMand Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105\u2013119.","journal-title":"Networks"},{"issue":"2","key":"1792_CR11","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2005.08.015","volume":"176","author":"B Crevier","year":"2007","unstructured":"Crevier, B., Cordeau, J. F., & Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research., 176(2), 756\u2013773.","journal-title":"European Journal of Operational Research."},{"key":"1792_CR12","first-page":"94","volume":"1","author":"RC Eberhart","year":"2001","unstructured":"Eberhart, R. C., & Shi, Y. H. (2001). Tracking and optimizing dynamic systems with particle swarms. Congress on Evolutionary Computation, Korea, 1, 94\u2013100.","journal-title":"Congress on Evolutionary Computation, Korea"},{"issue":"3","key":"1792_CR13","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF00939380","volume":"76","author":"QY Duan","year":"1993","unstructured":"Duan, Q. Y., Gupta, V. K., & Sorooshian, S. (1993). Shuffled complex evolution approach for effective and efficient minimization. Journal of optimization theory and applications, 76(3), 501\u2013521.","journal-title":"Journal of optimization theory and applications"},{"key":"1792_CR14","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"BE Gillett","year":"1976","unstructured":"Gillett, B. E., & Johnson, J. G. (1976). Multi-terminal vehicle-dispatch algorithm. Omega, 4, 711\u2013718.","journal-title":"Omega"},{"issue":"1","key":"1792_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10479-011-1036-7","volume":"219","author":"GM Goncalves","year":"2014","unstructured":"Goncalves, G. M., Gouveia, L., & Pato, M. V. (2014). An improved decomposition-based heuristic to design a water distribution network for an irrigation system. Annals of Operations Research, 219(1), 141\u2013167.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1792_CR16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2008.07.022","volume":"197","author":"A Imran","year":"2009","unstructured":"Imran, A., Salhi, S., & Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197(2), 509\u2013518.","journal-title":"European Journal of Operational Research"},{"key":"1792_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the 1995 IEEE International Conference on Neural Networks. Perth, Aystralia, (pp. 1942\u20131948).","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1792_CR18","doi-asserted-by":"crossref","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"TL Lin","year":"2010","unstructured":"Lin, T. L., Horng, S. J., Kao, T. W., Chen, Y. H., Run, R. S., Chen, R. J., et al. (2010). An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Systems with Applications, 37, 2629\u20132636.","journal-title":"Expert Systems with Applications"},{"key":"1792_CR19","first-page":"1505","volume":"2","author":"XF Liu","year":"2008","unstructured":"Liu, X. F., & Chen, S. (2008). Research on profit allocation of common delivery. Service operations and logistics, and informatics. IEEE\/SOLI, 2, 1505\u20131508.","journal-title":"IEEE\/SOLI"},{"issue":"4","key":"1792_CR20","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"AW Mohemmed","year":"2008","unstructured":"Mohemmed, A. W., Sahoo, N. C., & Geok, T. K. (2008). Solving shortest path problem using particle swarm optimization. Applied Soft Computing, 8(4), 1643\u20131653.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"1792_CR21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10479-011-0947-7","volume":"207","author":"QX Mu","year":"2013","unstructured":"Mu, Q. X., & Eglese, R. W. (2013). Disrupted capacitated vehicle routing problem with order release delay. Annals of Operations Research, 207(1), 201\u2013216.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"1792_CR22","doi-asserted-by":"crossref","first-page":"3658","DOI":"10.1016\/j.asoc.2011.01.037","volume":"11","author":"A Nickabadi","year":"2011","unstructured":"Nickabadi, A., Ebadzadeh, M. M., & Safabakhsh, R. (2011). A novel particle swarm optimization algorithm with adaptive inertia weight. Applied Soft Computing, 11(4), 3658\u20133670.","journal-title":"Applied Soft Computing"},{"issue":"4","key":"1792_CR23","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J. A., & Mead, R. (1965). A simplex method for function minimization. Computer Journal, 7(4), 308\u2013313.","journal-title":"Computer Journal"},{"issue":"3","key":"1792_CR24","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J Renaud","year":"1996","unstructured":"Renaud, J., Laporte, G., & Boctor, F. F. (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research, 23(3), 229\u2013235.","journal-title":"Computers & Operations Research"},{"key":"1792_CR25","unstructured":"Shi, Y., & Eberhart, R. (2001). Fuzzy adaptive particle swarm optimization. In Congress on Evolutionary Computation Seoul, Korea."},{"key":"1792_CR26","doi-asserted-by":"crossref","unstructured":"Yao, B. Z., Hu, P., Lu, X. H., Gao, J. J., & Zhang, M. H. (2014a). Transit network design based on travel time reliability. Transportation Research Part C, 43, 233\u2013248.","DOI":"10.1016\/j.trc.2013.12.005"},{"key":"1792_CR27","doi-asserted-by":"crossref","unstructured":"Yao, B. Z., Hu, P., Zhang, M. H., & Jin, M. Q. (2014b). A support vector machine with the tabu search algorithm for freeway incident detection. International Journal of Applied Mathematics and Computer Science, 24(2), 397\u2013404.","DOI":"10.2478\/amcs-2014-0030"},{"issue":"6","key":"1792_CR28","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1177\/0037549713481503","volume":"89","author":"BZ Yao","year":"2013","unstructured":"Yao, B. Z., Hu, P., Zhang, M. H., & Wang, S. (2013). Artificial bee colony algorithm with scanning strategy for periodic vehicle routing problem. SIMULATION: Transactions of The Society for Modeling and Simulation International, 89(6), 762\u2013770.","journal-title":"SIMULATION: Transactions of The Society for Modeling and Simulation International"},{"key":"1792_CR29","doi-asserted-by":"crossref","unstructured":"Yao, Q. Z., Zhu, X. Y., & Kuo, W. (2014c). A Birnbaum-importance based genetic local search algorithm for component assignment problems. Annals of Operations Research, 212(1), 185\u2013200.","DOI":"10.1007\/s10479-012-1223-1"},{"issue":"2","key":"1792_CR30","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","volume":"47","author":"B Yu","year":"2011","unstructured":"Yu, B., & Yang, Z. Z. (2011). An ant colony optimization model: The period vehicle routing problem with time windows. Transportation Research Part E, 47(2), 166\u2013181.","journal-title":"Transportation Research Part E"},{"key":"1792_CR31","doi-asserted-by":"crossref","unstructured":"Yu, B., Yang, Z. Z., Sun, X. S., Yao, B. Z., Zeng, Q. C., & Jeppesen, E. (2011a). Parallel genetic algorithm in bus route headway optimization. Applied Soft Computing, 11(8), 5081\u20135091.","DOI":"10.1016\/j.asoc.2011.05.051"},{"key":"1792_CR32","doi-asserted-by":"crossref","unstructured":"Yu, B., Yang, Z. Z., Xie, J. X. (2011b). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of The Operational Research Society, 62(1),183\u2013188.","DOI":"10.1057\/jors.2009.161"},{"issue":"1","key":"1792_CR33","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yu","year":"2009","unstructured":"Yu, B., Yang, Z. Z., & Yao, B. Z. (2009). An improved ant colony optimization for vehicle routing problem. European Journal Of Operational Research, 196(1), 171\u2013176.","journal-title":"European Journal Of Operational Research"},{"key":"1792_CR34","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.jtrangeo.2013.09.008","volume":"33","author":"B Yu","year":"2013","unstructured":"Yu, B., Zhu, H. B., Cai, W. J., Ma, N., & Yao, B. Z. (2013). Two-phase optimization approach to transit hub location\u2014The case of Dalian. Journal of Transport Geography, 33, 62\u201371.","journal-title":"Journal of Transport Geography"},{"issue":"5","key":"1792_CR35","first-page":"603","volume":"225","author":"M Yue","year":"2011","unstructured":"Yue, M., & Sun, W. (2011). Non-linear adaptive controller with a variable adaptation rate for a simulated model of an electrohydraulic actuator. Proceedings of Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering., 225(5), 603\u2013609.","journal-title":"Proceedings of Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering."},{"issue":"2","key":"1792_CR36","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2009.05.015","volume":"202","author":"EE Zachariadis","year":"2010","unstructured":"Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2010). An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. European Journal of Operational Research, 202(2), 401\u2013411.","journal-title":"European Journal of Operational Research"},{"key":"1792_CR37","first-page":"50","volume":"30","author":"RH Zhang","year":"2008","unstructured":"Zhang, R. H., & Luo, G. R. (2008). Benefit of the common distribution based on the Shapley value. Wuhan University of Technology Journal, 30, 50\u201354.","journal-title":"Wuhan University of Technology Journal"},{"issue":"10","key":"1792_CR38","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.1016\/j.cor.2011.11.021","volume":"39","author":"T Zhang","year":"2012","unstructured":"Zhang, T., Chaovalitwongse, W. A., & Zhang, Y. J. (2012). Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Computers & Operations Research, 39(10), 2277\u20132290.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1792-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1792-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1792-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:56Z","timestamp":1559138996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1792-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,5]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1792"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1792-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,5]]}}}