The vehicle routing problem with relaxed priority rules
Q1
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
EURO Journal on Transportation and Logistics
2021
|
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S219243762100011X?via%3Dihub#! https://dlib.phenikaa-uni.edu.vn/handle/PNK/1874 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
oai:localhost:PNK-1874 |
|---|---|
| record_format |
dspace |
| spelling |
oai:localhost:PNK-18742022-08-17T05:54:40Z The vehicle routing problem with relaxed priority rules Thanh Tan Doan Nathalie Bostel Minh Hoàng Hà Vehicle Routing Problem d-relaxed priority rule Mixed integer linear programming Adaptive large neighborhood search Q1 The Vehicle Routing Problem (VRP) is one of the most studied topics in Operations Research. Among the numerous variants of the VRP, this research addresses the VRP with relaxed priority rules (VRP-RPR) in which customers are assigned to several priority groups and customers with the highest priorities typically need to be served before lower priority ones. Additional rules are used to control the trade-off between priority and cost efficiency. We propose a Mixed Integer Linear Programming (MILP) model to formulate the problem and to solve small-sized instances. A metaheuristic based on the Adaptive Large Neighborhood Search (ALNS) algorithm with problem-tailored components is then designed to handle the problem at larger scales. The experimental results demonstrate the performance of our proposed algorithm. Remarkably, it outperforms a metaheuristic recently proposed to solve the Clustered Traveling Saleman Problem with d-relaxed priority rule (CTSP-d), a special case of VRP-RPR, in both solution quality and computational time. 2021-06-21T02:04:25Z 2021-06-21T02:04:25Z 2021 Article Working Paper https://www.sciencedirect.com/science/article/pii/S219243762100011X?via%3Dihub#! https://dlib.phenikaa-uni.edu.vn/handle/PNK/1874 10.1016/j.ejtl.2021.100039 en application/pdf EURO Journal on Transportation and Logistics |
| institution |
Digital Phenikaa |
| collection |
Digital Phenikaa |
| language |
English |
| topic |
Vehicle Routing Problem d-relaxed priority rule Mixed integer linear programming Adaptive large neighborhood search |
| spellingShingle |
Vehicle Routing Problem d-relaxed priority rule Mixed integer linear programming Adaptive large neighborhood search Thanh Tan Doan The vehicle routing problem with relaxed priority rules |
| description |
Q1 |
| author2 |
Nathalie Bostel |
| author_facet |
Nathalie Bostel Thanh Tan Doan |
| format |
Article |
| author |
Thanh Tan Doan |
| author_sort |
Thanh Tan Doan |
| title |
The vehicle routing problem with relaxed priority rules |
| title_short |
The vehicle routing problem with relaxed priority rules |
| title_full |
The vehicle routing problem with relaxed priority rules |
| title_fullStr |
The vehicle routing problem with relaxed priority rules |
| title_full_unstemmed |
The vehicle routing problem with relaxed priority rules |
| title_sort |
vehicle routing problem with relaxed priority rules |
| publisher |
EURO Journal on Transportation and Logistics |
| publishDate |
2021 |
| url |
https://www.sciencedirect.com/science/article/pii/S219243762100011X?via%3Dihub#! https://dlib.phenikaa-uni.edu.vn/handle/PNK/1874 |
| _version_ |
1751856254553161728 |
| score |
8.891145 |