{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:28:32Z","timestamp":1777696112775,"version":"3.51.4"},"reference-count":33,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2022,1,14]]},"abstract":"<jats:p>In this paper, the Capacitated Vehicle Routing Problem (CVRP) of multi-depot express delivery is investigated based on the actual express delivery business in Beijing and driving intention-based road network. An Adaptive Simulated Annealing and Artificial Fish Swarm Algorithm (A-SAAFSA) is proposed to solve the CVRP. The basic ideas are use a \u201ccertainty\u201d probability to accept the worst solution through the Metropolis criterion in the search process, and a strategy of adjusting the swimming direction to avoid falling into the local optimal solution. Moreover, an adaptive visual strategy, which adjusts the visual range adaptively in real time according to the current solution quality, is used to ensure the efficient searching and accuracy of the algorithm. Experimental results show that the A-SAAFSA algorithm outperforms four well-known algorithms, namely simulated annealing and artificial fish swarm algorithm, artificial fish swarm algorithm, simulated annealing algorithm, and genetic algorithm.<\/jats:p>","DOI":"10.3233\/ida-205693","type":"journal-article","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T14:51:19Z","timestamp":1642517479000},"page":"239-256","source":"Crossref","is-referenced-by-count":13,"title":["An adaptive simulated annealing and artificial fish swarm algorithm for the optimization of multi-depot express delivery vehicle routing"],"prefix":"10.1177","volume":"26","author":[{"given":"Mengfei","family":"Yuan","sequence":"first","affiliation":[{"name":"School of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiu","family":"Kan","sequence":"additional","affiliation":[{"name":"School of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China"},{"name":"School of Mathematics, Southeast University, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chihung","family":"Chi","sequence":"additional","affiliation":[{"name":"Data61 in CSIRO, Sandy Bay, Hobart, Tasmania, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huisheng","family":"Shu","sequence":"additional","affiliation":[{"name":"School of Science, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixuan","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-205693_ref1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.3233\/IDA-205693_ref2","first-page":"67","article-title":"Routing and scheduling of vehicles and crews: The state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operations Research"},{"key":"10.3233\/IDA-205693_ref3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","article-title":"A review of dynamic vehicle routing problems","volume":"225","author":"Pillac","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/IDA-205693_ref4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","article-title":"The vehicle routing problem: State of the art classification and review","volume":"99","author":"Braekers","year":"2016","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/IDA-205693_ref5","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.2019.1924","article-title":"The distributionally robust chance constrained vehicle routing problem","volume":"68","author":"Ghosal","year":"2020","journal-title":"Operations Research"},{"key":"10.3233\/IDA-205693_ref6","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ijar.2018.02.003","article-title":"The capacitated vehicle routing problem with evidential demands","volume":"95","author":"Helal","year":"2018","journal-title":"International Journal of Approximate Reasoning"},{"key":"10.3233\/IDA-205693_ref7","doi-asserted-by":"crossref","unstructured":"E. Teymourian, V. Kayvanfar, G.M. Komaki and M. Zandieh, Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem, Information Sciences (2016), 334\u2013335, 354\u2013378.","DOI":"10.1016\/j.ins.2015.11.036"},{"key":"10.3233\/IDA-205693_ref8","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1057\/s41274-016-0170-7","article-title":"A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service","volume":"68","author":"Wang","year":"2017","journal-title":"Journal of the Operational Research Society"},{"key":"10.3233\/IDA-205693_ref9","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","article-title":"A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows","volume":"490","author":"Zhang","year":"2019","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-205693_ref10","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1080\/00207543.2016.1220685","article-title":"Modelling and solution of a large-scale vehicle routing problem at GE appliances & lighting","volume":"55","author":"Khodabandeh","year":"2017","journal-title":"International Journal of Production Research"},{"key":"10.3233\/IDA-205693_ref11","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1057\/jors.2011.25","article-title":"An incremental tabu search heuristic for the generalized vehicle routing problem with time windows","volume":"63","author":"Moccia","year":"2012","journal-title":"Journal of the Operational Research Society"},{"key":"10.3233\/IDA-205693_ref12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/trsc.2016.0705","article-title":"The time window assignment vehicle routing problem with time-dependent travel times","volume":"52","author":"Remy","year":"2018","journal-title":"Transportation Science"},{"key":"10.3233\/IDA-205693_ref13","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum K-trees","volume":"42","author":"Fisher","year":"1994","journal-title":"Operations Research"},{"key":"10.3233\/IDA-205693_ref14","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing under capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"key":"10.3233\/IDA-205693_ref15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.2009.161","article-title":"A parallel improved ant colony optimization for multi-depot vehicle routing problem","volume":"62","author":"Yu","year":"2011","journal-title":"Journal of the Operational Research Society"},{"key":"10.3233\/IDA-205693_ref16","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s10479-017-2567-3","article-title":"A meta-heuristic for capacitated green vehicle routing problem","volume":"269","author":"Zhang","year":"2018","journal-title":"Annals of Operations Research"},{"key":"10.3233\/IDA-205693_ref17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.ins.2018.11.006","article-title":"A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem","volume":"478","author":"Long","year":"2019","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-205693_ref18","doi-asserted-by":"crossref","first-page":"5005","DOI":"10.1080\/00207543.2017.1378955","article-title":"A coordinated algorithm for integrated production scheduling and vehicle routing problem","volume":"56","author":"Zou","year":"2018","journal-title":"International Journal of Production Research"},{"key":"10.3233\/IDA-205693_ref19","doi-asserted-by":"crossref","first-page":"S175","DOI":"10.3233\/IDA-192791","article-title":"A GPS location data clustering approach based on a niche genetic algorithm and hybrid K-means","volume":"23","author":"Ma","year":"2019","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-205693_ref20","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.3390\/app9081655","article-title":"An application of simulated annealing in compensation of nonlinearity of scanners","volume":"9","author":"Manwar","year":"2019","journal-title":"Applied Sciences"},{"key":"10.3233\/IDA-205693_ref21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.3233\/IDA-173740","article-title":"Ant colony optimization for text feature selection in sentiment analysis","volume":"23","author":"Ahmad","year":"2019","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-205693_ref22","doi-asserted-by":"crossref","first-page":"293","DOI":"10.5194\/isprs-archives-XLII-4-W18-293-2019","article-title":"A hybrid optimization method for vehicle routing problem using artificial bee colony and genetic algorithm","volume":"XLII-5","author":"Davoodi","year":"2019","journal-title":"International Archives of the Photogrammetry, Remote Sensing & Spatial Information Sciences"},{"key":"10.3233\/IDA-205693_ref23","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1016\/j.procs.2019.09.291","article-title":"A new approach based on the hybridization of simulated annealing algorithm and tabu search to solve the static ambulance routing problem","volume":"159","author":"Zidi","year":"2019","journal-title":"Procedia Computer Science"},{"key":"10.3233\/IDA-205693_ref24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/su11236584","article-title":"Optimization of transportation routing problem for fresh food by improved ant colony algorithm based on tabu search","volume":"11","author":"Chen","year":"2019","journal-title":"Sustainability"},{"key":"10.3233\/IDA-205693_ref26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129183119500979","article-title":"Tree hierarchical directed evacuation network model based on artificial fish swarm algorithm","volume":"30","author":"Zong","year":"2019","journal-title":"International Journal of Modern Physics C: Computational Physics & Physical Computation"},{"key":"10.3233\/IDA-205693_ref27","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.oceaneng.2018.08.031","article-title":"Optimization of tuned mass damper parameters for floating wind turbines by using the artificial fish swarm algorithm","volume":"167","author":"Jin","year":"2018","journal-title":"Ocean Engineering"},{"key":"10.3233\/IDA-205693_ref28","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1049\/iet-com.2017.0149","article-title":"Artificial fish swarm based power allocation algorithm for MIMO-OFDM relay underwater acoustic communication","volume":"12","author":"Zhou","year":"2018","journal-title":"IET Communications"},{"key":"10.3233\/IDA-205693_ref29","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1007\/s10489-017-1027-8","article-title":"Selective ensemble based on extreme learning machine and improved discrete artificial fish swarm algorithm for haze forecast","volume":"48","author":"Ni","year":"2018","journal-title":"Applied Intelligence"},{"key":"10.3233\/IDA-205693_ref30","first-page":"78","article-title":"Research on port logistics distribution route planning based on artificial fish swarm algorithm","volume":"SI","author":"Fei","year":"2020","journal-title":"Journal of Coastal Research"},{"key":"10.3233\/IDA-205693_ref31","doi-asserted-by":"crossref","first-page":"106561","DOI":"10.1016\/j.asoc.2020.106561","article-title":"Metaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics","volume":"95","author":"Song","year":"2020","journal-title":"Applied Soft Computing"},{"key":"10.3233\/IDA-205693_ref32","first-page":"106111L","article-title":"Application of hybrid artificial fish swarm algorithm based on similar fragments in VRP","volume":"10611","author":"Che","year":"2018","journal-title":"Proceedings of the SPIE"},{"key":"10.3233\/IDA-205693_ref33","first-page":"1","article-title":"Application of artificial fish swarm algorithm in vehicle routing problem","volume":"952","author":"Jia","year":"2018","journal-title":"Bio-inspired Computing: Theories and Applications"},{"key":"10.3233\/IDA-205693_ref36","unstructured":"BaiduMap., Transportation big data research center, Institute of data science, Tsinghua University, School of communications, Southeast University, Institute of Financial Strategy, Chinese Academy of Social Sciences, Saiwen Transportation Network, KuWeather, Baidu Apollo Platform, Baidu Sonar, Baidu Index, Baidu Encyclopedia, 2019 China Urban Traffic Report. http:\/\/jiaotong.baidu.com\/landings\/landing?id=50."}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-205693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:19:17Z","timestamp":1777454357000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-205693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,14]]},"references-count":33,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/ida-205693","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,14]]}}}