{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:13:23Z","timestamp":1780107203418,"version":"3.54.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T00:00:00Z","timestamp":1495584000000},"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":[[2019,2]]},"DOI":"10.1007\/s10479-017-2531-2","type":"journal-article","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T14:53:44Z","timestamp":1495637624000},"page":"163-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Fresh seafood delivery routing problem using an improved ant colony optimization"],"prefix":"10.1007","volume":"273","author":[{"given":"Baozhen","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaolin","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoli","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"2531_CR1","doi-asserted-by":"crossref","unstructured":"Albritton M. D., & Mcmullen, P. R. (2007). Optimal product design using a colony of virtual ants. European Journal of Operational Research, 176(1), 498\u2013520.","DOI":"10.1016\/j.ejor.2005.06.042"},{"issue":"2","key":"2531_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0377-2217(01)00206-5","volume":"137","author":"E Angelelli","year":"2002","unstructured":"Angelelli, E., & Speranza, M. G. (2002). The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research, 137(2), 233\u2013247.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"2531_CR3","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.trc.2010.08.003","volume":"19","author":"N Aras","year":"2011","unstructured":"Aras, N., Aksen, D., & Tekin, M. T. (2011). Selective multi-depot vehicle routing problem with pricing. Transportation Research Part C: Emerging Technologies, 19(5), 866\u2013884.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"8","key":"2531_CR4","doi-asserted-by":"publisher","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":"2531_CR5","unstructured":"Bullnheimer, B., Hartl, R. F., & Strauss, C. (1997). Applying the ant system to the vehicle routing problem. In Second metaheuristics international conference, MIC\u201997, Sophia-Antipolis France."},{"key":"2531_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89, 319\u2013328.","journal-title":"Annals of Operations Research"},{"issue":"3\u20134","key":"2531_CR7","first-page":"311","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 best known solutions. American Journal of Mathematical and Management Sciences, 13(3\u20134), 311\u2013406.","journal-title":"American Journal of Mathematical and Management Sciences"},{"issue":"2","key":"2531_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/10170660609509001","volume":"23","author":"CH Chen","year":"2006","unstructured":"Chen, C. H., & Ting, C. J. (2006). An improved ant colony system algorithm for the vehicle routing problem. Journal of the Chinese Institute of Industrial Engineers, 23(2), 115\u2013126.","journal-title":"Journal of the Chinese Institute of Industrial Engineers"},{"key":"2531_CR9","doi-asserted-by":"publisher","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"},{"issue":"1","key":"2531_CR10","first-page":"39","volume":"34","author":"A Colorni","year":"1994","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994). Ant system for job-shop scheduling. Jorbel-Belgian Journal of Operations Research Statistics and Computer Science, 34(1), 39\u201353.","journal-title":"Jorbel-Belgian Journal of Operations Research Statistics and Computer Science"},{"key":"2531_CR11","doi-asserted-by":"publisher","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., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105\u2013119.","journal-title":"Networks"},{"issue":"3","key":"2531_CR12","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.cor.2007.11.007","volume":"36","author":"F Cornillier","year":"2009","unstructured":"Cornillier, F., Laporte, G., Boctor, F. F., & Renaud, J. (2009). The petrol station replenishment problem with time windows. Computers and Operations Research, 36(3), 919\u2013935.","journal-title":"Computers and Operations Research"},{"key":"2531_CR13","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G. A. (1958). A method for solving traveling salesman problems. Operations Research, 6, 791\u2013812.","journal-title":"Operations Research"},{"issue":"2","key":"2531_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.compchemeng.2008.10.003","volume":"33","author":"RG Dondo","year":"2009","unstructured":"Dondo, R. G., & Cerd\u00e1, J. (2009). A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Computers and Chemical Engineering, 33(2), 513\u2013530.","journal-title":"Computers and Chemical Engineering"},{"issue":"26","key":"2531_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"1","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., & Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Mans, and Cybernetics, 1(26), 29\u201341.","journal-title":"IEEE Transactions on Systems, Mans, and Cybernetics"},{"key":"2531_CR16","doi-asserted-by":"crossref","unstructured":"Filipec, M., Skrlec, D., & Krajcar, S. (1997). Darwin meets computers: New approach to multiple depot capacitated vehicle routing problem. In 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation. (Vol. 1, pp. 421\u2013426). IEEE.","DOI":"10.1109\/ICSMC.1997.625786"},{"key":"2531_CR17","unstructured":"Gambardella, L., Taillard, E., & Dorigo, M. (1997). Ant colonies for the QAP. Technical Report 97-4. Lugano: IDSIA."},{"issue":"6","key":"2531_CR18","doi-asserted-by":"publisher","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(6), 711\u2013718.","journal-title":"Omega"},{"issue":"4","key":"2531_CR19","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","volume":"21","author":"W Ho","year":"2008","unstructured":"Ho, W., Ho, G. T. S., Ji, P., & Lau, H. C. W. (2008). A hybrid genetic algorithm for the multi-depot vehicle routing problem. Engineering Applications of Artificial Intelligence, 21(4), 548\u2013557.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"2531_CR20","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.jfoodeng.2006.05.029","volume":"80","author":"CI Hsu","year":"2007","unstructured":"Hsu, C. I., Hung, S. F., & Li, H. C. (2007). Vehicle routing problem with time-windows for perishable food delivery. Journal of Food Engineering, 80(2), 465\u2013475.","journal-title":"Journal of Food Engineering"},{"key":"2531_CR21","unstructured":"Lim, A., & Zhu, W. (2006). A fast and effective insertion algorithm for multi-depot vehicle routing problem with fixed distribution of vehicles and a new simulated annealing approach. In International conference on industrial, engineering and other applications of applied intelligent systems (pp. 282\u2013291). Berlin, Heidelberg: Springer."},{"key":"2531_CR22","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2014.03.004","volume":"72","author":"JP Luo","year":"2014","unstructured":"Luo, J. P., & Chen, M. R. (2014). Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW. Computers and Industrial Engineering, 72, 84\u201397.","journal-title":"Computers and Industrial Engineering"},{"issue":"6","key":"2531_CR23","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.rcim.2010.06.023","volume":"26","author":"M Mirabi","year":"2010","unstructured":"Mirabi, M., Fatemi Ghomib, S. M. T., & Jolaic, F. (2010). Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem. Robotics and Computer-Integrated Manufacturing, 26(6), 564\u2013569.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"2531_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","volume":"79","author":"JR Montoya-Torres","year":"2015","unstructured":"Montoya-Torres, J. R., Franco, J. L., Isaza, S. N., Jim\u00e9nez, H. F., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers and Industrial Engineering, 79, 115\u2013129.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"2531_CR25","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10732-013-9221-2","volume":"19","author":"A Rahimi-Vahed","year":"2013","unstructured":"Rahimi-Vahed, A., Crainic, T. G., Gendreau, M., & Rei, W. (2013). A path relinking algorithm for a multi-depot periodic vehicle routing problem. Journal of Heuristics, 19(3), 497\u2013524.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"2531_CR26","doi-asserted-by":"publisher","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 and Operations Research, 23(3), 229\u2013235.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2531_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1177\/105971239700500203","volume":"5","author":"R Schoonderwoerd","year":"1997","unstructured":"Schoonderwoerd, R., Holland, O., Bruten, J., & Rothkrantz, L. (1997). Ant-based load balancing in telecommunications networks. Adaptive Behavior, 5(2), 169\u2013207.","journal-title":"Adaptive Behavior"},{"key":"2531_CR28","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tre.2013.11.003","volume":"61","author":"W Tu","year":"2014","unstructured":"Tu, W., Fang, Z., Li, Q., Shaw, S. L., & Chen, B. (2014). A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 61, 84\u201397.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"2531_CR29","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012). A hybrid genetic algorithm for multidepot and periodic vehicle routing p Vidal roblems. Operations Research, 60(3), 611\u2013624.","journal-title":"Operations Research"},{"issue":"1","key":"2531_CR30","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2013.12.044","volume":"237","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research, 237(1), 15\u201328.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"2531_CR31","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","volume":"29","author":"TH Wu","year":"2002","unstructured":"Wu, T. H., Low, C., & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research, 29(10), 1393\u20131415.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"2531_CR32","first-page":"1","volume":"26","author":"BZ Yao","year":"2014","unstructured":"Yao, B. Z., Hu, P., Zhang, M. H., & Tian, X. M. (2014). Improved ant colony optimization for seafood product delivery routing problem. PROMET-TRAFFIC and Transportation, 26(1), 1\u201310.","journal-title":"PROMET-TRAFFIC and Transportation"},{"issue":"6","key":"2531_CR33","doi-asserted-by":"publisher","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"},{"issue":"2","key":"2531_CR34","doi-asserted-by":"publisher","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":"2531_CR35","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1057\/jors.2009.161","volume":"62","author":"B Yu","year":"2011","unstructured":"Yu, B., Yang, Z. Z., & Xie, J. X. (2011). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society, 62, 183\u2013188.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"2531_CR36","doi-asserted-by":"publisher","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"},{"issue":"9","key":"2531_CR37","doi-asserted-by":"publisher","first-page":"11859","DOI":"10.1016\/j.eswa.2011.03.077","volume":"38","author":"GN Y\u00fccenur","year":"2011","unstructured":"Y\u00fccenur, G. N., & Demirel, N. \u00c7. (2011). A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, 38(9), 11859\u201311865.","journal-title":"Expert Systems with Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2531-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2531-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2531-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T13:38:19Z","timestamp":1581082699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2531-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,24]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["2531"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2531-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,24]]},"assertion":[{"value":"24 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}