Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem

DOI10.1007/s10472-011-9261-yzbMath1238.90018MaRDI QIDQ421467

Daniel Riera, Daniel Guimarans, Rosa Herrero, Angel A. Juan, Juan José Ramos

Publication date: 23 May 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10609/90886

zbMATH Keywords

probabilistic algorithms; hybrid algorithms; vehicle routing problem; variable neighborhood search

Mathematics Subject Classification ID

90C15: Stochastic programming

90B06: Transportation, logistics and supply chain management

Related Items

Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem

Uses Software

• TSPLIB
• GRASP
• BoneRoute
• VRP
• JCell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• The traveling salesman. Computational solutions for RSP applications
• Variable neighborhood search
• A real delivery problem dealt with Monte Carlo techniques
• Greedy randomized adaptive search procedures
• BoneRoute: An adaptive memory-based method for effective fleet management
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• What you should know about the vehicle routing problem
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Constraint Logic Programming Using ECLⁱPS^e
• An annotated bibliography of GRASP – Part I: Algorithms
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Vehicle Scheduling Problem and Monte Carlo Simulation
• Parallel iterative search methods for vehicle routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
• Industrial Vehicle Routing
• The traveling-salesman problem and minimum spanning trees: Part II
• Using constraint-based operators to solve the vehicle routing problem with time windows