| dc.description.abstract | Jumping into 21st century, logistics field remains a lot of concerns and development from technology companies who provide 3PLs to manufacturers with expertise technical consultants as well as the advance in software platform, equipped with optimization algorithms to solve complex and multi-constraints problem in real transportation problems. This thesis will consider the Dynamic - Capacitated Vehicle Routing Problem (DVRP) for - a 3PL distribution center - whose goods are mainly beverages for customers like restaurants, companies, etc. The DVRP will be solved with Enhanced ACO (E-ACO) to minimize the distance travel between customers and deal with customers whose orders appear during service time. The real data sets collected from the 3PLs company will be applied for the code, the result will be analyzed and compared with the nomal traditional method to assess their performance and customers served. Methods have their own advantages and drawbacks, E-ACO algorithm programed with Matlab is more applicable as it takes significantly lesser time to solve, however, it cannot get the exact solution like Lingo.
Keywords: Dynamic - VRP, Capacitated Vehicle Routing problem, ACO, K-means, Crossover, Local Search. | en_US |
