A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
From MaRDI portal
Publication:2884564
DOI10.1287/ijoc.15.4.347.24896zbMath1238.90136OpenAlexW2154841487MaRDI QIDQ2884564
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.15.4.347.24896
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (52)
Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ An integrated approach to the vehicle routing and container loading problems ⋮ Delivery strategies for blood products supplies ⋮ Dynamic vehicle routing using an improved variable neighborhood search algorithm ⋮ A web-based decision support system for waste lube oils collection and recycling ⋮ A variable neighborhood search heuristic for periodic routing problems ⋮ A variable neighbourhood search algorithm for the open vehicle routing problem ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Variable neighborhood search for location routing ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ The vehicle routing problem with flexible time windows and traveling times ⋮ Scheduling periodic customer visits for a traveling salesperson ⋮ A general heuristic for vehicle routing problems ⋮ Variable neighbourhood structures for cycle location problems ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Ambulance location and relocation problems with time-dependent travel times ⋮ A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Designing granular solution methods for routing problems with time windows ⋮ An Investigation on Compound Neighborhoods for VRPTW ⋮ Competition and Cooperation in Pickup and Multiple Delivery Problems ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ An iterated local search algorithm for the vehicle routing problem with convex time penalty functions ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows ⋮ Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Variable neighbourhood search: methods and applications ⋮ An adaptive memory algorithm for the split delivery vehicle routing problem ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ Simulation on vehicle routing problems in logistics distribution ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ A vehicle routing problem with distribution uncertainty in deadlines ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ Multi-depot vehicle routing problem with time windows under shared depot resources ⋮ Heuristics for the multi-period orienteering problem with multiple time windows ⋮ Adaptive granular local search heuristic for a dynamic vehicle routing problem ⋮ Variable neighbourhood search: Methods and applications ⋮ A tabu search algorithm for scheduling pharmaceutical packaging operations ⋮ Robust Data-Driven Vehicle Routing with Time Windows ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
This page was built for publication: A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
