Applying Improved Ant Colony Optimization to Vehicle Routing Problem with Time Windows: A Dynamic Method to Construct Vehicle Routes

• Main Authors: Yu-Wei Chang, 張育偉
• Other Authors: Ming-hsien Chen
• Format: Others
• Language: zh-TW
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/86078590249255218709

碩士 === 大同大學 === 資訊經營學系(所) === 103 === This paper studies applies ant colony optimization (ACO) to the vehicle routing problem with time windows (VRPTW).The effects of time window constraints are studied. The order of customer service is dynamically decided by considering current time points and time window constraints. Therefore, this study proposes a time-oriented heuristic approach to select next customer for each vehicle. Ant algorithm is a newer meta-heuristic algorithm that was developed based on ant’s behaviors for food searching. The time-oriented heuristic approach is embedded in the random-proportional rule of ACO. In addition, this paper uses 2-interchange and or-interchange mechanisms to improve the soulution quality of ACO.