AI SearchAn ant colony algorithm for solving the multi-depot vehicle routing problem
Call Number: AIT Thesis no. ISE-03-13 Material type:
SeriesSeries: Asian Institute of Technology. Thesis ; no. ISE-03-13Publication details: Pathum Thani, Thailand : Asian Institute of Technology, 2003Description: 92 pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 2003 Summary: 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.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. ISE-03-13 (Browse shelf(Opens below)) | 3 | Available | 30050120553606 | |||||||||||||
| 14-General Book | Asian Institute of Technology Library AIT Publications | AIT Thesis no. ISE-03-13 (Browse shelf(Opens below)) | 1 | Available | 300501205536 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no. ISE-03-13 (Browse shelf(Opens below)) | 1 | Available | 30050160018197 |
Thesis (M.Eng.) - Asian Institute of Technology, 2003
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies
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.
There are no comments on this title.