Main Article Content
Abstract
Many researchs have been conducted relating to optimization problems. This reseach proposes another
algorithm to solve optimation problem by implementing ant algorithm to Vehicle Routing Problem (VRP). The
VRP is an algorithm that works for multiple Traveling Salesmen Problems (TSP). The ant algorithm is an
algorithm that simulating on how the behaviour of ant colony can find the shorthest path from one place to
another.
There are some parameters to deal with this ant algorithm. To know the behaviour of these parameters,
some experiments were conducted to know how good the parameters should be set to solve the given problem.
Finally, the results of all experiments are also be reported.
Keywords: Vehicle Routing Problem, ant Algorithm, Traveling salesmen Problem.
algorithm to solve optimation problem by implementing ant algorithm to Vehicle Routing Problem (VRP). The
VRP is an algorithm that works for multiple Traveling Salesmen Problems (TSP). The ant algorithm is an
algorithm that simulating on how the behaviour of ant colony can find the shorthest path from one place to
another.
There are some parameters to deal with this ant algorithm. To know the behaviour of these parameters,
some experiments were conducted to know how good the parameters should be set to solve the given problem.
Finally, the results of all experiments are also be reported.
Keywords: Vehicle Routing Problem, ant Algorithm, Traveling salesmen Problem.