|
Max-Min Ant System to Solve Vehicle Routing Problem Case Study: THANTIP Factory of Drinking Water |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Suphan Sodsoon 2. Sombat Sindhuchao |
| Title | Max-Min Ant System to Solve Vehicle Routing Problem Case Study: THANTIP Factory of Drinking Water |
| Publisher | Faculty of Engineering, Khon Kaen Univeristy |
| Publication Year | 2553 |
| Journal Title | KKU Engineering Journal |
| Journal Vol. | 37 |
| Journal No. | 2 |
| Page no. | 141-149 |
| Keyword | Meta-heuristic,Max-Min Ant System, Vehicle routing problem |
| ISSN | 0125-8273 |
| Abstract | This research was presented meta-heuristic for solving the vehicle routing problem. The problems were a combinatorial optimization and NP-hard problem. The Max-Min Ant System (MMAS) was applied to solve forsolutions in order to minimize the total distance traveled. The demand of each customer was certain and the vehicle capacity was limited. MMAS consisted of tree phase. The first was to construct and initial feasible solution and the second; the solution was improved by applying local search methods. There were 2Opt; Swap operator and Move exchanges procedure. Finally, pheromone updating. The computation results showed the proposed heuristic provided good solution by reducing travel distance from 154.3 kilometer per day to 119.3 kilometer per day (29.59% reduced) and it was a reasonable computational time. |
