- Category:
- GDI-Bitmap
- Tags:
-
- File Size:
- 82kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- eesdgm
Description: W ith the ant colony algorithm for solving the traveling salesman problem (TSP) as a prototype, a simpli-
fied algorithm was developedwhich considered a capacity-constrained vehicle routing problem as several independent
TSPswith the depotserving as one of the cities in eachTSP. Pheromone updatewas analyzed and itwas found in the
searching process tha,t if the current solution is bestof all so far, then increase of the pheromone of the path found by the elitist ants further improves the solution and speed up the convergence. Moreover, allowingmore degree of
freedom at the initial stage results in better solution. Experimental results show that the simplified algorithm can efficiently find a satisfactory solution, with an error ofnomore than 1·5 of the optimal one.
To Search:
File list (Check if you may need any files):
p1.kdh
Download