A Memetic Algorithm to Solve the Two-Echelon Collaborative Multi-Centre Multi-Periodic Vehicle Routing Problem with Specific Constraints

被引：0

作者：

Snoussi, Camelia ^{[1
]}

El Fallahi, Abdellah ^{[1
]}

Hicham, Sarir ^{[1
]}

机构：

[1] Univ Abdelmalek Essaadi, Natl Sch Appl Sci, MaCS DM Lab, Tetouan, Morocco

来源：

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS | 2023年 / 14卷 / 12期

关键词：

Collaborative vehicle routing problem; two-echelon networks; memetic algorithm; Variable neighbourhood serach; HYBRID GENETIC ALGORITHM; DELIVERY; DEPOT;

D O I：

10.14569/IJACSA.2023.0141296

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The collaboration between distribution companies is gaining a great interest in the last years due to the benefit provided to reduce the cost of deliveries. In this work we study the centralized two-echelon collaborative multi -center multi-periodic vehicle routing problem with a specific constraints. In which each distribution center conserves its VIP customers, and each partner keep their delivery scheduling unchangeable. The problem is modelled as a MILP, and to solve it a hybrid algorithm is proposed. This algorithm combines a multi -population memetic algorithm (MPMA) and a variable neighbourhood search algorithm that integrates a tabu search list (VNS-T). The results obtained are compared with those obtained by CPLEX solver and the best known solution of the multi -depot vehicle routing problem (MDVRP).

引用

页码：951 / 960

页数：10