Abstract
A hybrid optimization algorithm is proposed for Job-Shop scheduling problem, which is based on the combination of adaptive genetic algorithm and improved ant algorithm. The algorithm gets the initial pheromone distribution using adaptive genetic algorithm at first, then runs improved ant algorithm. The algorithm utilizes the advantages of the two algorithms and overcomes their disadvantages. Experimental results show the algorithm excels genetic algorithm and ant algorithm in performance, and it is discovered that the bigger the problem is concerned, the better the algorithm performs.
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.
