{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T18:52:30Z","timestamp":1775155950561,"version":"3.50.1"},"reference-count":42,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2019,7,27]],"date-time":"2019-07-27T00:00:00Z","timestamp":1564185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic traveling salesman problem (DTSP). The DTSP can be modeled as a sequence of static sub-problems, each of which is an instance of the TSP. In the proposed DPSO algorithm, the information gathered while solving a sub-problem is retained in the form of a pheromone matrix and used by the algorithm while solving the next sub-problem. We present a method for automatically setting the values of the key DPSO parameters (except for the parameters directly related to the computation time and size of a problem).We show that the diversity of parameters values has a positive effect on the quality of the generated results. Furthermore, the population in the proposed algorithm has a higher level of entropy. We compare the performance of the proposed heterogeneous DPSO with two ant colony optimization (ACO) algorithms. The proposed algorithm outperforms the base DPSO and is competitive with the ACO.<\/jats:p>","DOI":"10.3390\/e21080738","type":"journal-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T03:06:58Z","timestamp":1564369618000},"page":"738","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Self-Adaptive Discrete PSO Algorithm with Heterogeneous Parameter Values for Dynamic TSP"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1074-2847","authenticated-orcid":false,"given":"\u0141ukasz","family":"Str\u0105k","sequence":"first","affiliation":[{"name":"Institute of Computer Science, University of Silesia in Katowice, B\u0119dzi\u0144ska 39, 41-205 Sosnowiec, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1712-0688","authenticated-orcid":false,"given":"Rafa\u0142","family":"Skinderowicz","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Silesia in Katowice, B\u0119dzi\u0144ska 39, 41-205 Sosnowiec, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2698-6934","authenticated-orcid":false,"given":"Urszula","family":"Boryczka","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Silesia in Katowice, B\u0119dzi\u0144ska 39, 41-205 Sosnowiec, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8304-5746","authenticated-orcid":false,"given":"Arkadiusz","family":"Nowakowski","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Silesia in Katowice, B\u0119dzi\u0144ska 39, 41-205 Sosnowiec, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2019,7,27]]},"reference":[{"key":"ref_1","unstructured":"Branke, J. (2001, January 7\u201311). Evolutionary approaches to dynamic environments. Proceedings of the GECCO Workshop on Evolutionary Algorithms for Dynamics Optimization Problems, San Francisco, CA, USA."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Li, W. (2011, January 5\u20137). A parallel multi-start search algorithm for dynamic traveling salesman problem. Proceedings of the International Symposium on Experimental Algorithms, Crete, Greece.","DOI":"10.1007\/978-3-642-20662-7_6"},{"key":"ref_3","unstructured":"Kennedy, J., and Eberhart, R. (December, January 27). Particle Swarm Optimization. Proceedings of the IEEE International Conference on Neural Networks, Perth, WA, Australia."},{"key":"ref_4","unstructured":"Kennedy, J., and Eberhart, R.C. (1997, January 12\u201315). A discrete binary version of the particle swarm algorithm. Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics, Orlando, FL, USA."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","article-title":"Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem","volume":"Volume 141","author":"Clerc","year":"2004","journal-title":"New Optimization Techniques in Engineering"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","article-title":"Particle swarm optimization-based algorithms for TSP and generalized TSP","volume":"103","author":"Shi","year":"2007","journal-title":"Inf. Process. Lett."},{"key":"ref_7","first-page":"3283","article-title":"A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems","volume":"14","author":"Chen","year":"2010","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"7633","DOI":"10.1007\/s00500-017-2738-9","article-title":"Adjustability of a discrete particle swarm optimization for the dynamic TSP","volume":"22","author":"Skinderowicz","year":"2018","journal-title":"Soft Comput."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hansell, M. (2007). Built by Animals, Oxford University Press.","DOI":"10.1093\/oso\/9780199205561.001.0001"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-642-32650-9_17","article-title":"A Self-adaptive Heterogeneous PSO Inspired by Ants","volume":"Volume 7461","author":"Nepomuceno","year":"2012","journal-title":"Swarm Intelligence"},{"key":"ref_11","unstructured":"Haddow, P. (2009). Heterogeneous Particle Swarm Optimizers. IEEE Congress on Evolutionary Computation (CEC 2009), IEEE Press."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1049\/ip-cta:19982397","article-title":"Heterogeneous intelligent control systems","volume":"145","author":"Ravindranathan","year":"1998","journal-title":"IEE Proc. Control Theory Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"7267","DOI":"10.1016\/j.eswa.2013.07.033","article-title":"Self-adaptive systems: A survey of current approaches, research challenges and applications","volume":"40","author":"Haber","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Meyer-Nieberg, S., and Beyer, H.G. (2007). Self-adaptation in evolutionary algorithms. Parameter Setting in Evolutionary Algorithms, Springer.","DOI":"10.1007\/978-3-540-69432-8_3"},{"key":"ref_15","unstructured":"Qin, A.K., and Suganthan, P.N. (2005, January 2\u20135). Self-adaptive differential evolution algorithm for numerical optimization. Proceedings of the 2005 IEEE Congress on Evolutionary Computation, Edinburgh, UK."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.eswa.2012.08.006","article-title":"Automatic calibration a hydrological model using a master\u2013slave swarms shuffling evolution algorithm based on self-adaptive particle swarm optimization","volume":"40","author":"Jiang","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-319-24306-1_12","article-title":"Heterogeneous DPSO Algorithm for DTSP","volume":"Volume 9330","author":"Nguyen","year":"2015","journal-title":"Computational Collective Intelligence"},{"key":"ref_18","first-page":"223","article-title":"Dynamic vehicle routing problems","volume":"16","author":"Psaraftis","year":"1988","journal-title":"Veh. Routing Methods Stud."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Li, C., Yang, M., and Kang, L. (2006, January 15\u201318). A new approach to solving dynamic traveling salesman problems. Proceedings of the 6th international conference on Simulated Evolution And Learning, Hefei, China.","DOI":"10.1007\/11903697_31"},{"key":"ref_20","unstructured":"Cook, W.J. (2011). In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, Princeton University Press."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-45365-2_22","article-title":"Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP","volume":"Volume 2037","author":"Guntsch","year":"2001","journal-title":"Applications of Evolutionary Computing"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-45724-0_8","article-title":"Ant Systems for a Dynamic TSP","volume":"Volume 2463","author":"Eyckelhof","year":"2002","journal-title":"Ant Algorithms"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_24","first-page":"371","article-title":"Ant Colony Optimization with Immigrants Schemes in Dynamic Environments","volume":"Volume 6239","author":"Mavrovouniotis","year":"2010","journal-title":"Parallel Problem Solving from Nature, PPSN XI"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-642-20525-5_36","article-title":"CHC-Based Algorithms for the Dynamic Traveling Salesman Problem","volume":"Volume 6624","author":"Costa","year":"2011","journal-title":"Applications of Evolutionary Computation"},{"key":"ref_26","unstructured":"Younes, A., Basir, O., and Calamai, P. (2003, January 1\u20133). A Benchmark Generator for Dynamic Optimization. Proceedings of the 3rd WSEAS International Conference on Soft Computing, Optimization, Simulation & Manufacturing Systems, Malta."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., and Howe, A. (2014, January 12\u201316). Use of Explicit Memory in the Dynamic Traveling Salesman Problem. Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, Vancouver, BC, Canada.","DOI":"10.1145\/2576768.2598247"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Zhang, Y., and Zhao, G. (2015). Research on Multi-service Demand Path Planning Based on Continuous Hopfield Neural Network. Proceedings of China Modern Logistics Engineering, Springer.","DOI":"10.1007\/978-3-662-44674-4_39"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2951","DOI":"10.1007\/s00500-015-1924-x","article-title":"Ant colony optimization with immigrants schemes for the dynamic railway junction rescheduling problem with multiple delays","volume":"20","author":"Eaton","year":"2016","journal-title":"Soft Comput."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis, M., and Shengxiang, Y. (2016, January 24\u201329). Empirical study on the effect of population size on MAX-MIN ant system in dynamic environments. Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Canada.","DOI":"10.1109\/CEC.2016.7743880"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","article-title":"Ant Colony Optimization with Local Search for Dynamic Traveling Salesman Problems","volume":"47","author":"Mavrovouniotis","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"ref_32","first-page":"368","article-title":"A Modified Ant Colony Optimization Algorithm to Solve A Dynamic Traveling Salesman Problem: A Case Study with Drones for Wildlife Surveillance","volume":"6","author":"Chowdhury","year":"2019","journal-title":"J. Comput. Des. Eng."},{"key":"ref_33","unstructured":"Schmitt, J.P., Baldo, F., and Parpinelli, R.S. (2018, January 22\u201325). A MAX-MIN Ant System with Short-Term Memory Applied to the Dynamic and Asymmetric Traveling Salesman Problem. Proceedings of the 2018 7th Brazilian Conference on Intelligent Systems (BRACIS), S\u00e3o Paulo, SP, Brazil."},{"key":"ref_34","first-page":"85","article-title":"Ant colony systems for optimization problems in dynamic environments","volume":"119","author":"Wang","year":"2018","journal-title":"Swarm Intell. Princ. Curr. Algorithms Methods"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Huang, Y.W., Liu, C.F., Hu, S.F., Fu, Z.H., and Chen, Y.Q. (2018, January 12\u201315). Dynamic Task Sequencing of Manipulator by Monte Carlo Tree Search. Proceedings of the 2018 IEEE International Conference on Robotics and Biomimetics (ROBIO), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ROBIO.2018.8665242"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"99","DOI":"10.3390\/e21010099","article-title":"Simple stopping criteria for information theoretic feature selection","volume":"21","author":"Yu","year":"2019","journal-title":"Entropy"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1109\/TEVC.2015.2480780","article-title":"Entropy-Based Termination Criterion for Multiobjective Evolutionary Algorithms","volume":"20","author":"Saxena","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/978-3-319-15702-3_33","article-title":"Diversification and Entropy Improvement on the DPSO Algorithm for DTSP","volume":"Volume 9011","author":"Nguyen","year":"2015","journal-title":"Intelligent Information and Database Systems"},{"key":"ref_39","first-page":"334","article-title":"Empirical Study: Initial Population Diversity and Genetic Algorithm Performance","volume":"2007","author":"Hougen","year":"2007","journal-title":"Artif. Intell. Pattern Recogn."},{"key":"ref_40","first-page":"3851520","article-title":"Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows","volume":"2016","author":"Martinez","year":"2016","journal-title":"Math. Probl. Eng."},{"key":"ref_41","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., and Cook, W.J. (2007). The Traveling Salesman Problem: A Computational Study, Princeton University Press."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"C\u00e1ceres, L.P., L\u00f3pez-Ib\u00e1nez, M., and St\u00fctzle, T. (2014). Ant colony optimization on a budget of 1000. Swarm Intelligence, Springer.","DOI":"10.1007\/978-3-319-09952-1_5"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/8\/738\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:10:22Z","timestamp":1760188222000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/8\/738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,27]]},"references-count":42,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2019,8]]}},"alternative-id":["e21080738"],"URL":"https:\/\/doi.org\/10.3390\/e21080738","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201905.0187.v1","asserted-by":"object"}]},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,27]]}}}