A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia

Rahma Lahyani; Leandro C. Coelho; Mahdi Khemakhem; Gilbert Laporte; Frédéric Semet

doi:10.1016/j.omega.2014.08.007

A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia

Rahma Lahyani, Leandro C. Coelho, Mahdi Khemakhem, Gilbert Laporte, Frédéric Semet

Research output: Contribution to journal › Article › peer-review

101 Citations (SciVal)

Abstract

We introduce, model and solve to optimality a rich multi-product, multi-period and multi-compartment vehicle routing problem with a required compartment cleaning activity. This real-life application arises in the olive oil collection process in Tunisia, where regional collection offices dispose of a fleet of vehicles to collect one or several grades of olive oil from a set of producers. For each grade, the quantity offered by a producer changes dynamically over the planning horizon. We first provide a mathematical formulation of the problem, along with a set of known and new valid inequalities. We then propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios to demonstrate to our industrial partner the advantages of using multi-compartment vehicles.

Original language	English
Pages (from-to)	1-10
Number of pages	10
Journal	Omega (United Kingdom)
Volume	51
DOIs	https://doi.org/10.1016/j.omega.2014.08.007
Publication status	Published - 1 Mar 2015

Funding

This work was partially supported by the International Campus on Safety and Intermodality in Transportation, the Nord–Pas-de-Calais Region, the European Community, the Regional Delegation for Research and Technology, the French Ministry of Higher Education and Research and the National Center for Scientific Research . The internship of the first author in CIRRELT was partly supported by the University Lille Nord de France and Fondation Centrale Initiatives . This work was partly supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) under Grant 39682-10 . This support is gratefully acknowledged. We also thank Calcul Québec for providing computing facilities. We thank our contact persons at the offices of our Tunisian partner and two anonymous referees who provided valuable comments.

Keywords

Branch-and-cut
Incompatible products
Valid inequalities
Vehicle routing with compartments

ASJC Scopus subject areas

Strategy and Management
Management Science and Operations Research
Information Systems and Management

Access to Document

10.1016/j.omega.2014.08.007

Cite this

@article{4579494f5e394402924b19524c56b4c4,

title = "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia",

abstract = "We introduce, model and solve to optimality a rich multi-product, multi-period and multi-compartment vehicle routing problem with a required compartment cleaning activity. This real-life application arises in the olive oil collection process in Tunisia, where regional collection offices dispose of a fleet of vehicles to collect one or several grades of olive oil from a set of producers. For each grade, the quantity offered by a producer changes dynamically over the planning horizon. We first provide a mathematical formulation of the problem, along with a set of known and new valid inequalities. We then propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios to demonstrate to our industrial partner the advantages of using multi-compartment vehicles.",

keywords = "Branch-and-cut, Incompatible products, Valid inequalities, Vehicle routing with compartments",

author = "Rahma Lahyani and Coelho, {Leandro C.} and Mahdi Khemakhem and Gilbert Laporte and Fr{\'e}d{\'e}ric Semet",

year = "2015",

month = mar,

day = "1",

doi = "10.1016/j.omega.2014.08.007",

language = "English",

volume = "51",

pages = "1--10",

journal = "Omega (United Kingdom)",

issn = "0305-0483",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia

AU - Lahyani, Rahma

AU - Coelho, Leandro C.

AU - Khemakhem, Mahdi

AU - Laporte, Gilbert

AU - Semet, Frédéric

PY - 2015/3/1

Y1 - 2015/3/1

N2 - We introduce, model and solve to optimality a rich multi-product, multi-period and multi-compartment vehicle routing problem with a required compartment cleaning activity. This real-life application arises in the olive oil collection process in Tunisia, where regional collection offices dispose of a fleet of vehicles to collect one or several grades of olive oil from a set of producers. For each grade, the quantity offered by a producer changes dynamically over the planning horizon. We first provide a mathematical formulation of the problem, along with a set of known and new valid inequalities. We then propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios to demonstrate to our industrial partner the advantages of using multi-compartment vehicles.

AB - We introduce, model and solve to optimality a rich multi-product, multi-period and multi-compartment vehicle routing problem with a required compartment cleaning activity. This real-life application arises in the olive oil collection process in Tunisia, where regional collection offices dispose of a fleet of vehicles to collect one or several grades of olive oil from a set of producers. For each grade, the quantity offered by a producer changes dynamically over the planning horizon. We first provide a mathematical formulation of the problem, along with a set of known and new valid inequalities. We then propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios to demonstrate to our industrial partner the advantages of using multi-compartment vehicles.

KW - Branch-and-cut

KW - Incompatible products

KW - Valid inequalities

KW - Vehicle routing with compartments

UR - http://www.scopus.com/inward/record.url?scp=84907638390&partnerID=8YFLogxK

U2 - 10.1016/j.omega.2014.08.007

DO - 10.1016/j.omega.2014.08.007

M3 - Article

AN - SCOPUS:84907638390

SN - 0305-0483

VL - 51

SP - 1

EP - 10

JO - Omega (United Kingdom)

JF - Omega (United Kingdom)

ER -

A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia

Abstract

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this