Journal article Open Access

How to Build and Evaluate a Solution Method: An Illustration for the Vehicle Routing Problem

Nicolas Zufferey

The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its well-known difficulty, metaheuristics are the most appropriate methods to tackle large and realistic instances. The goal of this paper is to highlight the key ideas for designing VRP metaheuristics according to the following criteria: efficiency, speed, robustness, and ability to take advantage of the problem structure. Such elements can obviously be used to build solution methods for other combinatorial optimization problems, at least in the deterministic field.

Files (148.4 kB)
Name Size
719.pdf
md5:4b37f5825e119c483e8ee6478274e1d7
148.4 kB Download
0
2
views
downloads
All versions This version
Views 00
Downloads 22
Data volume 296.8 kB296.8 kB
Unique views 00
Unique downloads 11

Share

Cite as