|
Ant colony system (ACS) with hybrid local search to solve vehicle routing problems |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Suphan Sodsoon 2. Savalee Uttra 3. Sombat Sindhuchao |
| Title | Ant colony system (ACS) with hybrid local search to solve vehicle routing problems |
| Publisher | Faculty of Engineering, Khon Kaen University |
| Publication Year | 2559 |
| Journal Title | KKU Engineering Journal |
| Journal Vol. | 43 |
| Journal No. | 1 |
| Page no. | 1-8 |
| Keyword | Vehicle routing problems, Ant colony system, Hybrid local search, Cross-exchange, Or-opt and 2-Opt algorithm |
| ISSN | 0125-8273 |
| Abstract | This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP) from a single depot when the customers' requirements are known. VRP is an NP-hard optimization problem and has usually been successfully solved optimum by heuristics. A fleet of vehicles of a specific capacity are used to serve a number of customers at minimum cost, without violating the constraints of vehicle capacity. There are meta-heuristic approaches to solve these problems, such as Simulated Annealing, Genetic Algorithm, Tabu Search and the Ant Colony System algorithm. In this case a hybrid local search was used (Cross-Exchange, Or-Opt and 2-Opt algorithm) with an Ant Colony System algorithm. The Experimental Design was tested on 7 various problems from the data set online in the OR-Library. There are five different problems in which customers are randomly distributed with the depot in an approximately central location. The customers were grouped into clusters. The results are evaluated in terms of optimal routes using optimal distances. The experimental results are compared with those obtained from meta-heuristics and they show that the proposed method outperforms six metaheuristics in the literature. |
