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

被引：11

作者：

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 条

[31] A Memetic Algorithm for the Green Vehicle Routing Problem [J].

Peng, Bo ;

Zhang, Yuan ;

Gajpal, Yuvraj ;

Chen, Xiding .

SUSTAINABILITY, 2019, 11 (21)

[32] An effective memetic algorithm with population management for the split delivery vehicle routing problem [J].

Boudia, Mourad ;

Prins, Christian ;

Reghioui, Mohamed .

HYBRID METAHEURISTICS, PROCEEDINGS, 2007, 4771 :16-30

[33] A variable neighborhood search algorithm with constraint relaxation for the two-echelon vehicle routing problem with simultaneous delivery and pickup demands [J].

Liu, Ran ;

Jiang, Shan .

SOFT COMPUTING, 2022, 26 (17) :8879-8896

[34] Application of a Hybrid Genetic Algorithm to Solve the Multi-Depots Vehicle Routing Problem with Simultaneous Delivery and Pickup and Inventory Restrictions [J].

Bouanane, Khaoula ;

Benadada, Youssef ;

Bencheikh, Ghizlane .

2018 4TH IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL), 2018,

[35] An exact algorithm for Two-Echelon Location-Routing problem with simultaneous pickup and delivery [J].

Yildiz, Ece Arzu ;

Karaoglan, Ismail ;

Altiparmak, Fulya .

EXPERT SYSTEMS WITH APPLICATIONS, 2023, 231

[36] Solving the Biobjective Selective Pickup and Delivery Problem with Memetic Algorithm [J].

Liao, Xin-Lan ;

Ting, Chuan-Kang .

PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN PRODUCTION AND LOGISTICS SYSTEMS (CIPLS), 2013, :107-114

[37] Solution approaches for the green vehicle routing problem with time window and simultaneous pickup and delivery [J].

Boz, Esra ;

Calik, Ahmet ;

Sahin, Yusuf .

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2024, 39 (02) :757-770

[38] A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery [J].

Goksal, Fatma Pinar ;

Karaoglan, Ismail ;

Altiparmak, Fulya .

COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (01) :39-53

[39] A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows [J].

Nalepa, Jakub ;

Blocho, Miroslaw .

2017 25TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING (PDP 2017), 2017, :1-8

[40] The Vehicle Routing Problem with Simultaneous Pickup and Delivery Considering the Total Number of Collected Goods [J].

Guo, Qinge ;

Wang, Nengmin .

MATHEMATICS, 2023, 11 (02)

← 1 2 3 4 5 →