Lower and upper bounds for the m-peripatetic vehicle routing problem - Archive ouverte HAL Access content directly
Journal Articles 4OR: A Quarterly Journal of Operations Research Year : 2010

Lower and upper bounds for the m-peripatetic vehicle routing problem

(1) , (1) , (2)
1
2

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.
Not file

Dates and versions

hal-02369851 , version 1 (19-11-2019)

Identifiers

Cite

Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo. Lower and upper bounds for the m-peripatetic vehicle routing problem. 4OR: A Quarterly Journal of Operations Research, 2010, 8 (4), pp.387-406. ⟨10.1007/s10288-010-0148-2⟩. ⟨hal-02369851⟩
35 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More