Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4047422
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A heuristic for the vehicle routing problem with time windows
Cited in
(36)- A bi-criteria heuristic for the vehicle routing problem with time windows
- Local search with annealing-like restarts to solve the VRPTW
- A heuristic algorithm for solving hazardous materials distribution problems.
- Finding the first \(K\) shortest paths in a time-window network.
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- Minimization of travel time and weighted number of stops in a traffic-light network
- Tabu search heuristics for the vehicle routing problem with time windows.
- Routing relatively few customers per route
- A multi-start local search algorithm for the vehicle routing problem with time windows
- Routing problems: A bibliography
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Metaheuristics: A bibliography
- Probabilistic diversification and intensification in local search for vehicle routing
- City-courier routing and scheduling problems
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Fast local search algorithms for the handicapped persons transportation problem
- The mixed capacitated general routing problem under uncertainty
- COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case
- scientific article; zbMATH DE number 770257 (Why is no real title available?)
- scientific article; zbMATH DE number 6129109 (Why is no real title available?)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
- Two-phase algorithm for solving vehicle routing problem with time windows
- Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique
- Visiting nurses assignment and routing for decentralized telehealth service networks
- A branch-and-price algorithm for energy aware task scheduling of constellations of nanosatellites
- Combining meta-heuristics to effectively solve the vehicle routing problems with time windows
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- Travel time reliability in vehicle routing and scheduling with time windows
This page was built for publication: Hybrid Heuristics 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 Q5689144)
