Traveling salesman approach for solving goods delivery by using simulated annealing
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 fo...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 出版事項: |
2018
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/83918/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | 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. |
|---|