Analysis of the Effect of Random Numbers in Stochastic Heuristics for Solving Operations Research Problems
DOI:
https://doi.org/10.4108/dtip.15352Keywords:
Travelling Salesman, Permutation Flowshop Scheduling, Location Science, Stochastic Heuristics, Constrained Real-World Engineering problems, Insertion HeuristicsAbstract
INTRODUCTION: Random numbers are widely employed in stochastic and randomized heuristics to solve diverse Operations Research problems by facilitating the exploration and exploitation of new solution spaces.
OBJECTIVES: This paper examines various stochastic randomized heuristics, including Lévy-based heuristics, for solving the Travelling Salesman Problem (TSP), Facility Location Problem (FLP), Permutation Flowshop Scheduling Problem (PFSSP), and real-world engineering problems. For the TSP and PFSSP, the insertion technique of the Nawaz–Enscore–Ham (NEH) algorithm is integrated with random numbers to generate approximate solutions, while the FLP and real-world engineering problems are addressed by executing the randomized algorithm across multiple trials.
METHODS: The proposed approaches are evaluated using 12 TSP benchmark instances, including instances with up to 783 nodes, a real-world TSP involving 20 major cities in Slovakia, geodetic coordinates of 79 district headquarters in Slovakia for location science, 90 Taillard instances for scheduling problems, and 10 constrained real-world engineering problems. Up to 20,000 trials are considered, and the minimum, mean, and standard deviation of the resulting solutions are computed.
RESULTS: The findings demonstrate that appropriately designed randomized heuristics can achieve promising approximate solutions across diverse Operations Research problems. The statistical metrics are computed and results across all problem classes are compared with algorithms reported in the literature.
CONCLUSION: The study highlights the potential of stochastic and randomized approaches as effective computational methods for addressing complex optimization problems.
Downloads
References
[1] Mirjalili S, Mirjalili SM, Lewis A. Grey wolf optimizer. Advances in engineering software. 2014 Mar 1;69:46-61.
[2] Rao RV, Savsani VJ, Vakharia DP. Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Computer-aided design. 2011 Mar 1;43(3):303-15.
[3] Kennedy J, Eberhart R. Particle swarm optimization. InProceedings of ICNN'95-international conference on neural networks 1995 Nov 27 (Vol. 4, pp. 1942-1948). ieee.
[4] Baskar A. Simple population-based algorithms for solving optimization problems. RAIRO-Operations Research. 2024 Jan;58(1):253-80.
[5] Yang XS, Deb S, He X. Eagle strategy with flower algorithm. In2013 international conference on advances in computing, communications and informatics (ICACCI) 2013 Aug 22 (pp. 1213-1217). IEEE.
[6] Nawaz M, Enscore Jr EE, Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega. 1983 Jan 1;11(1):91-5.
[7] Symmetric traveling salesman problems, https://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/tsp/tspindex.html [Accessed on 01-08-2026]
[8] Chandomí-Castellanos E, Escobar-Gómez EN, Torres JA, Medina Santiago A, López Zapata BY, Arizaga Silva JA, Roberto-Bermúdez J, Vázquez-Delgado HD. A Hybrid Heuristic Algorithm for the Traveling Salesman Problem with Structured Initialization in Global–Local Search. Algorithms. 2026 Apr 22;19(5):324.
[9] Uddin F, Riaz N, Manan A, Mahmood I, Song OY, Malik AJ, Abbasi AA. An improvement to the 2-opt heuristic algorithm for approximation of optimal TSP tour. Applied Sciences. 2023 Jun 20;13(12):7339.
[10] Baskar A, Xavior MA, Jeyapandiarajan P, Batako A, Burduk A. A novel two-phase trigonometric algorithm for solving global optimization problems. Annals of Operations Research. 2026 Sep;364(2):1387-437.
[11] Asani EO, Okeyinka AE, Ajagbe SA, Adebiyi AA, Ogundokun RO, Adekunle TS, Mudali P, Adigun MO. A novel insertion solution for the travelling salesman problem. Computers, Materials & Continua. 2024 Apr 25;79(1):1581-97.
[12] Baskar A, Xavior MA. Analysis of job insertion technique for different initial sequences in permutation flow shop scheduling problems. International Journal of Enterprise Network Management. 2015;6(3):153-74.
[13] Taillard E. Benchmarks for basic scheduling problems. european journal of operational research. 1993 Jan 22;64(2):278-85.
[14] Amaladosan B, Michael AX, Burduk A, Butdee S, Machado J. A Randomized Insertion-Based Trigonometric Algorithm (RITA) for Permutation Flowshop Scheduling Problems. InInternational Conference on Intelligent Systems in Production Engineering and Maintenance 2025 Jun 24 (pp. 33-47). Cham: Springer Nature Switzerland.
[15] Baskar A, Anthony Xavior M. Solving Facility Location and Supply Chain Management Problems Using Modified Population-Based TP-AB Algorithm: Supply Chain Management Problems. EAI Endorsed Transactions on Digital Transformation of Industrial Processes, 1 (1).(2025) [Internet].
[16] Travel Guide Slovakia, https://www.natucate.com/en/destinations/travel-guide-slovakia [Accessed on 04-09-2026]
[17] Geographical Center of Slovakia, https://mapy.com/en/?source=base&id=1914065 [Accessed on 04-09-2026].
[18] Altay EV, Altay O, Özçevik Y. A comparative study of metaheuristic optimization algorithms for solving real-world engineering design problems. CMES-Computer Modeling in Engineering and Sciences. 2023 Dec 30;139(1):1039-94.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Baskar A, Justine Yasappan, Anthony Xavior Michael, Anna Burduk, Suthep Butdee
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.
