首页 | 本学科首页   官方微博 | 高级检索  
     检索      

速度时变的多中心半开放式车辆路径问题研究
引用本文:张凯庆,嵇启春.速度时变的多中心半开放式车辆路径问题研究[J].系统仿真学报,2022,34(4):836-846.
作者姓名:张凯庆  嵇启春
作者单位:西安建筑科技大学 信息与控制工程学院,陕西 西安 710399
摘    要:针对多中心半开放式车辆路径问题,考虑软时间窗约束和车辆速度变化情况,构建了最大化平均客户满意度、最短配送距离和最小配送成本为目标的优化模型,并设计了两阶段求解算法.基于自适应网格密度法和邻域拥挤密度法对多目标粒子群算法的外部档案进行维护及选取全局最优粒子,提高算法的收敛性和后期种群多样性,以获得初始可行解.用变邻域搜索...

关 键 词:速度时变  软时间窗  多中心半开放式  多目标粒子群算法  变邻域搜索算法
收稿时间:2020-11-18

Research on Multi-depot Half-open Vehicle Routing Problem with Time-varying Speed
Kaiqing Zhang,Qichun Ji.Research on Multi-depot Half-open Vehicle Routing Problem with Time-varying Speed[J].Journal of System Simulation,2022,34(4):836-846.
Authors:Kaiqing Zhang  Qichun Ji
Institution:School of Information and Control Engineering, Xi'an University of Architecture and Technology, Xi'an 710399, China
Abstract:Aiming at the multi-depot half-open vehicle routing problem and consideringthe soft time window constraints and vehicle speed changes, an optimization model with the goal of maximizing average customer satisfaction, shortest distribution distance and minimum distribution cost is established and a two-stage solution algorithm is designed. The self-adaptive grid density method and neighborhood crowding density method are used to maintain the external archives and to select the global optimal particles, and the convergence of the multi-objective particle swarm optimization (MOPSO) and the diversity of the later population can be improved to obtain the initial feasible solution. The initial feasible solution is optimized by the variable neighborhood search algorithm(VNS) to reduce the delivery distance and cost.The rationality of the model and the effectiveness of the two-stage algorithm design are verified by the simulation experiments.
Keywords:ime-varying speed  soft time window  multi-depot half-open  multi-objective particle swarm optimization  variable neighborhood search algorith  
点击此处可从《系统仿真学报》浏览原始摘要信息
点击此处可从《系统仿真学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号