Adaptive granular local search heuristic for a dynamic vehicle routing problem
type: Item
instance of: scholarly article
title: Adaptive granular local search heuristic for a dynamic vehicle routing problem
zbMATH Open document ID: 1162.90349
author: Rodrigo Moretti Branchini
author: Arne Løkketangen
author: Vinicius Amaral Armentano
published in: Computers \& Operations Research
publication date: 2009-06-18T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 5566388
zbMATH Keywords: dynamic vehicle routing
zbMATH Keywords: adaptive local search
zbMATH Keywords: heuristics
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2009.01.014
OpenAlex ID: W2013055734
cites work: Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
cites work: A reactive variable neighborhood search for the vehicle-routing problem with time windows
cites work: A Method for Solving Traveling-Salesman Problems
cites work: Q4955268
cites work: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
cites work: Q4354785
cites work: A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
cites work: Diversion issues in real-time vehicle dispatching
cites work: A GRASP for the Vehicle Routing Problem with Time Windows
cites work: Partially dynamic vehicle routing—models and algorithms
cites work: Q4039765
cites work: Dynamic vehicle routing: Status and prospects
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: The granular tabu search and its application to the vehicle-routing problem
DOI: 10.1016/J.COR.2009.01.014
Recommended article: An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
Recommended article: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
Recommended article: A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times
Recommended article: An adaptive large neighborhood search for a vehicle routing problem with multiple routes
Recommended article: An adaptive large neighborhood search for the periodic vehicle routing problem
Recommended article: A library of local search heuristics for the vehicle routing problem
Recommended article: In-depth analysis of granular local search for capacitated vehicle routing
Recommended article: The granular tabu search and its application to the vehicle-routing problem
description: scientific article; zbMATH DE number 5566388