HighlightsWe formulate the unpaired pickup and delivery vehicle routing problem with multi-commodity and multi-visit.We propose a novel unified method to simplify the basic model.Valid inequalities are developed for the unified model to derive a tight lower bound of the problem.Tabu search algorithm is proposed to provide high quality solutions for the problem in this paper and relevant problems in the literature in a short time.
AbstractThis paper studies an unpaired pickup and delivery vehicle routing problem allowing for multi-visit. The problem consists of two interacted decisions: the pairing of supply and demand and the vehicle routing. Given the complexity of the problem, a novel unified model is formulated to decouple the interactions between the two decisions. Based on the unified model, some valid inequalities are derived and a tabu search algorithm is proposed. The computational results show that the tabu search algorithm can provide high quality solutions to the problem under investigation and the closely related problem studied in Chen et al. (2014).
An unpaired pickup and delivery vehicle routing problem with multi-visit
2017-04-02
30 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads
Online Contents | 2014
|The multi-visit drone routing problem for pickup and delivery services
Elsevier | 2022
|