A Seed-Guided Ant Colony Optimization Method for Capacitated Vehicle Routing Problem
Date Issued
2004
Date
2004
Author(s)
Chen, Chun-Chieh
DOI
zh-TW
Abstract
We presented two ACO-based models to solve Vehicle Routing Problem (VRP) named “Composite ACO” and “Synchronized ACO”. Generally speaking, combination problems can be modeled to sequencing problems and clustering problems, but VRP combines both sequencing (to determine sequence of route) and clustering attributes. Besides, we also presented a clustering algorithm called P-K-means. P-K-means is a polar-coordinate based clustering algorithm, and its main task is to determine the seeds in advance. The function of the seeds are clustering the vehicles. By using the information of the seeds, we can obtain better clustering results.
We also compare our algorithm with 14 benchmarks VRP problems, and the results show that our algorithms perform much better than the others.
Subjects
K-means
車輛途程問題
蟻拓尋優法
P-K-means
ant colony optimization
vehicle routing problem
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-R91546015-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):1274740a0c0751fcad7869bcc841271a