Department of Economics and Business Economics

A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems. / Mirzaei, Samira; Wøhlk, Sanne.

In: EURO Journal on Transportation and Logistics, Vol. 6, No. 2, 06.2017, p. 185-218.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

Mirzaei, S & Wøhlk, S 2017, 'A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems', EURO Journal on Transportation and Logistics, vol. 6, no. 2, pp. 185-218. https://doi.org/10.1007/s13676-017-0106-7

APA

CBE

MLA

Vancouver

Author

Mirzaei, Samira ; Wøhlk, Sanne. / A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems. In: EURO Journal on Transportation and Logistics. 2017 ; Vol. 6, No. 2. pp. 185-218.

Bibtex

@article{b72728cc75d846859b2034a05045b561,
title = "A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems",
abstract = "Despite the vast body of literature on vehicle routing problems, little attention has been paid to multi-compartment vehicle routing problems that investigate transportation of different commodities on the same vehicle, but in different compartments. In this project, we present two strategically different versions of the MCVRP in general settings. In the first version, different commodities may be delivered to the customer by different vehicles, but the full amount of each product must be delivered by a single vehicle. In the second version, each customer may only be serviced by a single vehicle, which must deliver the full amount of all commodities demanded by that customer. We present a Branch-and-Price algorithm for solving the two versions of the problem to optimality and we analyze the effect of the strategic decision of whether or not to allow multiple visits to the same customer by comparing the optimal costs of the two versions. Computational results are presented for instances with up to 100 customers and the algorithm can solve instances with up to 50 customers and 4 commodities to optimality.NOTE: An early version of the paper was made public on the website of the journal. The present version is therefore denoted {"}Erratum{"}.",
author = "Samira Mirzaei and Sanne W{\o}hlk",
year = "2017",
month = jun,
doi = "10.1007/s13676-017-0106-7",
language = "English",
volume = "6",
pages = "185--218",
journal = "EURO Journal on Transportation and Logistics",
issn = "2192-4376",
publisher = "Springer",
number = "2",

}

RIS

TY - JOUR

T1 - A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems

AU - Mirzaei, Samira

AU - Wøhlk, Sanne

PY - 2017/6

Y1 - 2017/6

N2 - Despite the vast body of literature on vehicle routing problems, little attention has been paid to multi-compartment vehicle routing problems that investigate transportation of different commodities on the same vehicle, but in different compartments. In this project, we present two strategically different versions of the MCVRP in general settings. In the first version, different commodities may be delivered to the customer by different vehicles, but the full amount of each product must be delivered by a single vehicle. In the second version, each customer may only be serviced by a single vehicle, which must deliver the full amount of all commodities demanded by that customer. We present a Branch-and-Price algorithm for solving the two versions of the problem to optimality and we analyze the effect of the strategic decision of whether or not to allow multiple visits to the same customer by comparing the optimal costs of the two versions. Computational results are presented for instances with up to 100 customers and the algorithm can solve instances with up to 50 customers and 4 commodities to optimality.NOTE: An early version of the paper was made public on the website of the journal. The present version is therefore denoted "Erratum".

AB - Despite the vast body of literature on vehicle routing problems, little attention has been paid to multi-compartment vehicle routing problems that investigate transportation of different commodities on the same vehicle, but in different compartments. In this project, we present two strategically different versions of the MCVRP in general settings. In the first version, different commodities may be delivered to the customer by different vehicles, but the full amount of each product must be delivered by a single vehicle. In the second version, each customer may only be serviced by a single vehicle, which must deliver the full amount of all commodities demanded by that customer. We present a Branch-and-Price algorithm for solving the two versions of the problem to optimality and we analyze the effect of the strategic decision of whether or not to allow multiple visits to the same customer by comparing the optimal costs of the two versions. Computational results are presented for instances with up to 100 customers and the algorithm can solve instances with up to 50 customers and 4 commodities to optimality.NOTE: An early version of the paper was made public on the website of the journal. The present version is therefore denoted "Erratum".

U2 - 10.1007/s13676-017-0106-7

DO - 10.1007/s13676-017-0106-7

M3 - Journal article

VL - 6

SP - 185

EP - 218

JO - EURO Journal on Transportation and Logistics

JF - EURO Journal on Transportation and Logistics

SN - 2192-4376

IS - 2

ER -