Abstract

Job shop scheduling problem is one of the hardest combinatorial optimization problems. Many approaches such as Genetic Algorithm, Particle Swarm optimization Algorithm and heuristic algorithm have been used to solve this problem. Unfortunately, those algorithms are easy to get a local optimal solution. In this paper, an Improved Bat Algorithm was proposed to solve job shop scheduling problem, it can effectively avoid premature convergence. Moreover, it can speed up the convergence and improves the ability to find global optimal solution. Compared with Bat Algorithm and Particles Swarm Algorithm, the simulation results show that the Improved Bat Algorithm is efficacious to minimize makespan and accurate to find the optimal solution.

Full Text
Paper version not known

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.