Using constraint-based operators to solve the vehicle routing problem with time windows

DOI10.1023/A:1013661617536zbMath1073.90056OpenAlexW1588856286MaRDI QIDQ5960031

Louis-Martin Rousseau, Michel Gendreau, Gilles Pesant

Publication date: 11 April 2002

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013661617536

zbMATH Keywords

combinatorial optimizationvehicle routing problemmetaheuristicconstraint programminghybrid methodlocal search methodvariable neighborhood descent

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (29)

Balancing bike sharing systems with constraint programming ⋮ 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 ⋮ Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints ⋮ A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows ⋮ Nondeterministic control for hybrid search ⋮ An exact algorithm for a single-vehicle routing problem with time windows and multiple routes ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ The vehicle routing problem with flexible time windows and traveling times ⋮ A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ Local search with annealing-like restarts to solve the VRPTW ⋮ Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique ⋮ Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem ⋮ 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 ⋮ A time-based pheromone approach for the ant system ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Variable neighbourhood search: methods and applications ⋮ A large neighbourhood search approach to the multi-activity shift scheduling problem ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Vehicle routing problem with time windows and a limited number of vehicles. ⋮ Variable neighbourhood search: Methods and applications ⋮ Metaheuristics in combinatorial optimization

Uses Software

• Unnamed Item

This page was built for publication: Using constraint-based operators to solve the vehicle routing problem with time windows