The multi-vehicle cumulative covering tour problem

David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, Gilbert Laporte

Research output: Contribution to journalArticle

8 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)761-780
Number of pages20
JournalAnnals of Operations Research
Volume258
Issue number2
DOIs
Publication statusPublished - 1 Nov 2017

Keywords

  • Cumulative vehicle routing problem
  • Humanitarian logistics
  • Minimum latency problem
  • Multi-vehicle covering tour problem

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this