This thesis investigates the problem and solution approaches for the distance-constrained capacitated vehicle routing problem (DCVRP).
A mathematical formulation of the problem is derived, along with a solution obtained
through its application.
This is followed by a description and performance analysis of three heuristic methods.
These are the Savings algorithm (a constructive heuristic),
the cluster-then-route algorithm (a two-phase heuristic)
and inter-route and intra-route improvement heuristics.
Additionally, two metaheuristic methods are described:
Simulated Annealing (a single-solutionbased method) and
Ant Colony Optimization (a population-based method).
The thesis concludes with a general comparison of the algorithms, evaluating their advantages, disadvantages, and the specific scenarios in which each method performs effectively.
|
