Abstract
The ant colony algorithm was first introduced by M. Dorigo, V. Maniezzo and A. Colorni in 1991. This algorithm is based on the behavior of a real ant colony when searching for food. The main area of application of the algorithm is the problem of combinatorial optimization. This paper describes the implementation of the algorithm, setting the parameters and considers its effectiveness in solving the job shop problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
