基于蚁群算法的共享快递盒配送回收网络优化研究  

Optimization of Delivery and Pick-up Networks of Shared Express Boxes Based on the Ant Colony Algorithm

作　　者：牟能冶[1,2] 贾程方 康秋萍 龚迪 MU Neng-ye;JIA Cheng-fang;KANG Qiu-ping;GONG Di(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 611756,China;National United Engineering Laboratory of Integrated and Intelligent Transportation,Chengdu 611756,China)

机构地区：[1]西南交通大学交通运输与物流学院,成都611756 [2]综合交通运输智能化国家地方联合工程实验室,成都611756

出　　处：《交通运输工程与信息学报》2021年第1期33-42,共10页Journal of Transportation Engineering and Information

基　　金：国家社会科学基金资助项目(17BGL085);成都市科技项目(2019-RK00-00105-ZF)。

摘　　要：为解决共享快递盒配送与回收分离的模式所带来的成本高昂、快递员工作量大且分配不均的问题,本文构建了带时间窗的、配送量与回收量不确定的、同时配送与回收的多目标路径优化模型,并设计改进的蚁群算法进行算例求解。算例结果表明,同时配送与回收的总成本较分离模式下降45.9%,且在保证快递员合理工作量的前提下,尽量选择较大载重量的汽车与较小的单位惩罚成本,可以有效降低网络运行的总成本,验证了模型和算法的有效性和可行性。To solve the problem of the high cost,heavy workload,and uneven distribution of couriers caused by the separate delivery and pick-up modes of shared express boxes,a multi-objective route optimization model of simultaneous delivery and pick-up was constructed with a time window,uncertain delivery,and uncertain recycling.An improved ant colony algorithm was designed to solve the model.The results of a numerical example show that the total cost of simultaneous delivery and pick-up is 45.9%lower than that of the separate-modes model,and the total network operation cost can be effectively reduced by choosing a vehicle with a larger load and smaller unit penalty cost on the premise of a reasonable workload for couriers,which verifies the validity and feasibility of the model and algorithm.

关 键 词：快递包装 路径优化 蚁群算法 共享快递盒 同时配送与回收 

分 类 号：F252[经济管理—国民经济]