Using constraint-based operators to solve the vehicle routing problem with time windows
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3985132
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- scientific article; zbMATH DE number 4047422
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- scientific article; zbMATH DE number 4047423
- scientific article; zbMATH DE number 778449
- The vehicle routing problem with time windows and temporal dependencies
- Formulations and exact algorithms for the vehicle routing problem with time windows
Cited in
(32)- Variable neighbourhood search: Methods and applications
- Local search with annealing-like restarts to solve the VRPTW
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
- A time-based pheromone approach for the ant system
- 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
- Vehicle routing problem with time windows and a limited number of vehicles.
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- A multi-start local search algorithm for the vehicle routing problem with time windows
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- A unified framework for partial and hybrid search methods in constraint programming
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- Balancing bike sharing systems with constraint programming
- An investigation on compound neighborhoods for VRPTW
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows
- A bi-objective approach for scheduling ground-handling vehicles in airports
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- scientific article; zbMATH DE number 1406245 (Why is no real title available?)
- Principles and Practice of Constraint Programming – CP 2004
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique
- Metaheuristics in combinatorial optimization
- Nondeterministic control for hybrid search
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- The vehicle routing problem with flexible time windows and traveling times
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Combining VNS with constraint programming for solving anytime optimization problems
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Variable neighbourhood search: methods and applications
- A large neighbourhood search approach to the multi-activity shift scheduling problem
This page was built for publication: Using constraint-based operators to solve 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 Q5960031)
