首页|A LOGISTIC PROCESS SCHEDULING PROBLEM: GENETIC ALGORITHMS OR ANT COLONY OPTIMIZATION?
A LOGISTIC PROCESS SCHEDULING PROBLEM: GENETIC ALGORITHMS OR ANT COLONY OPTIMIZATION?
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
This paper compares the optimization of a logistic scheduling problem using 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。
Genetic algorithmsAnt colony optimization
C.A. Silva、J.M. Sousa、T. Runkler、J.M.G. S￥a da Costa
展开 >
International Federation of Automatic Control
IFAC (International Federation of Automatic Control) World Congress
Prague(CS)
Proceedings the 16th IFAC (International Federation of Automatic Control) World Congress
NETL
