Wan Ibrahim, Wan Rohaizad and Mazlan, Siti Hajar (2018) Traveling salesman approach for solving goods delivery by using simulated annealing. In: Proceedings of Final Year Project Symposium 2018, 23 May 2018 through 27 May 2018, UTM Skudai.
Full text not available from this repository.
Abstract
Pickup and delivery services were widely used in business nowadays. This study is conducted with the purpose to solve a delivery services of Gardenia bun to 7-Eleven around Johor Bahru. This traveling system is formulated as a Traveling Salesman Problem (TSP). TSP is the optimization problem that focuses on finding an optimal route for visiting places and going back to the point of origin. This study is conducted by using a method of Simulated Annealing to find the best route. The optimization problem for this study is generated through a software of Microsoft Visual C++ programming to solve the TSP.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Traveling salesman problem, simulated annealing |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Science |
| ID Code: | 83918 |
| Deposited By: | Widya Wahid |
| Deposited On: | 30 Sep 2019 13:55 |
| Last Modified: | 20 Nov 2019 03:03 |
Repository Staff Only: item control page
