Experience with a framework for developing heuristics for solving rich vehicle routing problems

Authors:
Ulrich Derigs;Ulrich Vogel
Affiliations:
Universität zu Köln, Köln, Germany 50969;Universität zu Köln, Köln, Germany 50969
Venue:
Journal of Heuristics
Year:
2014

Citing 17
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
New optimization heuristics

Journal of Computational Physics
Record breaking optimization results using the ruin and recreate principle

Journal of Computational Physics
The vehicle routing problem

The vehicle routing problem
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

Transportation Science
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

Transportation Science
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Computers and Operations Research
Solving the truck and trailer routing problem based on a simulated annealing heuristic

Computers and Operations Research
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Transportation Science
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics

INFORMS Journal on Computing
Fifty Years of Vehicle Routing

Transportation Science
A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
Vehicle routing with compartments: applications, modelling and heuristics

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

According to Cordeau et al. (J Oper Res Soc 53(5):512---522, 2002) a good VRP heuristic should fulfill four criteria: accuracy, speed, simplicity, and flexibility. In this paper we report experience with a heuristic framework for solving rich vehicle routing problems (RVRP), which is based on rather simple heuristics. This heuristic framework has been implemented as flexible software framework. The user-friendly design enables flexible customization of problem-specific solvers. Our computational study on five RVRP reveals that the heuristic approach is rather robust with respect to parameterization and that the solvers which have been customized from the framework can compete with state-of-the-art special purpose developments.