OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY
Food and beverage company "X" is one of the providers of delivery services facing challenges in optimizing the routes for delivering customer orders. In this final project, the researcher construct a mathematical model to determine the optimal route in the Traveling Salesman Problem using...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/73008 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |
| 總結: | Food and beverage company "X" is one of the providers of delivery services facing challenges in optimizing the routes for delivering customer orders. In this final project, the researcher construct a mathematical model to determine the optimal route in the Traveling Salesman Problem using the Cheapest Insertion Heuristic method. The researcher implement the algorithm using Python programming language and applies it to find the optimal routes in two cases: one without sequence selection and the other with sequence selection. The researcher perform simulations for two options of distance data from the company's address, namely the closest and farthest distance data. The algorithm's output consists of the selected routes counting the total distance traveled. |
|---|