Solving vehicle routing problems using constraint programming and metaheuristics
From MaRDI portal
Publication:5944361
DOI10.1023/A:1009621410177zbMath0972.68631OpenAlexW1515177345MaRDI QIDQ5944361
Bruno De Backer, Patrick Prosser, Vincent Furnon, Philip Kilby, Paul Shaw
Publication date: 19 November 2001
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009621410177
Computing methodologies and applications (68U99) Traffic problems in operations research (90B20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (20)
A new heuristic algorithm for laser antimissile strategy optimization ⋮ A tabu search heuristic for the vehicle routing problem with time windows and split deliveries ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ The multiple team formation problem using sociometry ⋮ A case study of mutual routing-scheduling reformulation ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ Local search with annealing-like restarts to solve the VRPTW ⋮ A dial-a-ride problem for client transportation in a health-care organization ⋮ A decision support system for a real vehicle routing problem. ⋮ Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports ⋮ Vehicle routing problem with elementary shortest path based column generation ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Guided local search and its application to the traveling salesman problem ⋮ Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time ⋮ Vehicle routing problem with time windows and a limited number of vehicles. ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Control abstractions for local search ⋮ Tabu search heuristics for the vehicle routing problem with time windows.
This page was built for publication: Solving vehicle routing problems using constraint programming and metaheuristics
