Non-Deterministic and Polynomial Time Problem Simulator
DOI:
https://doi.org/10.54060/jieee.v4i1.74Keywords:
Heuristics, AlgorithmsAbstract
The Non-Deterministic and Polynomial Time Problem is a problem in combinatorial op-timization. Finding the quickest route for an object to travel through a list of cities and return to the starting city is the goal of this problem. Cities are listed, along with the dis-tance between each pair. It belongs to the category of computer problems known as NP-complete problems, for which no effective algorithmic solution has yet been discov-ered; at this time, there is no polynomial solution. In order to discover a near-optimal solution as quickly as possible, we attempted to tackle this extremely challenging prob-lem in this study utilizing a variety of heuristics, including Simulated Annealing and Ge-netic Algorithm. Using these sophisticated heuristic techniques, we at-tempt to depart from the local optimum.
Downloads
References
R. R. Geetha, N. Bouvanasilan, and V. Seenuvasan, “A perspective view on Travelling Salesman Problem using genetic algo-rithm,” in 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 2009.
G. Zhao, W. Luo, H. Nie, and C. Li, “A genetic algorithm balancing exploration and exploitation for the travelling salesman problem,” in 2008 Fourth International Conference on Natural Computation, 2008.zhaogang@ieee.org
J. W. Pepper, B. L. Golden, and E. A. Wasil, “Solving the Traveling Salesman Problem with Annealing-Based Heuristics: A Com-putational Study”,” IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS-PART A: SYSTEMS AND HUMANS, vol. 32, no. 1, 2002.
Wikipedia contributors, “Travelling salesman problem,” Wikipedia, The Free Encyclopedia, [Online]. Available: https://en.wikipedia.org/w/index.php?title=Travelling_salesman_problem&oldid=1156108616.
T. Me, “Simulated annealing for beginners,” Theprojectspot.com. [Online]. Available: http://www.theprojectspot.com/tutorial-post/simulated-annealing-algorithm-for-beginners/6. [Accessed: 06-Jan-2023].
T. Me, “The Project Spot,” Theprojectspot.com. [Online]. Available: http://www.theprojectspot.com/tutorial-post/simulated-annealing-algorithm-for-beginners/. [Accessed: 06-Jan-2023].
D. Barrell, Agile Accessibility Explained: A practical guide to sustainable accessible software development, Amazon Digital Ser-vices. 2019.
P. Blanck, The Struggle for Web Accessibility by Persons with Cognitive Disabilities, Cambridge Disability Law and Policy Series. 2015.
S. Burgstahle, Creating Inclusive Learning Opportunities in Higher Education. Harvard Education Press, 2020.
S. Burgstahle, Universal Design in Higher Education: From Principles to Practice. Harvard Education Press, 2008.
J. Byrne, 60 hot to touch Accessible Web Design tips - the tips no web developer can live without!, ISBN. 978-1-4116-6729-7, 2006.
M. Chisholm, Universal Design for Web Applications: Web Applications That Reach Everyone. O’Reilly Media, 2008.
Downloads
Published
How to Cite
CITATION COUNT
License
Copyright (c) 2023 Himanshu Mishra, Dr. Pawan Singh
This work is licensed under a Creative Commons Attribution 4.0 International License.
