Pages that link to "Item:Q5689144"
From MaRDI portal
The following pages link to Hybrid Heuristics for the Vehicle Routing Problem with Time Windows (Q5689144):
Displayed 26 items.
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
- Travel time reliability in vehicle routing and scheduling with time windows (Q862488) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- A heuristic algorithm for solving hazardous materials distribution problems. (Q1412759) (← links)
- Finding the first \(K\) shortest paths in a time-window network. (Q1427091) (← links)
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- Routing relatively few customers per route (Q1876468) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Probabilistic diversification and intensification in local search for vehicle routing (Q1922635) (← links)
- City-courier routing and scheduling problems (Q2253369) (← links)
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
- Finding \(K\) shortest looping paths with waiting time in a time--window network (Q2504439) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
- COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM (Q3022133) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
- Two-phase algorithm for solving vehicle routing problem with time windows (Q6097182) (← links)
- Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique (Q6160384) (← links)