Home > Research > Publications & Outputs > The driver and vehicle routing problem

Research

Links

Text available via DOI:

Keywords

View graph of relations

The driver and vehicle routing problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

The driver and vehicle routing problem. / Dominguez-Martin, Bencomo; Rodriguez-Martin, Inmaculada; Salazar-Gonzalez, Juan-Jose.
In: Computers and Operations Research, Vol. 92, 04.2018, p. 56-64.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Dominguez-Martin, B, Rodriguez-Martin, I & Salazar-Gonzalez, J-J 2018, 'The driver and vehicle routing problem', Computers and Operations Research, vol. 92, pp. 56-64. https://doi.org/10.1016/j.cor.2017.12.010

APA

Dominguez-Martin, B., Rodriguez-Martin, I., & Salazar-Gonzalez, J-J. (2018). The driver and vehicle routing problem. Computers and Operations Research, 92, 56-64. https://doi.org/10.1016/j.cor.2017.12.010

Vancouver

Dominguez-Martin B, Rodriguez-Martin I, Salazar-Gonzalez J-J. The driver and vehicle routing problem. Computers and Operations Research. 2018 Apr;92:56-64. Epub 2017 Dec 11. doi: 10.1016/j.cor.2017.12.010

Author

Dominguez-Martin, Bencomo ; Rodriguez-Martin, Inmaculada ; Salazar-Gonzalez, Juan-Jose. / The driver and vehicle routing problem. In: Computers and Operations Research. 2018 ; Vol. 92. pp. 56-64.

Bibtex

@article{4110c12d0f62419f8bdbb851160f8b80,
title = "The driver and vehicle routing problem",
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.",
keywords = "Vehicle routing, Branch-and-Cut, Multi-Depot, Synchronization",
author = "Bencomo Dominguez-Martin and Inmaculada Rodriguez-Martin and Juan-Jose Salazar-Gonzalez",
year = "2018",
month = apr,
doi = "10.1016/j.cor.2017.12.010",
language = "English",
volume = "92",
pages = "56--64",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",

}

RIS

TY - JOUR

T1 - The driver and vehicle routing problem

AU - Dominguez-Martin, Bencomo

AU - Rodriguez-Martin, Inmaculada

AU - Salazar-Gonzalez, Juan-Jose

PY - 2018/4

Y1 - 2018/4

N2 - 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.

AB - 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.

KW - Vehicle routing

KW - Branch-and-Cut

KW - Multi-Depot

KW - Synchronization

U2 - 10.1016/j.cor.2017.12.010

DO - 10.1016/j.cor.2017.12.010

M3 - Journal article

VL - 92

SP - 56

EP - 64

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -