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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Final Project |
| اللغة: | Indonesia |
| الوصول للمادة أونلاين: | https://digilib.itb.ac.id/gdl/view/69315 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Institut Teknologi Bandung |
| اللغة: | Indonesia |