Abstract

To solve permutation flow shop scheduling problem, a scheduling algorithm based on ant colony optimization is proposed in this chapter. This algorithm is an improved ant colony algorithm. On the basis of self-adaptation ant colony optimization algorithm, the variation method of adjust operation and noise interference method are used to improve the algorithm. Finally, the improved ant colony algorithm and the traditional genetic algorithm are compared by the simulation results. Besides, the advantages of the improved ant colony algorithm are also analyzed. The permutation flow shop scheduling problem can be well solved by this improved ant colony algorithm.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.