Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing
This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to...
Main Author: | Kovàcs, Akos |
---|---|
Format: | Others |
Language: | English |
Published: |
Högskolan Dalarna, Datateknik
2008
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:du-3306 |
Similar Items
-
Топологічна евристика в розв'язанні проблеми маршрутизації транспортних засобів (VRP)
by: Іван Михайлович Найдьонов
Published: (2015-06-01) -
Optimal Path Searching through Specified Routes using different Algorithms
by: Farooq, Farhan
Published: (2009) -
Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution
by: Anak Agung Ngurah Perwira Redi, et al.
Published: (2020-07-01) -
A novel approach for solving travelling thief problem using enhanced simulated annealing
by: Hamid Ali, et al.
Published: (2021-03-01) -
O SOLUŢIE APROXIMATIVĂ A PROBLEMEI COMIS-VOIAJORULUI FOLOSIND UN SET DE EURISTICI
by: Dmitri TERZI
Published: (2020-08-01)