Toward a more flexible VRP with pickup and delivery allowing consolidations

Q1

Saved in:
Bibliographic Details
Main Author: Ancele, Yannis
Other Authors: Minh Hoàng Hà
Format: Article
Language:English
Published: Transportation Research Part C: Emerging Technologies 2021
Subjects:
Online Access:https://www.sciencedirect.com/science/article/abs/pii/S0968090X21001017?via%3Dihub#!
https://dlib.phenikaa-uni.edu.vn/handle/PNK/1868
Tags: Add Tag
No Tags, Be the first to tag this record!
id oai:localhost:PNK-1868
record_format dspace
spelling oai:localhost:PNK-18682022-08-17T05:54:42Z Toward a more flexible VRP with pickup and delivery allowing consolidations Ancele, Yannis Minh Hoàng Hà Charly Lersteau Dante Ben Matellini Trung Thanh Nguyen Vehicle routing problem Pickup and delivery Cross-docks Simulated annealing Q1 One important requirement of modern supply chain management is the frequent exchange of containers via multiple cross-docks which requires spatial and time synchronisations between different types of vehicle. Moreover, as collaborations in logistics between several companies become popular, more flexible and extended models must be solved to consider the different needs of the companies. This is of high importance in a new logistics concept, the Physical Internet, which is expected to considerably improve the way logistics are handled in the current supply chain management. To optimise the aforementioned requirements, a rich vehicle routing problem with pickup and delivery including numerous attributes is modelled and solved. A mathematical formulation is proposed and implemented in CPLEX to solve the problem. Given the complexity of the problem, solving large instances with exact methods is very time-consuming. Therefore, a multi-threaded meta-heuristic based on Simulated Annealing is developed. A set of new operators coupled with a restart strategy and memory are developed to help improve the performance. Computational results on a generated data-set showed that the proposed meta-heuristic is superior to the CPLEX solver in terms of solvability and computational time. The proposed meta-heuristic was also compared with the best-known results by current state-of-the-art methods on a classical benchmark on pickup and delivery problems with time windows (with up to 200 customers). The experimental results showed that the proposed method was able to match the best-known results in many of these large scale instances 2021-06-21T01:42:59Z 2021-06-21T01:42:59Z 2021 Article Working Paper https://www.sciencedirect.com/science/article/abs/pii/S0968090X21001017?via%3Dihub#! https://dlib.phenikaa-uni.edu.vn/handle/PNK/1868 10.1016/j.trc.2021.103077 en Transportation Research Part C: Emerging Technologies
institution Digital Phenikaa
collection Digital Phenikaa
language English
topic Vehicle routing problem
Pickup and delivery
Cross-docks
Simulated annealing
spellingShingle Vehicle routing problem
Pickup and delivery
Cross-docks
Simulated annealing
Ancele, Yannis
Toward a more flexible VRP with pickup and delivery allowing consolidations
description Q1
author2 Minh Hoàng Hà
author_facet Minh Hoàng Hà
Ancele, Yannis
format Article
author Ancele, Yannis
author_sort Ancele, Yannis
title Toward a more flexible VRP with pickup and delivery allowing consolidations
title_short Toward a more flexible VRP with pickup and delivery allowing consolidations
title_full Toward a more flexible VRP with pickup and delivery allowing consolidations
title_fullStr Toward a more flexible VRP with pickup and delivery allowing consolidations
title_full_unstemmed Toward a more flexible VRP with pickup and delivery allowing consolidations
title_sort toward a more flexible vrp with pickup and delivery allowing consolidations
publisher Transportation Research Part C: Emerging Technologies
publishDate 2021
url https://www.sciencedirect.com/science/article/abs/pii/S0968090X21001017?via%3Dihub#!
https://dlib.phenikaa-uni.edu.vn/handle/PNK/1868
_version_ 1751856296562262016
score 8.891787