Ant Colony Optimization Algorithm for Vehicle Routing Problem

Abstract

This thesis studies the Ant Colony Optimization (ACO) and its extensions. We overview and implement local search algorithms for the Travelling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) using the ACO. The results are then visualized using the visualization tool. The ACO algorithm for VRP is then used to calculate solutions for three benchmark instances. The benchmark instances are solved using other algorithms. These results are then compared.

Description

Subject(s)

ant colony optimization, ACO, vehicle routing problem, VRP, travelling salesman problem, TSP, local search, visualization

Citation