A LOGISTIC PROCESS SCHEDULING PROBLEM: GENETIC ALGORITHMS OR ANT COLONY OPTIMIZATION?

Abstract: This paper compares the optimization of a logistic scheduling problem us-ing two different optimization techniques; the genetic algorithms and the ant colony optimization. The comparison is preceded by a literature review that summarizes the available comparison results for different benchmark problems and tries to generalize the differences between the techniques. The simulation results for the logistic problem conrm the conclusions of the literature survey: both methods perform equally well, but in general the genetic algorithms are faster. However, the ant colonies give more information about the solution, which is advantage in some applications. Copyright c°2005 IFAC