An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
type: Item
instance of: scholarly article
title: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
zbMATH Open document ID: 1251.90057
author: Glaydston Mattos Ribeiro
author: G. Laporte
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107505
zbMATH Keywords: cumulative objective
zbMATH Keywords: metaheuristics
zbMATH Keywords: adaptive large neighborhood search
zbMATH Keywords: disaster relief
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2011.05.005
OpenAlex ID: W1999257035
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
cites work: The delivery man problem with time windows
cites work: The school bus routing problem: a review
cites work: Inequality measures and equitable approaches to location problems
cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem
cites work: A Bi-objective Metaheuristic for Disaster Relief Operation Planning
cites work: Q4955265
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: Handbook of metaheuristics
cites work: A unified heuristic for a large class of vehicle routing problems with backhauls
cites work: A general heuristic for vehicle routing problems
cites work: An adaptive large neighborhood search for a vehicle routing problem with multiple routes
cites work: A comparison of five heuristics for the multiple depot vehicle scheduling problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
cites work: Q3048611
DOI: 10.1016/J.COR.2011.05.005
description: scientific article; zbMATH DE number 6107505