000 02905nas|a2200433 i 4500
005 20260817162742.0
008 040423s2003 th uzm rtt 00| a1eng d
035 _a.b11922412
099 9 _aAIT Thesis no. ISE-03-13
100 0 _aDang Duy Linh
245 1 3 _aAn ant colony algorithm for solving the multi-depot vehicle routing problem
260 _aPathum Thani, Thailand :
_bAsian Institute of Technology,
_c2003
300 _a92 p.
490 1 _aThesis ;
_vno. ISE-03-13
502 _aThesis (M.Eng.) - Asian Institute of Technology, 2003
500 _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies
520 _aThis 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.
650 0 _aVehicles
650 0 _aHeuristic programming
700 1 _aAnulark Techanitisawad,
_eChairperson
700 1 _aHuynh, Trung Luong,
_eExamination Committee
700 0 _aVoratas Kachitvichyanukul,
_eExamination Committee
710 2 _aPetro Vietnam Corporation,
_eScholarship Donor
810 2 _aAsian Institute of Technology.
_tThesis ;
_vno. ISE-03-13
856 _3Full-Text
_u http://203.159.5.9/ait-thesis/detail.php?q=B08494
907 _a.b11922412
_bmnait
_cu
902 _a251201
998 _b0
_c040423
_dm
_ea
_fu
_g3
945 _lmnait
945 _lmnait
945 _lmnarc
942 _c22
942 _c14
942 _c40
909 _aBarcode : 30050120553606
_bCREATED : 2004-04-23
_cRECORD # : i12390744
_dLPATRON : 1024233
_eLCHKIN : 2012-11-19
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 8
_jTOT RENEW : 9
909 _aBarcode : 300501205536
_bCREATED : 2012-08-22
_cRECORD # : i12689518
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050160018197
_bCREATED : 2016-02-19
_cRECORD # : i12885393
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c6146
_d6146