Creating a single-day travel itinerary for multiple tourism destinations in Kuala Lumpur using integer linear programming of travelling salesman problem / Muhammad Ayman Nor Isjamal Naser
This study presents a novel approach for creating a single-day travel itinerary with an optimal visit sequence for multiple tourism destinations in Kuala Lumpur. Leveraging the principles of integer linear programming and the traveling salesman problem (TSP), the research aims to address the challen...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Student Project |
| 语言: | English |
| 出版: |
2024
|
| 主题: | |
| 在线阅读: | https://ir.uitm.edu.my/id/eprint/95142/1/95142.pdf https://ir.uitm.edu.my/id/eprint/95142/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|