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

Glaydston Mattos Ribeiro; Gilbert Laporte

doi:10.1016/j.cor.2011.05.005

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

Glaydston Mattos Ribeiro, Gilbert Laporte

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

153 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 language	English
Pages (from-to)	728-735
Number of pages	8
Journal	Computers and Operations Research
Volume	39
Issue number	3
DOIs	https://doi.org/10.1016/j.cor.2011.05.005
Publication status	Published - 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

Access to Document

10.1016/j.cor.2011.05.005

Link to publication in Scopus

Fingerprint Dive into the research topics of 'An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem'. Together they form a unique fingerprint.

Cite this

@article{271029471c5a43b68405b4f8eb223d19,

title = "An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem",

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.",

keywords = "Adaptive large neighborhood search, Cumulative objective, Disaster relief, Metaheuristics",

author = "{Mattos Ribeiro}, Glaydston and Gilbert Laporte",

year = "2012",

month = mar,

doi = "10.1016/j.cor.2011.05.005",

language = "English",

volume = "39",

pages = "728--735",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

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

AU - Mattos Ribeiro, Glaydston

AU - Laporte, Gilbert

PY - 2012/3

Y1 - 2012/3

N2 - 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.

AB - 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.

KW - Adaptive large neighborhood search

KW - Cumulative objective

KW - Disaster relief

KW - Metaheuristics

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

U2 - 10.1016/j.cor.2011.05.005

DO - 10.1016/j.cor.2011.05.005

M3 - Article

AN - SCOPUS:79960165127

VL - 39

SP - 728

EP - 735

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 3

ER -