The driver and vehicle routing problem

Dominguez-Martin, Bencomo and Rodriguez-Martin, Inmaculada and Salazar-Gonzalez, Juan-Jose (2018) The driver and vehicle routing problem. Computers and Operations Research, 92. pp. 56-64. ISSN 0305-0548

Full text not available from this repository.

Abstract

In the vehicle routing literature it is generally assumed that each vehicle is driven by a single driver from the beginning to the end of its route. We introduce a new vehicle routing problem without this assumption. We consider a problem with two depots in which vehicles must departure from one depot and arrive to the other, while drivers should leave and return to the same depot and their routes can not exceed a given duration. Under these conditions, changes of vehicle are mandatory for the drivers in order to go back to their base depots. These changes can only take place at some particular nodes. Moreover, vehicles and drivers must be synchronized. We model the problem as a vehicle routing problem with two depots and two types of routes, one for drivers and the other for vehicles. We propose a mixed integer programming formulation for the problem and design a branch-and-cut algorithm to solve it. Computational results show that the proposed approach can find optimal solutions for instances with up to 30 nodes.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700
Subjects:
ID Code:
126353
Deposited By:
Deposited On:
23 Jan 2019 15:35
Refereed?:
Yes
Published?:
Published
Last Modified:
28 May 2020 07:01