{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:32:22Z","timestamp":1777703542602,"version":"3.51.4"},"reference-count":35,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T00:00:00Z","timestamp":1564444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,9,9]]},"abstract":"<jats:p>Horizontal cooperation in logistics refers to several logistics service providers cooperating to accomplish common goals, which usually involves a collaborative vehicle routing problem. In this paper, we present a new collaborative vehicle routing problem with rough location (CVRPRL), which considers both the security of sharing detailed customer information and the configuration of shared resource. We utilize the rough location of the customer to replace the detailed customer location and introduce the concept of collaborative logistics sharing degree in the CVRPRL model. Subsequently, the cost allocation mechanism is designed based on an extended Shapley value, which allocates fixed costs and risks in different ways. Further, an extended ant colony optimization (EACO) algorithm is proposed to solve the CVRPRL. The EACO algorithm combines both large neighborhood search and local search strategies. Finally, we perform a series of simulation experiments to verify the effectiveness of EACO compared with other meta-heuristic algorithms.<\/jats:p>","DOI":"10.3233\/jifs-182715","type":"journal-article","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T12:17:51Z","timestamp":1564748271000},"page":"2385-2402","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":5,"title":["Collaborative vehicle routing problem with rough location using extended ant colony optimization algorithm"],"prefix":"10.1177","volume":"37","author":[{"given":"Mingzhou","family":"Chen","sequence":"first","affiliation":[{"name":"School of Information, Zhejiang University of Finance and Economics, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information, Zhejiang University of Finance and Economics, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information, Zhejiang University of Finance and Economics, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Information, Zhejiang University of Finance and Economics, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,7,30]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.05.023"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.10.048"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2004.07.001"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.03.026"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/inte.2015.0838"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-151752"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2005.09.007"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.11.029"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.09.059"},{"key":"e_1_3_2_13_2","unstructured":"DorigoM. Optimization Learning and Natural Algorithms. Ph. D. Thesis Politecnico di Milano Dipartimento di Elettronica Italy 1992."},{"issue":"5","key":"e_1_3_2_14_2","first-page":"327","article-title":"A new hybrid algorithm to solve the vehicle routing problem in the dynamic environment","volume":"8","author":"Elhassania M.","year":"2013","unstructured":"ElhassaniaM., JaouadB. and AhmedE.A., A new hybrid algorithm to solve the vehicle routing problem in the dynamic environment, International Journal of Soft Computing 8(5) (2013), 327\u2013334.","journal-title":"International Journal of Soft Computing"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.08.051"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.10.021"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2014.01.148"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.08.002"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2015.09.010"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602644"},{"key":"e_1_3_2_21_2","unstructured":"LiuB.D. Uncertainty Theory: An. Introduction to its Axiomatic Foundations. New York: Springer\u2013Verlag Berlin Heidelberg 2004."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.4236\/jssm.2010.31018"},{"key":"e_1_3_2_23_2","unstructured":"Louren\u00c7o H.R. MartinO.C. and St\u00fctzleT. Iterated local search: Framework and applications. In F. Glover and G. Kochenberger editors Handbook of Metaheuristics. Kluwer Academic Publishers 2003 pp. 321\u2013353."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2004.06.029"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2706720"},{"key":"e_1_3_2_26_2","unstructured":"OrI. Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking. Ph. D. Thesis Department of Industrial Engineering and Management Sciences Northwestern University Evanston IL 1976."},{"issue":"4","key":"e_1_3_2_27_2","first-page":"243","article-title":"Horizontal collaboration in logistics: A comprehensive framework","volume":"3","author":"Pomponi F.","year":"2013","unstructured":"PomponiF., FratocchiL., TafuriS.R. and PalumboM., Horizontal collaboration in logistics: A comprehensive framework, Research in Logistics and Production 3(4) (2013), 243\u2013254.","journal-title":"Research in Logistics and Production"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-1949-7"},{"issue":"28","key":"e_1_3_2_30_2","first-page":"307","article-title":"A value for n-person games","volume":"2","author":"Shapley L.S.","year":"1953","unstructured":"ShapleyL.S., A value for n-person games, Contributions to the Theory of Games 2(28) (1953), 307\u2013317.","journal-title":"Contributions to the Theory of Games"},{"key":"e_1_3_2_31_2","first-page":"417","volume-title":"Proceedings of International Conference on Principles and Practice of Constraint Programming","author":"Shaw P.","year":"1998","unstructured":"ShawP., Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of International Conference on Principles and Practice of Constraint Programming, Pisa, Italy, 1998, pp. 417\u2013431."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2017.01.001"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2018.06.208"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.08.035"},{"issue":"3","key":"e_1_3_2_35_2","first-page":"139","article-title":"Solving the open vehicle routing problem by a hybrid ant colony optimization","volume":"41","author":"Yousefikhoshbakht M.","year":"2014","unstructured":"YousefikhoshbakhtM., DidehvarF., RahmatiF., SedighpourM. and AhmadiV., Solving the open vehicle routing problem by a hybrid ant colony optimization, Kuwait Journal of Science and Engineering 41(3) (2014), 139\u2013162.","journal-title":"Kuwait Journal of Science and Engineering"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2010.09.010"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-182715","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-182715","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-182715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:38:57Z","timestamp":1777455537000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-182715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,30]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,9,9]]}},"alternative-id":["10.3233\/JIFS-182715"],"URL":"https:\/\/doi.org\/10.3233\/jifs-182715","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,30]]}}}