TY  - SER
AU  - Dang Duy Linh
AU  - Anulark Techanitisawad
AU  - Huynh,Trung Luong
AU  - Voratas Kachitvichyanukul,
ED  - Petro Vietnam Corporation,
TI  - An ant colony algorithm for solving the multi-depot vehicle routing problem
T2  - Thesis
PY  - 2003///
CY  - Pathum Thani, Thailand
PB  - Asian Institute of Technology
KW  - Vehicles
KW  - Heuristic programming
N1  - A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies; Thesis (M.Eng.) - Asian Institute of Technology, 2003
N2  - This thesis document is the author's research of Multi-Depot Vehicle Routing Problem. The objective of the problem is to find route serving all customers from several depots while minimizing the cost of travel and vehicles usage. Combinatorial optimization problems of this kind are NP-hard and are best solved by heuristics. In this study a new Ant colony-based heuristic named "Multiple Ant Colonies" was developed for obtaining an approximate solution to this problem. Most heuristics in the literature solve the Multi-Depot Vehicle Routing Problem in two stages: clustering and routing. With Multiple Ant heuristic, we try to assign customer to depot and construct route at the same time by using more than one ant colony. The heuristic was tested on several standard problems. The results showed that Multiple Ant heuristic performs very well with small and medium scale problems (up to 200 nodes) and acceptable with larger problem size
UR  -  http://203.159.5.9/ait-thesis/detail.php?q=B08494
ER  -