系统仿真学报 ›› 2021, Vol. 33 ›› Issue (10): 2518-2531.doi: 10.16182/j.issn1004731x.joss.20-0685

• 国民经济仿真 • 上一篇    

共同配送选址-路径问题及大邻域搜索算法

李珍萍1, 赵雨薇1,2, 张煜炜1,3, 邢立宁4, 任腾5,*   

  1. 1.北京物资学院 信息学院,北京 101149;
    2.北京化工大学 经济管理学院,北京 100029;
    3.首都经济贸易大学 管理工程学院,北京 100070;
    4 国防科技大学 信息系统与管理学院,湖南 长沙 410003;
    5.中南林业科技大学 物流与交通学院,湖南 长沙 410004
  • 收稿日期:2020-09-10 修回日期:2020-11-22 出版日期:2021-10-18 发布日期:2021-10-18
  • 通讯作者: 任腾(1988-),男,博士,副教授,研究方向为物流工程与管理、复杂系统建模与仿真。E-mail: chinarenteng@163.com
  • 作者简介:李珍萍(1966-),女,博士,教授,研究方向为物流网络优化、智能算法。E-mail:lizhenping66@163.com
  • 基金资助:
    国家自然科学基金(71771028),北京自然科学基金(9212004, Z180005),北京市属高校高水平科研创新团队建设项目(IDHT20180510)

Joint Distribution Location-routing Problem and Large Neighborhood Search Algorithm

Li Zhenping1, Zhao Yuwei1,2, Zhang Yuwei1,3, Xing Lining4, Ren Teng5,*   

  1. 1. School of Information, Beijing Wuzi University, Beijing 101149, China;
    2. School of Economics and Management, Beijing University of Chemical Technology, Beijing 100029,China;
    3. School of Management Engineering, Capital University of Economics and Business, Beijing 100070, China;
    4. School of Information System and Management, University of National Defense Science and Technology, Changsha 410003, China;
    5. School of Logistics and transportation, Central South University of Forestry and Technology, Changsha 410004, China
  • Received:2020-09-10 Revised:2020-11-22 Online:2021-10-18 Published:2021-10-18

摘要: 结合城市物流共同配送体系两层级、多中心、多车型等特点,研究了两层级共同配送选址-路径问题。以总成本极小化为目标,建立该问题混合整数规划模型,设计求解模型的自适应大邻域搜索算法。算法应用多种删除操作符和插入操作符生成邻域解,根据每次迭代得到的邻域解优劣调整相应操作符的选择概率,加快收敛速度。利用选址-路径问题的标准测试集生成若干算例,分别利用自适应大邻域搜索算法和Gurobi软件进行求解,通过对比分析验证自适应大邻域搜索算法的快速有效性。

关键词: 两层级共同配送, 选址-路径问题, 混合整数规划, 自适应大邻域搜索, 模拟退火

Abstract: Based on the characteristics of two-echelon, multi-center, and heterogeneous fleets in urban logistics joint distribution system, the two-echelon joint distribution location routing problem is studied. The problem is formulated into a mixed integer programming model to minimize the total costs. An adaptive large neighborhood search algorithm (ALNS) for solving the model with multiple deletion and insertion operators is proposed to obtain neighborhood solution. The selection probability of each operator is adjusted according to the neighborhood solution to accelerate the convergence speed. Several test examples are generated based on the benchmark of location-routing problem. Both ALNS algorithm and Gurobi software are used to solve the problem respectively, and the fast effectiveness of the ALNS algorithm is verified by comparative analysis.

Key words: two-echelon joint distribution, location-routing problem, mixed integer programming, adaptive large neighborhood search, simulated annealing

中图分类号: