Adaptive granular local search heuristic for a dynamic vehicle routing problem

DOI10.1016/j.cor.2009.01.014zbMath1162.90349OpenAlexW2013055734MaRDI QIDQ1025242

Rodrigo Moretti Branchini, Arne Løkketangen, Vinicius Amaral Armentano

Publication date: 18 June 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.014

zbMATH Keywords

heuristicsadaptive local searchdynamic vehicle routing

Mathematics Subject Classification ID

Search theory (90B40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Dynamic vehicle routing using an improved variable neighborhood search algorithm, A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times, Pro-active real-time routing in applications with multiple request patterns, The dynamic multiperiod vehicle routing problem with probabilistic information, Cooperative receding horizon strategies for the multivehicle routing problem, Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach, Designing granular solution methods for routing problems with time windows, In-depth analysis of granular local search for capacitated vehicle routing, Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique, Variable neighborhood search for the stochastic and dynamic vehicle routing problem, Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review, Opportunities for reinforcement learning in stochastic dynamic vehicle routing

Uses Software

• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic vehicle routing: Status and prospects
• Probabilistic diversification and intensification in local search for vehicle routing
• Diversion Issues in Real-Time Vehicle Dispatching
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Partially dynamic vehicle routing—models and algorithms
• A GRASP for the Vehicle Routing Problem with Time Windows
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
• A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• A Method for Solving Traveling-Salesman Problems