太原理工大学学报2025，Vol.56Issue(6)：1101-1109,9.DOI:10.16355/j.tyut.1007-9432.20200940
基于ISTASA算法的带软时间窗的车辆路径问题研究
Research on Vehicle Routing Problem with Soft Time Window Based on ISTASA Algorithm
摘要
Abstract
[Purposes]The vehicle routing problem with time windows is a classical combinato-rial optimization problem,which is the key of logistics distribution system.In actual logistics distribu-tion,enterprises often use the method of compensating for delayed delivery to solve the problem of dis-tribution overtime,so as to improve customer satisfaction.[Methods]Regarding this case,the ca-pacitated vehicle routing problem with soft time window(CVRPSTW)was proposed,and uses the penalty function method was used to establish a CVRPSTW optimization model with the goal of mini-mizing total transportation cost.Unreasonable optimization methods usually have problems such as low efficiency and poor solution quality.In order to better solve CVRPSTW,an improved state transi-tion simulated annealing(ISTASA)algorithm based on the state transition simulated annealing(STASA)algorithm was proposed.In this study,the Solomon benchmark was used as examples,and ISTASA algorithm,STASA algorithm,and some classical heuristic algorithms were used to solve CVRPSTW.The effectiveness of ISTASA algorithm was verified by comparing the solution quality of each algorithm.[Results]The results show that the solution quality of ISTASA algorithm is signifi-cantly better than that of other methods in most Solomon instances.关键词
车辆路径问题/软时间窗/总运输成本/罚函数法/改进状态转移模拟退火算法Key words
vehicle routing problem/soft time windows/total transportation cost/penalty func-tion method/improved state transition simulated annealing algorithm分类
信息技术与安全科学引用本文复制引用
王名霞,韩晓霞,曹阳,武晋德,申亚迪..基于ISTASA算法的带软时间窗的车辆路径问题研究[J].太原理工大学学报,2025,56(6):1101-1109,9.基金项目
国家自然科学基金资助项目(62176176) （62176176）
