Multi-Swarm Bees Algorithm with GPU Computing for Belt Conveyor Production System
By: Wojciech Chmiel, Paweł Kolendo and Joanna Kwiecień
References
- Banharnsakun, A., Achalakul, T., Sirinaovakul, B.: Abc-gsx: A hybrid method for solving the traveling salesman problem. In: Nature and Biologically Inspired Computing (NaBIC), 2010 Second World Congress on. pp. 7–12 (10 2010)
- Baykasoglu, A., Ozbakor, L., Tapkan, P.: Artificial bee colony algorithm and its application to generalized assignment problem. In: Chan, F., Tiwari, M. (eds.) Swarm Intelligence, Focus on Ant and Particle Swarm Optimization, chap. 08. I-Tech Education and Publishing, Vienna, Austria (10 2007)
- Ben-Daya, M., Al-Fawzan, M.: A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research 109(1), 88–95 (1998)
- Bölte, A., Thonemann, U.W.: Optimizing simulated annealing schedules with genetic programming. European Journal of Operational Research 92(2), 402 – 416 (1996)
- Burkard, R., Karisch, S., Rendl, F.: Qaplib-a quadratic assignment problem library. Journal of Global Optimization 10(4), 391–403 (1997)
- Burkard, R.E., Çela, E.: Heuristics for biquadratic assignment problems and their computational comparison. European Journal of Operational Research 83(2), 283 – 300 (1995)
- Burke, E.K., Gustafson, S., Kendall, G.: Diversity in genetic programming: an analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation 8(1), 47–62 (2004). DOI: 10.1109/TEVC.2003.819263
- Chmiel, W., Szwed, P.: Bees algorithm for the quadratic assignment problem on cuda platform. In: Man–Machine Interactions 4, Advances in Intelligent Systems and Computing, vol. 391, pp. 615–625. Springer International Publishing (2016)
- Chong, C.S., Sivakumar, A.I., Low, M.Y.H., Gay, K.L.: A bee colony optimization algorithm to job shop scheduling. In: Proceedings of the 2006 Winter Simulation Conference (2006)
- Dou, Y., Jin, C., Dou, Y., Fan, H., Zhang, X.: Hybrid coyote optimization with differential evolution and its application to the estimation of solar photovoltaic cell parameters. Journal of Artificial Intelligence and Soft Computing Research 15(4), 385–412 (2025). DOI: 10.2478/jaiscr-2025-0019, https://doi.org/10.2478/jaiscr-2025-0019
- Elashmawi, W.H., Sheta, A., Alqadi, B.S., AbdElminaam, D.S., Alsekait, D.M.: A new version of the golden eagle optimizer algorithm and its application for solving a trio-objective skillful team formation problem in a social network. Journal of Artificial Intelligence and Soft Computing Research 15(4), 357–384 (2025). DOI: 10.2478/jaiscr-2025-0018, https://doi.org/10.2478/jaiscr-2025-0018
- F. Rubio, A. de la Encina, P.R., Rodríguez, I.: Eden bees: Parallelizing artificial bee colony in a functional environment. Procedia Computer Science 18, 661–670 (2013)
- Fatih Tasgetiren, M., Sevkli, M., Liang, Y.C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: 2004 Congress on Evolutionary Computation. vol. 2, pp. 1412–1419 (7 2004)
- Gupta, J.N.D., Schaller, J.E.: Minimizing flow time in a flow-line manufacturing cell with family setup times. Journal of the Operational Research Society 57(2), 163–176 (2006)
- Huang, X., Yin, J., Deng, G.: A hybrid discrete artificial bee colony optimization algorithm for the no-wait job shop problem with tardiness criterion. Journal of Algorithms & Computational Technology 19, 17–27 (2025). DOI: 10.1177/17483026251322104, https://doi.org/10.1177/17483026251322104
- J., S.K.: Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 2(1), 33–45 (1990)
- Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artificial Intelligence Review 42(1), 21–57 (2012)
- Karimi, N., Zandieh, M., Najafi, A.: Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism. International Journal of Production Research 49, 4965–4977 (2011)
- Kirk, D., Hwu, W.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1st edn. (2010)
- Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)
- Lewicki, A., Pancerz, K., Tadeusiewicz, R.: The Use of Strategies of Normalized Correlation in the Ant-Based Clustering Algorithm, pp. 637–644. Springer Berlin Heidelberg, Berlin, Heidelberg (2011)
- Li, J., Pan, Q., Xie, S.: Flexible job shop scheduling problems by a hybrid artificial bee colony algorithm. In: 2011 IEEE Congress of Evolutionary Computation (CEC). pp. 78–83 (7 2011)
- Lian, Z., Gu, X., Jiao, B.: A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation 175(1), 773–785 (2006)
- Lourenço, H., Martin, O., Stützle, T.: Iterated Local Search: Framework and Applications, pp. 363–397. Springer US, Boston, MA (2010)
- Luo, G.H., Huang, S.K., Chang, Y.S., Yuan, S.M.: A parallel bees algorithm implementation on gpu. Journal of Systems Architecture 60(3), 271–279 (2014)
- Luo, J., Shen, Y.: Energy efficiency optimization of belt conveyor for material scheduling problem. In: IEEE International Conference on Information and Automation. pp. 122–127 (8 2015)
- Lv, Y., Zhang, J., Qin, W.: A genetic regulatory network-based method for dynamic hybrid flow shop scheduling with uncertain processing times. Applied Sciences 7(1) (2017)
- Mahmoodi, F., Dooley, K.: A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell. International Journal of Production Research 29(9), 1923–1939 (1991)
- Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983)
- Ni, Y., Liu, W., Du, X., Xiao, R., Chen, G., Wu, Y.: Evolutionary optimization approach based on heuristic information with pseudo-utility for the quadratic assignment problem. Swarm and Evolutionary Computation 87, 101557 (2024). DOI: https://doi.org/10.1016/j.swevo.2024.101557, https://www.sciencedirect.com/science/article/pii/S2210650224000956
- Ogbu, F., Smith, D.: Simulated annealing for the permutation flowshop problem. Omega 19(1), 64–67 (1991)
- Pan, Q.K., Ruiz, R.: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Computers & Operations Research 40(1), 117–128 (Jan 2013)
- Parpinelli, R., Benitez, C., Lopes, H.: Handbook of Swarm Intelligence: Concepts, Principles and Applications, chap. Parallel Approaches for the Artificial Bee Colony Algorithm, pp. 329–345. Springer Berlin Heidelberg, Berlin, Heidelberg (2011)
- Petalas, Y.G., Parsopoulos, K.E., Vrahatis, M.N.: Entropy-based memetic particle swarm optimization for computing periodic orbits of nonlinear mappings. In: 2007 IEEE Congress on Evolutionary Computation. pp. 2040–2047 (11 2007). DOI: 10.1109/CEC.2007.4424724
- Pham, D.T., Castellani, M.: Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms. Soft Computing 18(5), 871–903 (2014). DOI: 10.1007/s00500-013-1104-9, https://doi.org/10.1007/s00500-013-1104-9
- Qiao, Z., Heidari, A.A., Zhao, X., Chen, H.: An evolutionary neural architecture search method accelerated by multi-fidelity evaluation and genetic decision controller. Journal of Artificial Intelligence and Soft Computing Research 15(4), 413–446 (2025). DOI: 10.2478/jaiscr-2025-0020, https://doi.org/10.2478/jaiscr-2025-0020
- Rajendran, C., Ziegler, H.: Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & Industrial Engineering 48(4), 789–797 (2005)
- Rosca, J.: Entropy-driven adaptive representation. In: Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications. pp. 23–32. Morgan Kaufmann (1995)
- Salmasi, N., Logendran, R., Skandari, M.R.: Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Computers & Operations Research 37(1), 199–212 (2010)
- Saravanan, M., Haq, A.N.: A scatter search method to minimise makespan of cell scheduling problem. International Journal of Agile Systems and Management 3(1-2), 18–36 (2008)
- Sayadi, M., Ramezanian, R., Ghaffari-Nasab, N.: A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations 1(1), 1–10 (2010)
- Skorin-Kapov, J., Vakharia, A.: Scheduling a flow-line manufacturing cell: a tabu search approach. International Journal of Production Research 31(7), 1721–1734 (1993)
- Solimanpur, M., Elmi, A.: A tabu search approach for group scheduling in buffer-constrained flow shop cells. International Journal of Computer Integrated Manufacturing 24(3), 257–268 (2011)
- Souza, D., Monteiro, G., Martins, T., Dmitriev, V., Teixeira, O.: Pso-gpu: Accelerating particle swarm optimization in cuda-based graphics processing units. In: Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation. pp. 837–838. GECCO ’11, ACM, New York, NY, USA (2011)
- Sridhar, J., Rajendran, C.: A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell. Computers & Industrial Engineering 27(1), 469–472 (1994)
- Subotic, M., Tuba, M., Stanarevic, N.: Parallelization of the artificial bee colony (abc) algorithm. In: Proceedings of 11th WSEAS International Conference on Evolutionary Computing. pp. 191–196. NN’10/EC’10/FS’10, World Scientific and Engineering Academy and Society (WSEAS), Stevens Point, Wisconsin, USA (2010)
- Sundar, S., Singh, A.: A swarm intelligence approach to the quadratic minimum spanning tree problem. Information Sciences 180(17), 3182–3191 (2010)
- Szeto, W.Y., Wu, Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. European Journal of Operational Research pp. 126–135 (2011)
- Szwed, P., Chmiel, W.: Multi-swarm pso algorithm for the quadratic assignment problem. In: Malley, R.E.O. (ed.) The 14th International Conference on Artificial Intelligence and Soft Computing ICAISC 2015 (2015)
- Szwed, P., Chmiel, W., Kadłuczka, P.: Opencl implementation of pso algorithm for the quadratic assignment problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds.) Artificial Intelligence and Soft Computing. Lecture Notes in Computer Science, vol. 9120, pp. 223–234. Springer International Publishing (2015)
- Tadeusiewicz, R., Lewicki, A.: The ant colony optimization algorithm for multiobjective optimization non-compensation model problem staff selection. In: Cai, Z., Hu, C., Kang, Z., Liu, Y. (eds.) Advances in Computation and Intelligence. pp. 44–53. Springer Berlin Heidelberg, Berlin, Heidelberg (2010)
- Teodorovic, D., Lucic, P., Markovic, G., Dell’ Orco, M.: Bee colony optimization: Principles and applications. In: 2006 8th Seminar on Neural Network Applications in Electrical Engineering. pp. 151–156 (2006)
- Thammano, A., Phu-ang, A.: A hybrid artificial bee colony algorithm with local search for flexible job-shop scheduling problem. Procedia Computer Science 20, 96–101 (2013)
- Vakharia, A., Chang, Y.L.: A simulated annealing approach to scheduling a manufacturing cell. Naval Research Logistics (NRL) 37(4), 559–577 (1990)
- Vijayender, R., Narendran, T.T.: Heuristics and sequence-dependent set-up jobs in flow line cells. International Journal of Production Research 41(1), 193–206 (2003)
- Wang, L., Zhao, X., Wu, P.: Resource-constrained emergency scheduling for forest fires via artificial bee colony and variable neighborhood search combined algorithm. IEEE Transactions on Intelligent Transportation Systems 25(6), 5791–5806 (2024). DOI: 10.1109/TITS.2023.3338017
- Wheeler, C.: Evolutionary belt conveyor design-optimizing costs. Bulk Material Handling by Conveyor Belt 7 pp. 3–11 (01 2008)
- XingBao, L., ZiXing, C.: Artificial bee colony programming made faster. In: 2009 Fifth International Conference on Natural Computation. vol. 4, pp. 154–158 (8 2009)
- Yeh, W.C., Hsieh, T.J.: Solving reliability redundancy allocation problems using an artificial bee colony algorithm. Computers & Operations Research 38(11), 1465–1473 (2011)
- Zajecka, M., Mastalerczyk, M., Chong, S.Y., Yao, X., Kwiecien, J., Chmiel, W., Dajda, J., Kisiel-Dorohinicki, M., Byrski, A.: Portfolio optimization with translation of representation for transport problems. Journal of Artificial Intelligence and Soft Computing Research 15(1), 57–75 (2024). DOI: 10.2478/jaiscr-2025-0004, https://doi.org/10.2478/jaiscr-2025-0004
- Zhang, S., Xia, X.: Modeling and energy efficiency optimization of belt conveyors. Applied Energy 88(9), 3061–3071 (2011)
Language: English
Page range: 39 - 59
Submitted on: Jul 28, 2025
Accepted on: May 19, 2026
Published on: Jul 1, 2026
Published by: SAN University
In partnership with: Paradigm Publishing Services
Keywords:
Related subjects:
© 2026 Wojciech Chmiel, Paweł Kolendo, Joanna Kwiecień, published by SAN University
This work is licensed under the Creative Commons Attribution 4.0 License.