{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:12:41Z","timestamp":1761808361409,"version":"build-2065373602"},"reference-count":43,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Gdynia Maritime University","award":["WPIT\/2020\/P2\/03","WPIT\/2020\/P2\/03"],"award-info":[{"award-number":["WPIT\/2020\/P2\/03","WPIT\/2020\/P2\/03"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>One of the possible approaches to solving difficult optimization problems is applying population-based metaheuristics. Among such metaheuristics, there is a special class where searching for the best solution is based on the collective behavior of decentralized, self-organized agents. This study proposes an approach in which a swarm of agents tries to improve solutions from the population of solutions. The process is carried out in parallel threads. The proposed algorithm\u2014based on the mushroom-picking metaphor\u2014was implemented using Scala in an Apache Spark environment. An extended computational experiment shows how introducing a combination of simple optimization agents and increasing the number of threads may improve the results obtained by the model in the case of TSP and JSSP problems.<\/jats:p>","DOI":"10.3390\/a13060142","type":"journal-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T03:17:32Z","timestamp":1592191052000},"page":"142","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallelized Swarm Intelligence Approach for Solving TSP and JSSP Problems"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6104-1381","authenticated-orcid":false,"given":"Piotr","family":"Jedrzejowicz","sequence":"first","affiliation":[{"name":"Department of Information Systems, Gdynia Maritime University, 81-225 Gdynia, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4818-4841","authenticated-orcid":false,"given":"Izabela","family":"Wierzbowska","sequence":"additional","affiliation":[{"name":"Department of Information Systems, Gdynia Maritime University, 81-225 Gdynia, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2020,6,12]]},"reference":[{"key":"ref_1","unstructured":"Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc.. [1st ed.]."},{"key":"ref_2","unstructured":"Fogel, D.B. (1995). Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, IEEE Press."},{"key":"ref_3","unstructured":"Kennedy, J., and Eberhart, R. (December, January 27). Particle Swarm Optimization. Proceedings of the ICNN\u201995\u2014International Conference on Neural Networks, Perth, WA, Australia."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant System: Optimization by a Colony of Cooperating Agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybern.)"},{"key":"ref_5","unstructured":"Sato, T., and Hagiwara, M. (1997, January 12\u201315). Bee System: Finding solution by a concentrated search. Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Orlando, FL, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","article-title":"A Survey on Optimization Metaheuristics","volume":"237","author":"Lepagnot","year":"2013","journal-title":"Inf. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Nguyen, N.T., Chbeir, R., Exposito, E., Aniort\u00e9, P., and Trawinski, B. (2019). Current Trends in the Population-Based Optimization. Computational Collective Intelligence, Springer International Publishing.","DOI":"10.1007\/978-3-030-28377-3"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1789","DOI":"10.1007\/s00521-018-3657-0","article-title":"Learning\u2013interaction\u2013diversification framework for swarm intelligence optimizers: A unified perspective","volume":"32","author":"Chu","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Dario, P., Sandini, G., and Aebischer, P. (1993). Swarm Intelligence in Cellular Robotic Systems. Robots and Biological Systems: Towards a New Bionics, Springer.","DOI":"10.1007\/978-3-642-58069-7"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Freitas, D., Lopes, L., and Morgado-Dias, F. (2020). Particle Swarm Optimisation: A Historical Review Up to the Current Developments. Entropy, 22.","DOI":"10.3390\/e22030362"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1007\/s10462-019-09719-2","article-title":"A survey of swarm and evolutionary computing approaches for deep learning","volume":"53","author":"Darwish","year":"2019","journal-title":"Artif. Intell. Rev."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Peska, L., Misikir Tashu, T., and Horvath, T. (2019). Swarm intelligence techniques in recommender systems\u2014A review of recent research. Swarm Evol. Comput., 48.","DOI":"10.1016\/j.swevo.2019.04.003"},{"key":"ref_13","first-page":"182","article-title":"A Review on Swarm Intelligence Based Routing Approaches","volume":"9","author":"Velusamy","year":"2019","journal-title":"Int. J. Eng. Technol. Innov."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.jpdc.2018.08.007","article-title":"Swarm intelligence-based algorithms within IoT-based systems: A review","volume":"122","author":"Zedadra","year":"2018","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","article-title":"A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem","volume":"30","author":"Mahi","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"G\u00fclc\u00fc, S., Mahi, M., Baykan, O., and Kodaz, H. (2016). A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft Comput.","DOI":"10.1007\/s00500-016-2432-3"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","article-title":"An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems","volume":"48","author":"Osaba","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_18","unstructured":"Verma, N.K., and Ghosh, A.K. (2019). A Hybrid GA-PSO Algorithm to Solve Traveling Salesman Problem. Computational Intelligence: Theories, Applications and Future Directions\u2014Volume I, Springe."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"100607","DOI":"10.1016\/j.swevo.2019.100607","article-title":"A novel design of differential evolution for solving discrete traveling salesman problems","volume":"52","author":"Ali","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"105887","DOI":"10.1016\/j.asoc.2019.105887","article-title":"Discrete Spider Monkey Optimization for Travelling Salesman Problem","volume":"86","author":"Akhand","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","article-title":"Discrete symbiotic organisms search algorithm for travelling salesman problem","volume":"87","author":"Ezugwu","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_22","unstructured":"Paul, D.P.V., Chandirasekaran, G., Dhavachelvan, P., and Ramachandran, B. (2020). A novel ODV crossover operator-based genetic algorithms for traveling salesman problem. Soft Comput."},{"key":"ref_23","unstructured":"Er, H.R., and Erdogan, N. (2014). Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster. JSCSE."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Alanzi, E., and Bennaceur, H. (2019). Hadoop MapReduce for Parallel Genetic Algorithm to Solve Traveling Salesman Problem. Int. J. Adv. Comput. Sci. Appl., 10.","DOI":"10.14569\/IJACSA.2019.0100814"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Karouani, Y., and Elhoussaine, Z. (2018, January 2\u20134). Efficient Spark-Based Framework for Solving the Traveling Salesman Problem Using a Distributed Swarm Intelligence Method. Proceedings of the 2018 International Conference on Intelligent Systems and Computer Vision (ISCV), Fez, Morocco.","DOI":"10.1109\/ISACV.2018.8354075"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Jedrzejowicz, P., and Wierzbowska, I. (2019, January 17\u201319). Apache Spark as a Tool for Parallel Population-Based Optimization. Proceedings of the KES Conference on Intelligent Decision Technologies 2019, St. Julien\u2019s, Malta.","DOI":"10.1007\/978-981-13-8311-3_16"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Pacheco-Valencia, V., Hern\u00e1ndez, J.A., Sigarreta, J.M., and Vakhania, N. (2020). Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem. Algorithms, 13.","DOI":"10.3390\/a13010005"},{"key":"ref_28","first-page":"961","article-title":"A research survey: Review of AI solution strategies of job shop scheduling problem","volume":"26","author":"Bulkan","year":"2013","journal-title":"J. Intell. Manuf."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"337","DOI":"10.2507\/IJSIMM17(2)CO8","article-title":"Job-Shop Scheduling Problem Based on Improved Cuckoo Search Algorithm","volume":"17","author":"Hu","year":"2018","journal-title":"Int. J. Simul. Model."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"699","DOI":"10.2507\/IJSIMM18(4)CO18","article-title":"A Novel Job-Shop Scheduling Strategy Based on Particle Swarm Optimization and Neural Network","volume":"18","author":"Zhang","year":"2019","journal-title":"Int. J. Simul. Model."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2507\/IJSIMM18(3)CO13","article-title":"An Improved Whale Optimization Algorithm for Job-Shop Scheduling Based on Quantum Computing","volume":"18","author":"Zhu","year":"2019","journal-title":"Int. J. Simul. Model."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Chen, X., Zhang, B., and Gao, D. (2019, January 4\u20137). Algorithm Based on Improved Genetic Algorithm for Job Shop Scheduling Problem. Proceedings of the 2019 IEEE International Conference on Mechatronics and Automation (ICMA), Tianjin, China.","DOI":"10.1109\/ICMA.2019.8816334"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Wang, F., Tian, Y., and Wang, X. (2019, January 19\u201322). A Discrete Wolf Pack Algorithm for Job Shop Scheduling Problem. Proceedings of the 2019 5th International Conference on Control, Automation and Robotics (ICCAR), Beijing, China.","DOI":"10.1109\/ICCAR.2019.8813444"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.jmsy.2019.11.010","article-title":"Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility","volume":"54","author":"Azab","year":"2020","journal-title":"J. Manuf. Syst."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"012044","DOI":"10.1088\/1757-899X\/530\/1\/012044","article-title":"Performance Evaluation of Continuous and Discrete Particle Swarm Optimization in Job-Shop Scheduling Problems","volume":"530","author":"Anuar","year":"2019","journal-title":"Mater. Sci. Eng. Conf. Ser."},{"key":"ref_36","unstructured":"Tsai, C.W., Chang, H.C., Hu, K.C., and Chiang, M.C. (2016, January 9\u201312). Parallel coral reef algorithm for solving JSP on Spark. Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Budapest, Hungary."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Sun, L., Lin, L., Lib, H., and Gen, M. (2018). Large Scale Flexible Scheduling Optimization by A Distributed Evolutionary Algorithm. Comput. Ind. Eng., 128.","DOI":"10.1016\/j.cie.2018.09.025"},{"key":"ref_38","first-page":"856","article-title":"PLA Based Strategy for Solving RCPSP by a Team of Agents","volume":"22","year":"2016","journal-title":"J. Univers. Comput. Sci."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Czarnowski, I., Jedrzejowicz, P., and Kacprzyk, J. (2013). Team of A-Teams\u2014A Study of the Cooperation between Program Agents Solving Difficult Optimization Problems. Agent-Based Optimization, Springer.","DOI":"10.1007\/978-3-642-34097-0"},{"key":"ref_40","unstructured":"(2019, January 14). Apache Spark. Available online: https:\/\/spark.apache.org\/."},{"key":"ref_41","unstructured":"(2020, May 21). Source Files of MPA for TSP. Available online: https:\/\/bitbucket.org\/wierzbowska\/mpa-for-tsp\/src\/master\/."},{"key":"ref_42","unstructured":"Reinelt, G. (2019, January 14). TSPLIB. Available online: http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/."},{"key":"ref_43","unstructured":"Lawrence, S. (1984). Resource Constrained Project Scheduling-Technical Report, Carnegie-Mellon University."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/142\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:38:24Z","timestamp":1760175504000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,12]]},"references-count":43,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2020,6]]}},"alternative-id":["a13060142"],"URL":"https:\/\/doi.org\/10.3390\/a13060142","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,6,12]]}}}