Name
Abstract | ||
|---|---|---|
Vehicle routing problem(VRP) has the same mathematical model with many combinatorial optimization problems, they are typical NP- hard problems in combinatorial optimization problem. In this paper, artificial bee colony (ABC) algorithm is applied to solve VRP. We propose a method to keep the colony diversity and improve the search efficiency of ABC. To validate the performance of ABC algorithm, we calculate the instance from standard VRP database. The results show that improved ABC can be used for VRP efficiently. |
Year | Venue | Keywords |
|---|---|---|
2014 | Communications in Computer and Information Science | VRP,Colony diversity,Search efficiency,Improved ABC |
DocType | Volume | ISSN |
Conference | 472 | 1865-0929 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||