Memetic algorithm for the dynamic vehicle routing problem with simultaneous delivery and pickup

被引：10

作者：

Berahhou, Amina ^{[1
]}

Benadada, Youssef ^{[1
]}

Bouanane, Khaoula ^{[1
]}

机构：

[1] Mohammed V Univ, Smart Syst Lab, ENSIAS, Rabat, Morocco

来源：

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS | 2022年 / 13卷 / 04期

关键词：

DVRP; DVRPSDP; Local search; Memetic algorithm; Reverse logistics; ANT COLONY SYSTEM; STRATEGIES; SINGLE; DEPOT;

D O I：

10.5267/j.ijiec.2022.6.001

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In recent years, the Vehicle Routing Problem (VRP) has become an important issue for distribution companies. Also, the rapid development of communication means and the appearance of reverse logistics have given rise to new variants of the VRP. This article deals with an important variant of the VRP which is Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup (DVRPSDP), in which new customers appear during the working day and each customer requires simultaneous delivery and pickup. A Memetic Algorithm (MA) that combines Genetic Algorithm (GA) and local search procedure have been proposed to solve the problem. The performance of the algorithm is evaluated with the tests carried out on a set of benchmarks found in the literature. The proposed memetic algorithm is very efficient and gives many good solutions. (C) 2022 by the authors; licensee Growing Science, Canada

引用

页码：587 / 600

页数：14

共 50 条

[21] Solving vehicle routing problem with simultaneous pickup and delivery using parallel simulated annealing algorithm [J].

Mu, Dong ;

Wang, Chao ;

Zhao, Fu ;

Sutherland, John W. .

INTERNATIONAL JOURNAL OF SHIPPING AND TRANSPORT LOGISTICS, 2016, 8 (01) :81-106

[22] The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction [J].

Fan, Jing .

CEIS 2011, 2011, 15

[23] A hyper heuristic for the green vehicle routing problem with simultaneous pickup and delivery [J].

Olgun, Busra ;

Koc, Cagri ;

Altiparmak, Fulya .

COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 153

[24] A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].

Ai, The Jin ;

Kachitvichyanukul, Voratas .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1693-1702

[25] A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery [J].

Karaoglan, Ismail ;

Altiparmak, Fulya ;

Kara, Imdat ;

Dengiz, Berna .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (02) :318-332

[26] Hybrid Memetic Search for Electric Vehicle Routing With Time Windows, Simultaneous Pickup-Delivery, and Partial Recharges [J].

Zheng, Zubin ;

Liu, Shengcai ;

Ong, Yew-Soon .

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2025,

[27] A memetic algorithm for the flexible periodic vehicle routing problem [J].

Amiri, Banafsheh ;

Ziarati, Koorush ;

Sohrabi, Somayeh .

JOURNAL OF HEURISTICS, 2025, 31 (01)

[28] A Memetic Algorithm for Large-Scale Real-World Vehicle Routing Problems with Simultaneous Pickup and Delivery with Time Windows [J].

Gibbons, Ethan ;

Ombuki-Berman, Beatrice .

METAHEURISTICS, MIC 2024, PT I, 2024, 14753 :78-92

[29] Mathematical model and heuristic approach for solving dynamic vehicle routing problem with simultaneous pickup and delivery: Random iterative local search variable neighborhood descent search [J].

Aydogdu, Burak ;

Ozyoruk, Bahar .

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2020, 35 (02) :563-580

[30] A modified particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].

Zhang, Nian-zhi ;

Sun, Guo-hua ;

Wu, Yao-hua ;

Geng, Fang-hui .

ASCC: 2009 7TH ASIAN CONTROL CONFERENCE, VOLS 1-3, 2009, :1679-1684

← 1 2 3 4 5 →