运筹与管理 ›› 2022, Vol. 31 ›› Issue (1): 92-98.DOI: 10.12005/orms.2022.0014

• 理论分析与方法探讨 • 上一篇    下一篇

开放式多中心需求可拆分VRP及混沌遗传模拟退火算法

范厚明, 徐振林, 李阳, 杨翔   

  1. 大连海事大学 交通运输工程学院,辽宁 大连 116026
  • 收稿日期:2017-12-27 出版日期:2022-01-25 发布日期:2022-02-11
  • 作者简介:范厚明(1962-),男,山东蓬莱人,博士,教授,博士生导师,研究方向:交通运输规划与管理。
  • 基金资助:
    国家自然科学基金资助项目(61473053);辽宁省教育厅科学技术一般项目(L2014196)

Chaos Genetic Simulated Annealing Algorithm for the Open Multi-depot Split Delivery Vehicle Routing Problem

FAN Hou-ming, XU Zhen-lin, LI Yang, YANG Xiang   

  1. Dalian Maritime University, Transportation Engineering college, Liaoning Dalian 116026
  • Received:2017-12-27 Online:2022-01-25 Published:2022-02-11

摘要: 综合考虑客户需求量允许被拆分、配送系统拥有多个配送中心且车辆可就近返回配送中心的运输模式,建立以配送中心日均建设成本、车辆派遣成本、理货成本和油耗成本之和最小为目标的数学模型,并根据问题特征设计了混沌遗传模拟退火算法对问题进行求解。通过对不同规模以及不同类型的算例进行实验,验证了混沌遗传模拟退火算法求解本文问题的有效性。

关键词: 车辆路径问题, 多中心开放式, 需求可拆分, 混沌遗传算法, 模拟退火算法

Abstract: Considering the transportation mode of customer demand to be split, the distribution system with multiple depots and the vehicle can return the nearest depot, the mathematical model finding out of minimal sum of depots’ daily construction cost, vehicles’ fixed cost, tally cost and energy consumption cost is formulated. According to the characters of problem, the chaos genetic simulated annealing algorithm is designed to solve it. The effectiveness of the chaos genetic simulated annealing algorithm to solve this problem studied in this paper is verified by instances on different scale and different types.

Key words: vehicle routing problem, open multi-depot, split delivery, chaos genetic algorithm, simulated annealing algorithm

中图分类号: