Traveling salesperson problem using Python

• المؤلف الرئيسي: Lim, Petrina Jia Min
• مؤلفون آخرون: Jiang Xudong
• التنسيق: Final Year Project
• اللغة: English
• منشور في: Nanyang Technological University 2023
• الموضوعات: Engineering::Electrical and electronic engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/167015
• المؤسسة: Nanyang Technological University

A well-known optimization issue in operations research, mathematics, and computer science is the Traveling Salesman Problem (TSP). It entails determining the quickest path a salesman can take to travel to a series of cities, stop in each one exactly once, and then return to the beginning locat...