COMPARATION AND IMPLEMENTATION OF PARTIALLY MATCHED CROSSOVER ALGORITHM AND DIJKSTRA GRAPH THEORY FOR TRAVELLING SALESMAN PROBLEMS
One of the problems in logistics is the Capacitated Vehicle Routing Problem (CVRP) which is a sub-problem of the Traveling Salesman Problem. This problem takes the form of determining the minimum route and minimal 'cost' of delivering goods by vehicle and can be solved by algorithmic an...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/69315 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |