Enzo Lucibello

Learn More
Metaheuristics like ant colony optimization (ACO) can be used to solve combinatorial optimization problems. In this paper we refer to its successful application to the vehicle routing problem (VRP). At the beginning, we introduce the VRP and some of its variants. The variants of VRP were designed to reproduce the kind of situations faced in the real-world.(More)
Many distribution companies service their customers with non homogeneous fleets of trucks. Their problem is to find a set of routes minimising the number of travelled kilometres and the number of used vehicles, while satisfying customer demand. There are three major problems why traditional Operations Research techniques are not enough to deal with this(More)
  • 1