eprintid: 2574
rev_number: 9
eprint_status: archive
userid: 365
dir: disk0/00/00/25/74
datestamp: 2017-10-16 08:14:57
lastmod: 2017-10-16 08:14:57
status_changed: 2017-10-16 08:14:57
type: article
metadata_visibility: show
creators_name: Bulhões, Teobaldo
creators_name: Ha, Minh Hoang
creators_name: Martinelli, Rafael
creators_name: Vidal, Thibaut
creators_id: minhhoang.ha@vnu.edu.vn
corp_creators: Instituto de Computação, Universidade Federal Fluminense, Niterói, Brazil
corp_creators: University of Engineering and Technology, Vietnam National University, Hanoi, Viet Nam
corp_creators: Departamento de Engenharia Industrial, Pontifícia Universidade Católica do Rio de Janeiro, Brazil
corp_creators: Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Brazil
title: The vehicle routing problem with service level constraints
ispublished: inpress
subjects: IT
subjects: isi
divisions: fac_fit
abstract: We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which relies on problem-tailored solution representation, crossover and local search operators, as well as an adaptive penalization mechanism establishing a good balance between service levels and costs. Our computational experiments show that the proposed heuristic returns very high-quality solutions for this difficult problem, matches all optimal solutions found for small and medium-scale benchmark instances, and improves upon existing algorithms for two important special cases: the vehicle routing problem with private fleet and common carrier, and the capacitated profitable tour problem. The branch-and-price algorithm also produces new optimal solutions for all three problems.
date: 2017
date_type: published
publisher: Elsevier
official_url: http://www.sciencedirect.com/science/article/pii/S0377221717307580
full_text_status: public
publication: European Journal of Operational Research
refereed: TRUE
issn: 0377-2217
citation:   Bulhões, Teobaldo and Ha, Minh Hoang and Martinelli, Rafael and Vidal, Thibaut  (2017) The vehicle routing problem with service level constraints.  European Journal of Operational Research .    ISSN 0377-2217    (In Press)  
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2574/1/VRP%20with%20service%20level%20constraints.pdf