An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Glaydston Mattos Ribeiro, Gilbert Laporte

Research output: Contribution to journalArticle

143 Citations (Scopus)

Abstract

The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the classical capacitated vehicle routing problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compared with two recently published memetic algorithms.

Original languageEnglish
Pages (from-to)728-735
Number of pages8
JournalComputers and Operations Research
Volume39
Issue number3
DOIs
Publication statusPublished - Mar 2012

Keywords

  • Adaptive large neighborhood search
  • Cumulative objective
  • Disaster relief
  • Metaheuristics

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Cite this