[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

A new artificial bee colony based on GPU for solving large-scale production scheduling problem

Published: 01 January 2016 Publication History

Abstract

Production scheduling problem is a difficult and discrete optimisation problem, which is proved to be NP-hard. Its computational time grows exponentially with increasing of problem size. Therefore, solving large-scale production scheduling problem is a time-consuming task. To tackle this problem, this paper proposes a new artificial bee colony algorithm based on Graphics Processing Unit GPU. It hopes that the GPU can accelerate the search and reduce the computational time. Experiments are conducted on some large-scale production scheduling problems. Results show that the proposed approach achieves promising performance.

References

[1]
Deng, G.L., Xu, Z.H. and Gu, X.S. (2012) 'A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling', Chinese Journal of Chemical Engineering, Vol. 20, No. 6, pp.1067-1073.
[2]
Karaboga, D. (2005) An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.
[3]
Karaboga, D. and Akay, B. (2009) 'A comparative study of artificial bee colony algorithm', Applied Mathematics and Computation, Vol. 214, No. 1, pp.108-132.
[4]
Kennedy, J. and Eberhart, R.C. (1995) 'Particle swarm optimization', Proceedings of the IEEE International Conference on Neural Networks, IEEE, Perth, WA, pp.1942-1948.
[5]
Li, X. and Yin, M. (2012) 'A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem', Scientia Iranica E, Vol. 19, No. 6, pp.1921-1935.
[6]
Li, X. and Yin, M. (2013) 'A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem', International Journal of Production Research, Vol. 51, No. 16, pp.4732-4754.
[7]
Liang, J.J., Pan, Q.K., Chen, T.J. and Wang, L. (2011) 'Solving the blocking flow shop scheduling problem by a dynamic multiswarm particle swarm optimizer', International Journal of Advanced Manufacturing Technology, Vol. 55, Nos. 5-8, pp.755-762.
[8]
Nawaz, M., Enscore, E.E.J. and Ham, I. (1983) 'A heuristic algorithm for the m-machine, n-job flow shop sequencing problem', Omega, Vol. 11, No. 1, pp.91-95.
[9]
Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N. and Chua, T.J. (2011) 'A discrete artificial bee colony algorithm for the lotstreaming flow shop scheduling problem', Information Sciences, Vol. 181. No. 12, pp.2455-2468.
[10]
Ronconi, D.P. (2005) 'A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking', Annals of Operations Research, Vol. 138, No. 1, pp.53-65.
[11]
Taillard, E. (1990) 'Some efficient heuristic methods for the flow shop sequencing problem', European Journal of Operational Research, Vol. 47, No. 1, pp.65-74.
[12]
Tasgetiren, M.F., Liang, Y.C., Sevkli, M. and Gencyilmaz, G. (2006) 'Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem', International Journal of Production Research, Vol. 44, No. 22, pp.4737-4754.
[13]
Tasgetiren, M.F., Pan, Q.K., Suganthan, P.N. and Chen, A.H. (2011) 'A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops', Information Sciences, Vol. 181, No. 16, pp.3459-3475.
[14]
Wang, X. and Tang, L. (2012) 'A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking', Applied Soft Computing, Vol. 12, No. 2, pp.652-662.
[15]
Wang, H., Wang, W. and Sun, H. (2015) 'Multi-strategy ensemble artificial bee colony algorithm for large-scale production scheduling problem', International Journal of Innovative Computing and Applications, Vol. 6, Nos. 3/4, pp.128-136.
[16]
Wang, H., Wu, Z.J., Rahnamayan, S., Sun, H., Liu, Y. and Pan, J.S. (2014) 'Multi-strategy ensemble artificial bee colony algorithm', Information Sciences, Vol. 279, pp.587-603.
[17]
Yuan, F., Chen, S., Liu, H. and Xu, L. (2015) 'Artificial bee colony-based extraction of non-taxonomic relation between symptom and syndrome in TCM record', International Journal of Computing Science and Mathematics, Vol. 6, No. 6, pp.600-610.
[18]
Zhang, C.S. and Sun, J.G. (2009) 'An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem', Expert Systems with Applications, Vol. 36, No. 3, pp.5162-5167.
[19]
Zhang, C.S., Ning, J.X. and Ouyang, D.T. (2010a) 'A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem', Computers & Industrial Engineering, Vol. 58, No. 1, pp.1-11.
[20]
Zhang, J.D., Zhang, C.S. and Liang, S.B. (2010b) 'The circular discrete particle swarm optimization algorithm for flow shop scheduling problem', Expert Systems with Applications, Vol. 37, No. 8, pp.5827-5834.
[21]
Zhou, X., Wu, Z., Deng, C. and Peng, H. (2015) 'Enhancing artificial bee colony algorithm with generalised opposition-based learning', International Journal of Computing Science and Mathematics, Vol. 6, No. 3, pp.297-309.
[22]
Zhu, G. and Kwong, S. (2010) 'Gbest-guided artificial bee colony algorithm for numerical function optimization', Applied Mathematics and Computation, Vol. 217, No. 7, pp.3166-3173.
[23]
Zhu, H., Zhao, C. and Liu, W. (2014) 'Sub-pixel mapping of remote-sensing imagery based on chaotic quantum bee colony algorithm', International Journal of Computing Science and Mathematics, Vol. 5, No. 1, pp.61-71.

Cited By

View all
  • (2018)Quantum flower pollination algorithm for optimal multiple relay selection schemeInternational Journal of Wireless and Mobile Computing10.1504/IJWMC.2017.08932313:4(299-305)Online publication date: 21-Dec-2018

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image International Journal of Wireless and Mobile Computing
International Journal of Wireless and Mobile Computing  Volume 10, Issue 4
January 2016
98 pages
ISSN:1741-1084
EISSN:1741-1092
Issue’s Table of Contents

Publisher

Inderscience Publishers

Geneva 15, Switzerland

Publication History

Published: 01 January 2016

Author Tags

  1. ABC
  2. GPU
  3. artificial bee colony
  4. discrete optimisation
  5. graphics processing unit
  6. large-scale scheduling
  7. production scheduling

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2018)Quantum flower pollination algorithm for optimal multiple relay selection schemeInternational Journal of Wireless and Mobile Computing10.1504/IJWMC.2017.08932313:4(299-305)Online publication date: 21-Dec-2018

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media