摘要
针对城市物流系统中的多物流中心联合配送问题,设计一种多物流中心处理方法共享物流资源;分析城市路网的时变特性,设计路段行驶时间计算方法;综合考虑客户需求、时间窗、车辆不同出发时间、油耗、碳排放与联合配送模式等因素,以总成本最小为目标构建联合配送的开放式时变车辆路径规划模型,设计改进蚁群算法求解;实验结果表明以上方法具有可行性与有效性。
The multi-depot vehicle routing problem based on joint distribution mode in urban logistics system is studied.A multi-depot processing method is proposed in order to share all logistics resources.A calculating method for the road travel time is designed based on the time-dependent characteristics of urban road network.A mathematical model for the open time-dependent vehicle routing problem based on joint distribution mode is formulated by considering customer demand,time window,flexible vehicle departure time,fuel consumption,carbon emissions,and joint distribution mode.The objective of the model is to minimize total cost.An improved ant colony algorithm is designed to solve the problem.The experimental results verify the feasibility and validity of the proposed approaches.
作者
刘长石
王松
罗亮
邓胜前
LIU Chang-shi;WANG Song;LUO Liang;DENG Sheng-qian(School of Business and Management, Hunan University of Technology and Business, Changsha 410205, China;Key Laboratory of Hunan Province for Statistical Learning and Intelligent Computation, Hunan University of Technology and Business, Changsha 410205, China;Logistics System Optimization and Operation Management Innovation Team of Collages in Hunan Province, Hunan University of Technology and Business, Changsha410205, China)
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2021年第11期26-33,共8页
Operations Research and Management Science
基金
国家社科基金一般项目(17BJL091)
国家自然科学基金面上项目(71972069)
湖南省自科基金一般项目(2019JJ40147,2021JJ30195)
湖南省社科基金一般项目(16YBG004,18YBA267)
湖南省教育厅一般课题(17C0881,18A297,20C0533)
湖南省社科评审委一般项目(XSP20YBC251)。
关键词
时变路网
联合配送
多物流中心
开放式车辆路径问题
蚁群算法
time-dependent road network
joint distribution
multi-depot
open vehicle routing problem
ant colony algorithm
