Variable neighborhood search for the multi-objective multi-compartment optimization of refined products distribution

被引：0

作者：

Zhan H. ^{[1
]}

Wang X. ^{[1
,2
]}

Sun Z. ^{[1
]}

He H. ^{[1
]}

机构：

[1] Institute of Systems Engineering, Dalian University of Technology, Dalian

[2] School of Business, Dalian University of Technology, Panjin

来源：

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice | 2019年 / 39卷 / 10期

基金：

中国国家自然科学基金;

关键词：

Multi-compartment; Multi-objective optimization; Refined products distribution; VNS;

D O I：

10.12011/1000-6788-2017-0958-16

中图分类号：

学科分类号：

摘要：

Refined products distribution is an extension of the multi-compartment vehicle routing problem, which has to simultaneously consider the vehicle routing, the assignment of heterogonous trucks and loading policies of multi-compartment. An optimum model is developed with the objectives of minimizing the transport cost, the transport risk, and the time penalty cost. This article proposes a multi-objective variable neighborhood search (MOVNS) framework based on neighborhood search, which derive three MOVNS algorithms (MOVNS-1, MOVNS-2, MOVNS-3) when combined with different searching strategies and comparison criteria of feasible solutions. And extensive computational tests on 12 instances confirm the efficiency of the proposed algorithms. MOVNS-2 is equipped with stronger local search ability, and MOVNS-3 could avoid the poor local optimum effectively. Moreover, the route construction with relation degree between vertexes and the parallel search strategy can enhance the search ability of the algorithm. © 2019, Editorial Board of Journal of Systems Engineering Society of China. All right reserved.

引用

页码：2660 / 2675

页数：15

共 22 条

[1]

El-Fallahi A., Prins C., Calvo R.W., A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Computers & Operations Research, 35, 5, pp. 1725-1741, (2008)

[2]

Muyldermans L., Pang G., On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm, European Journal of Operational Research, 206, 1, pp. 93-103, (2010)

[3]

Henke T., Speranza M.G., Wascher G., The multi-compartment vehicle routing problem with flexible compartment sizes, European Journal of Operational Research, 246, 3, pp. 730-743, (2015)

[4]

Shi L., Statistical analysis of dangerous goods road transportation accidents and the establishment of integrated management system, (2014)

[5]

Cornillier F., Boctor F., Laporte G., Et al., A heuristic for the multi-period petrol station replenishment problem, European Journal of Operational Research, 191, 2, pp. 295-305, (2008)

[6]

Cornillier F., Boctor F., Renaud J., Heuristics for the multi-depot petrol station replenishment problem with time windows, European Journal of Operational Research, 220, 2, pp. 361-369, (2012)

[7]

Cornillier F., Laporte G., Boctor F., Et al., The petrol station replenishment problem with time windows, Computers & Operations Research, 36, 3, pp. 919-935, (2009)

[8]

Boctor F., Renaud J., Cornillier F., Trip packing in petrol stations replenishment, Omega, 39, 1, pp. 86-98, (2011)

[9]

Popovic D., Vidovic M., Radivojevic G., Variable neighborhood search heuristic for the inventory routing problem in fuel delivery, Expert Systems with Applications, 39, 18, pp. 13390-13398, (2012)

[10]

Ma Y.F., Sun X.Y., Dispatching optimization model of second distribution of gasolin & diesel oil and solution based on genetic algorithm, Operations Research and Management Science, 19, 6, pp. 73-78, (2010)

← 1 2 3 →