A reactive variable neighborhood search for the vehicle-routing problem with time windows
From MaRDI portal
Publication:2884564
DOI10.1287/IJOC.15.4.347.24896zbMATH Open1238.90136OpenAlexW2154841487MaRDI QIDQ2884564FDOQ2884564
Authors: Olli Bräysy
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)
Cited In (53)
- An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- An integrated approach to the vehicle routing and container loading problems
- A vehicle routing problem with distribution uncertainty in deadlines
- A general heuristic for vehicle routing problems
- Dynamic vehicle routing using an improved variable neighborhood search algorithm
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Variable neighbourhood search: Methods and applications
- Heuristics for the multi-period orienteering problem with multiple time windows
- Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system
- Variable neighbourhood search: methods and applications
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
- Variable neighborhood search for location routing
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- An investigation on compound neighborhoods for VRPTW
- Competition and cooperation in pickup and multiple delivery problems
- Ambulance location and relocation problems with time-dependent travel times
- Delivery strategies for blood products supplies
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- An adaptive memory algorithm for the split delivery vehicle routing problem
- The vehicle-routing problem with time windows and driver-specific times
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Variable neighbourhood structures for cycle location problems
- New notation and classification scheme for vehicle routing problems
- A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Robust data-driven vehicle routing with time windows
- A bi-objective approach for scheduling ground-handling vehicles in airports
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Scheduling periodic customer visits for a traveling salesperson
- The vehicle routing problem with flexible time windows and traveling times
- Simulation on vehicle routing problems in logistics distribution
- A web-based decision support system for waste lube oils collection and recycling
- A variable neighborhood search heuristic for periodic routing problems
- Multi-depot vehicle routing problem with time windows under shared depot resources
- Designing granular solution methods for routing problems with time windows
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
This page was built for publication: A reactive variable neighborhood search for the vehicle-routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884564)