The multi-vehicle cumulative covering tour problem

David A. Flores-Garza (), M. Angélica Salazar-Aguilar (), Sandra Ulrich Ngueveu () and Gilbert Laporte ()
Additional contact information
David A. Flores-Garza: Universidad Autónoma de Nuevo León
M. Angélica Salazar-Aguilar: Universidad Autónoma de Nuevo León
Sandra Ulrich Ngueveu: Univ de Toulouse, INP, LAAS
Gilbert Laporte: HEC Montréal

Annals of Operations Research, 2017, vol. 258, issue 2, No 25, 780 pages

Abstract: Abstract This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. There are three types of locations: mandatory, optional, and unreachable. Each mandatory location must be visited, and optional locations are visited in order to cover the unreachable locations. To guarantee the vehicle autonomy, the duration of each tour should not exceed a given time limit. A mixed integer linear formulation and a greedy randomized adaptive search procedure are proposed for this problem. The performance of the algorithm is assessed over a large set of instances adapted from the literature. Computational results confirm the efficiency of the proposed algorithm.

Keywords: Cumulative vehicle routing problem; Multi-vehicle covering tour problem; Minimum latency problem; Humanitarian logistics (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-015-2062-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-015-2062-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2062-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().