Designing granular solution methods for routing problems with time windows
From MaRDI portal
Publication:1694925
DOI10.1016/j.ejor.2017.04.059zbMath1380.90060OpenAlexW2300024838MaRDI QIDQ1694925
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.04.059
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times ⋮ Neural networks for local search and crossover in vehicle routing: a possible overkill? ⋮ Routing electric vehicles with a single recharge per route ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ A tabu search with geometry‐based sparsification methods for angular traveling salesman problems ⋮ Vehicle routing with arrival time diversification ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The vehicle-routing problem with time windows and driver-specific times
- A note on the time travel approach for handling time windows in vehicle routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- A general heuristic for vehicle routing problems
- An efficient implementation of local search algorithms for constrained routing problems
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- k-interchange procedures for local search in a precedence-constrained routing problem
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Formulations and exact algorithms for the vehicle routing problem with time windows
- 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
- A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
- Vehicle Routing
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
This page was built for publication: Designing granular solution methods for routing problems with time windows
