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:
Main Author: | Banas Lubis, Faras |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/69315 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
ALGORITMA GENETIK DENGAN
PARTIAL-MAPPED CROSSOVER UNTUK
TRAVELING SALESMAN PROBLEM
by: NANIK AGUSTINI, 080012136
Published: (2004) -
Graph convolutional neural networks for the travelling salesman problem
by: Joshi, Chaitanya Krishna
Published: (2019) -
Solving traveling salesman problems by genetic algorithms
by: Liang, Y., et al.
Published: (2014) -
Simple learning algorithm for the traveling salesman problem
by: Chen, K.
Published: (2014) -
Comparative analysis of solving traveling salesman problem using artificial intelligence algorithms
by: Brucal, Stanley Glenn E., et al.
Published: (2017)