 |
Journal articles
Lower and upper bounds for the m-peripatetic vehicle routing problem
Abstract : The m-Peripatetic Vehicle Routing Problem (m-PVRP) consists in finding a set of routes of minimum total cost over m periods so that two customers are never sequenced consecutively during two different periods. It models for example money transports or cash machines supply, and the aim is to minimize the total cost of the routes chosen. The m-PVRP can be considered as a generalization of two well-known NP-hard problems: the Vehicle Routing Problem (VRP or 1-PVRP) and the m-Peripatetic Salesman Problem (m-PSP). In this paper we discuss some complexity results of the problem before presenting upper and lower bounding procedures. Good results are obtained not only on the m-PVRP in general, but also on the VRP and the m-PSP using classical VRP instances and TSPLIB instances.
https://hal-utt.archives-ouvertes.fr/hal-02369851
Contributor : Jean-Baptiste Vu Van Connect in order to contact the contributor
Submitted on : Tuesday, November 19, 2019 - 11:06:31 AM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM
Contributor : Jean-Baptiste Vu Van Connect in order to contact the contributor
Submitted on : Tuesday, November 19, 2019 - 11:06:31 AM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM