Abstract
This paper proposes a hybrid ant colony optimization algorithm to solve the permutation flow-shop scheduling (PFS). The hybridization of ant colony optimization (ACO) with path relinking (PR), which combines the advantages of two individual algorithms, is the key innovative aspect of the approach. Path relinking (PR) can be interpreted as an evo- lutionary method where the high quality solutions are generated by introducing features of the guiding solution gradually into the initial solution. Moreover, the effective hybrid algorithm is a method to integrate intensification and diversifica- tion in the search, and it adopts the criterion function restricting the frequencies of using the PR procedure to improve the convergence speed. Finally, the proposed algorithm is applied to PFS benchmark problems. The experimental results have shown that the hybrid method yields better results to solve the permutation flow-shop scheduling than well-known exist- ing methods in terms of solution quality.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
