Higher Dimensional P - Path Route Minimum Distance Supply To The Destinations From The Central Station
Abstract
We take into consideration one of the non-linear polynomial combinatorial programming issues known as P-path route minimum distance supply to the destinations from the central station.The distance matrix D(i, j, k) is given from the i th destination to the jth destination utilizing the k th facility, and there are n destinations. A facility, denoted by the letter K, can be an individual component that affects travel distances or costs. Depending on the needs of the many destinations, the central station has the potential to supply the load. The challenge is to determine the lowest distance, while taking the aforementioned factors into account, to connect all of the destinations to the central station (let’s say one). We created a Pattern Recognition Technique based Lexi Search Method for this issue, and we built the suggested algorithm in C. We compared it to the models already in use and came to the conclusion that it was recommended for handling higher dimensional issues.
Downloads
References
Garey, Michael R., Computers and Intractability, A Guide to the Theory of NP- Completeness, 1979, ISBN 0-7167-1045-5.
David R. Karger,.; Philip N. Klein and Robert E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, Journal of the Association for Computing Machinery, 42 ,1995, 321{328, doi: 10.1145/201019.201022.
P. Seth, R. Vijaya, A randomized time-work optimal parallel algorithm for finding a minimum spanning forest, SIAM Journal on Computing 31, (2002) 1879{1895, doi:10.1137/S0097539700371065.
Pop, P.C.,”New models of the Generalized Minimum Spanning Tree Problem”, Journal of Mathematical Modelling and Algorithms, Volume 3, issue 2, 2004, 153-166.
Reeves, C.R., “Moderen Metaheuristics Techniques for Combinatorial Problems”, Blackwell, Oxford, 1993.
Sundara Murthy, M. “Combinatorial Programming: A Pattern Recognition Approach,” A Ph.D. Thesis, REC, Warangal. 1979.
C Suresh Babu, K Sobhan Babu and M Sundara Murthy, Variant Minimum Spanning Network Connectivity Problem,International Journal of Engineering Science and Technology,3,2011,
P. Biswas, M Goel, H Negi and M Datta, An Efficient Greedy Minimum Spanning Tree Algorithm Based on Vertex Associative Cycle Detection Method, Procedia Computer Science, 92(2016),513 {519, doi:10.1016/j.procs.2016.07.376.
P. Seth & R. Vijaya.,An Optimal Minimum Spanning Tree Algorithm, Journal of the ACM,49, (2000), 49{60, doi:10.1007/3-540-45022-X_6.
P. Ayegba, J. Ayoola, E. Asani and A. Okeyinka, A Comparative Study Of Minimal Spanning Tree Algorithms, International Conference in Mathematics, Computer Engineering and Computer Science,2020, 1{4, doi: 10.1109/ICMCECS47690.2020.240900.
Osaba, Eneko & Yang, Xin-She & Del Ser, Javier. (2020). Traveling salesman problem: a perspective review of recent research and new results with bio-inspired metaheuristics. 10.1016/B978-0-12-819714-1.00020-8.
C Hansknecht, I Joormann and S.Stiler, Dynamic Shortest Paths Methods for the Time-Dependent TSP, Algorithms, 14,202,,1{3,doi:10.3390/a14010021.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Madhu Mohan Reddy P, Jayalakshmi P, Rajani Kanth V
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
Terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
