An ant colony system for the capacitated vehicle routing problem with uncertain travel costs

In this study, we consider a capacitated vehicle routing problem where the objective function is to minimize the total travel cost.We also consider that the travel costs between the locations are subject to uncertainty, therefore they are expressed as intervals, rather than fixed numbers. The motiva...

Full description

Saved in:
Bibliographic Details
Published in2013 IEEE Symposium on Swarm Intelligence (SIS) pp. 32 - 39
Main Authors Toklu, N. E., Montemanni, R., Gambardella, L. M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2013
Subjects
Linear programming
Optimization
Particle swarm optimization
Robustness
Routing
Uncertainty
Vehicles
Online AccessGet full text
DOI10.1109/SIS.2013.6615156

Cover

More Information
Summary:In this study, we consider a capacitated vehicle routing problem where the objective function is to minimize the total travel cost.We also consider that the travel costs between the locations are subject to uncertainty, therefore they are expressed as intervals, rather than fixed numbers. The motivation of this study is to solve this problem by using a metaheuristic approach. We base our approach on a variant of ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the deterministic version of the problem (i.e. the classical version of the problem without the uncertainty), previously reported in the literature. We modify the algorithm to incorporate a robust optimization methodology, so that the uncertainty on traveling costs can be handled.
DOI:10.1109/SIS.2013.6615156