An ant colony algorithm for solving the multi-depot vehicle routing problem (Record no. 6146)

MARC details
000 -LEADER
fixed length control field 02905nas|a2200433 i 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260817162742.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 040423s2003 th uzm rtt 00| a1eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b11922412
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT Thesis no. ISE-03-13
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name Dang Duy Linh
245 13 - TITLE STATEMENT
Title An ant colony algorithm for solving the multi-depot vehicle routing problem
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Pathum Thani, Thailand :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 2003
300 ## - PHYSICAL DESCRIPTION
Extent 92 p.
490 1# - SERIES STATEMENT
Series statement Thesis ;
Volume/sequential designation no. ISE-03-13
502 ## - DISSERTATION NOTE
Dissertation note Thesis (M.Eng.) - Asian Institute of Technology, 2003
500 ## - GENERAL NOTE
General note A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies
520 ## - SUMMARY, ETC.
Summary, etc. 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Vehicles
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Heuristic programming
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Anulark Techanitisawad,
Relator term Chairperson
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Huynh, Trung Luong,
Relator term Examination Committee
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Voratas Kachitvichyanukul,
Relator term Examination Committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Petro Vietnam Corporation,
Relator term Scholarship Donor
810 2# - SERIES ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Asian Institute of Technology.
Title of a work Thesis ;
Volume/sequential designation no. ISE-03-13
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href=" http://203.159.5.9/ait-thesis/detail.php?q=B08494"> http://203.159.5.9/ait-thesis/detail.php?q=B08494</a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b11922412
b mnait
c u
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 251201
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 0
Cataloger's initials, CIN (RLIN) 040423
First date, FD (RLIN) m
-- a
-- u
-- 3
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 22-AIT Thesis (Replacement)
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 14-General Book
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 40-Archives
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120553606
CREATED CREATED : 2004-04-23
RECORD Id RECORD # : i12390744
LPATRON LPATRON : 1024233
LCHKIN LCHKIN : 2012-11-19
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 8
-- TOT RENEW : 9
909 ## - LOCAL ITEMS USED
Barcode Barcode : 300501205536
CREATED CREATED : 2012-08-22
RECORD Id RECORD # : i12689518
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050160018197
CREATED CREATED : 2016-02-19
RECORD Id RECORD # : i12885393
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 17/08/2026 50.00   AIT Thesis no. ISE-03-13 30050120553606 17/08/2026 3 17/08/2026 22-AIT Thesis (Replacement)
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 17/08/2026     AIT Thesis no. ISE-03-13 300501205536 17/08/2026 1 17/08/2026 14-General Book
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 17/08/2026     AIT Thesis no. ISE-03-13 30050160018197 17/08/2026 1 17/08/2026 40-Archives
คัดลอกแล้ว!