带装卸顺序约束的装载配送联合优化算法研究
Study on joint optimization algorithm for loading and distribution with loading and unloading sequence constraints
查看参考文献22篇
|
文摘
|
互斥产品(如液体、危险化学品等)不能混装到同一个容器中,物流企业通常使用多隔舱运输车为顾客配送多种互斥产品,合理确定装载与配送路径是提高配送效率、降低配送成本的重要手段.本文考虑互斥产品的装卸顺序约束、在途运输时间约束等,构建了以配送成本最小化为目标的互斥产品装载配送联合优化模型,设计了求解模型的改进遗传算法,算法采用蜂王进化和基于概率的边重构交叉运算,有效提高了寻优能力.本文利用Augerat提供的车辆路径问题标准测试集构造算例测试算法的运行时间和求解效果.结果显示,改进遗传算法的求解效果明显优于经典遗传算法.对于小规模算例,改进的遗传算法可以得到精确最优解,对于中等规模和不超过101个顾客点的大规模算例,改进的遗传算法可以在130秒内得到近似最优解.本文的创新点在于构建了一类新的车辆路径扩展问题的数学模型并设计了求解模型的快速有效算法,为物流企业制定多类型互斥产品配送计划提供了理论依据和算法支持. |
|
其他语种文摘
|
Mutually exclusive products (such as liquids,hazardous chemicals,etc.) cannot be mixed into the same container.Logistics companies usually use multi-compartment trucks to deliver mutually exclusive products to customers.The loading and vehicle routing strategies are the key issues to determine the distribution efficiency and distribution costs.Considering the constraints of loading and unloading sequence and transportation time of mutually exclusive products,a joint optimization model of loading and distribution is constructed to minimize the distribution cost.This paper designs an improved genetic algorithm for solving the model,using the queen evolution and the edge reconstruction crossover operations based on probability to lift the ability of finding the optimal solution.Then we construct the testing examples based on the vehicle routing problem benchmark provided by Augerat to verify the running time and solving efficient of genetic algorithm.The simulation results show that,the solutions obtained by improved genetic algorithm are better than those of classical genetic algorithm,for small-scale examples,the improved genetic algorithm can obtains global optimal solution;for the medium-sized or large size examples with no more than 101 customers,the approximate optimal solution can be obtained in 130 seconds using genetic algorithm.The innovation of this paper lies in the establishment of a mathematical model for a new expended vehicle routing problem and the design of a fast and effective algorithm for solving the model.The mathematical model and algorithm of this paper provide a theoretical basis and algorithmic support for logistics companies to draw up distribution schedule of mutually exclusive products. |
|
来源
|
系统工程理论与实践
,2019,39(12):3097-3110 【核心库】
|
|
DOI
|
10.12011/1000-6788-2019-0258-14
|
|
关键词
|
互斥产品
;
装卸顺序约束
;
装载配送联合优化
;
混合整数规划
;
遗传算法
|
|
地址
|
1.
北京物资学院信息学院, 北京, 101149
2.
清华大学工业工程系, 北京, 100084
3.
中国科学院大学经济与管理学院, 北京, 100190
4.
中国科学院大数据挖掘与知识管理重点实验室, 中国科学院大数据挖掘与知识管理重点实验室, 北京, 100190
|
|
语种
|
中文 |
|
文献类型
|
研究性论文 |
|
ISSN
|
1000-6788 |
|
学科
|
自动化技术、计算机技术 |
|
基金
|
国家自然科学基金
;
北京市自然科学基金
;
北京市属高校高水平创新团队支持计划项目
;
北京市智能物流系统协同创新中心开放课题
|
|
文献收藏号
|
CSCD:6697612
|
参考文献 共
22
共2页
|
|
1.
齐玉东. 基于两次禁忌搜索的军事物资装运方案研究.
计算机工程与设计,2012,33(7):2766-2770
|
CSCD被引
1
次
|
|
|
|
|
2.
颜瑞. 军事空运路径与装载联合优化问题研究.
中国电子科学研究院学报,2017,12(1):7-13
|
CSCD被引
1
次
|
|
|
|
|
3.
钱丹. 多车型联运整车物流配送优化模型及算法研究.
制造业自动化,2015(6):65-68
|
CSCD被引
1
次
|
|
|
|
|
4.
Nowakowski P. A proposal to improve e-waste collection efficiency in urban mining:Container loading and vehicle routing problems-A case study of Poland.
Waste Management,2017,60:494-504
|
CSCD被引
2
次
|
|
|
|
|
5.
符卓. 带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究.
系统工程理论与实践,2004,24(3):123-128
|
CSCD被引
35
次
|
|
|
|
|
6.
Cote J F. The value of integrating loading and routing.
European Journal of Operational Research,2017,257(1):89-105
|
CSCD被引
1
次
|
|
|
|
|
7.
Iori M. An exact approach for the vehicle routing problem with two-dimensional loading constraints.
Transportation science,2007,41(2):253-264
|
CSCD被引
12
次
|
|
|
|
|
8.
王征. 带二维装箱约束的物流配送车辆路径问题.
系统工程理论与实践,2011,31(12):2328-2341
|
CSCD被引
12
次
|
|
|
|
|
9.
髙学东. 考虑物流配送路网结构及配送量约束的客户聚类算法.
系统工程理论与实践,2012,32(1):173-181
|
CSCD被引
1
次
|
|
|
|
|
10.
Gendreau M. A tabu search algorithm for a routing and container loading problem.
Transportation Science,2006,40(3):342-350
|
CSCD被引
13
次
|
|
|
|
|
11.
Zhang D. A hybrid algorithm for a vehicle routing problem with realistic constraints.
Information Sciences,2017,394:167-182
|
CSCD被引
11
次
|
|
|
|
|
12.
王超. 三维装载与CVRP联合多目标优化问题的模型及算法.
控制与决策,2016,31(5):929-934
|
CSCD被引
8
次
|
|
|
|
|
13.
Zachariadis E E. The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints.
European Journal of Operational Research,2016,251(2):369-386
|
CSCD被引
10
次
|
|
|
|
|
14.
Mannel D. A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints.
European Journal of Operational Research,2016,254(3):840-858
|
CSCD被引
8
次
|
|
|
|
|
15.
Benavent E. The multiple vehicle pickup and delivery problem with LIFO constraints.
European Journal of Operational Research,2015,243(3):752-762
|
CSCD被引
3
次
|
|
|
|
|
16.
Doerner K F. Metaheuristics for the vehicle routing problem with loading constraints.
Networks:An International Journal,2007,49(4):294-307
|
CSCD被引
1
次
|
|
|
|
|
17.
Pollaris H. Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints.
Networks,2017,69(3):304-316
|
CSCD被引
2
次
|
|
|
|
|
18.
Pollaris H. Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints.
EURO Journal on Transportation and Logistics,2016,5(2):231-255
|
CSCD被引
2
次
|
|
|
|
|
19.
王旭坪. 基于蚁群禁忌混合算法的成品油多舱配送路径优化研究.
系统工程理论与实践,2017,37(12):3215-3226
|
CSCD被引
15
次
|
|
|
|
|
20.
孙丽君. 考虑司机工作量均衡的成品油配送优化.
系统工程理论与实践,2018,38(3):677-686
|
CSCD被引
9
次
|
|
|
|
|
了解气象卫星更多信息，请访问