Pages that link to "Item:Q5960031"
From MaRDI portal
The following pages link to Using constraint-based operators to solve the vehicle routing problem with time windows (Q5960031):
Displaying 29 items.
- Balancing bike sharing systems with constraint programming (Q272022) (← links)
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows (Q337630) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Nondeterministic control for hybrid search (Q857891) (← links)
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes (Q859687) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints (Q1651588) (← links)
- A time-based pheromone approach for the ant system (Q1758053) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
- A unified framework for partial and hybrid search methods in constraint programming (Q2489124) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← 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)