Abstract:
The Capacitated Vehicle Routing Problem (CVRP) is
a combinatorial optimization problem where a fleet
of delivery vehicles must service known customer demands
from a common depot at a minimum transit
cost without exceeding the capacity constraint of each
vehicle. In this paper, we present a meta-heuristic approach
for solving the CVRP based on simulated annealing.
The algorithm uses a combination of random
and deterministic operators that are based on problem
knowledge information. Experimental results are
presented and favorable comparisons are reported.
Citation:
Harmanani, H. M., Azar, D., Helal, N., & Keirouz, W. (2011). A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem. In CATA (pp. 96-101).
