An improved whale optimization algorithm for job-shop scheduling based on quantum computing

15Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The traditional swarm intelligence algorithms are inefficient and difficult to converge to the optimal solution of the job-shop scheduling problem (JSP). In this paper, an improved whale optimization algorithm (IWOA) is proposed based on quantum computing to solve the discrete JSP. The algorithm was subjected to the analysis on computing complexity, the demonstration of global convergence, and simulation verification on a benchmark example of the JSP. Through the simulation, our algorithm achieved better minimum value, mean value and optimization success rate than traditional swarm intelligence algorithms. The results prove the convergence accuracy and global search ability of the IWOA.

Cite

CITATION STYLE

APA

Zhu, J., Shao, Z. H., & Chen, C. (2019). An improved whale optimization algorithm for job-shop scheduling based on quantum computing. International Journal of Simulation Modelling, 18(3), 521–530. https://doi.org/10.2507/IJSIMM18(3)CO13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free