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...
保存先:
第一著者: | |
---|---|
フォーマット: | Student Project |
言語: | English |
出版事項: |
2024
|
主題: | |
オンライン・アクセス: | https://ir.uitm.edu.my/id/eprint/95142/1/95142.pdf https://ir.uitm.edu.my/id/eprint/95142/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|