| dc.description.abstract | The goal of this thesis is to apply Artificial Bee Colony algorithm for the Vehicle
Routing Problem with Time Window for an E-commerce company in Vietnam which is
an extension of the vehicle routing problem (VRP), a classic combinatorial optimization
problem. The problem is modeled aim to ensure that it could fit in real-world delivery
conditions such as a time frame and a capacity limit. Artificial Bee Colony algorithm
proposes a high- efficient solution which has the ability to apply to a wide range of VRPs
problems. In addition, the ABC algorithm will be tested and benchmarked using datasets
from Solomon’s dataset, as well as real-world data. The results suggest that ABC is
successful in solving VRP problems in real-life situations, even if the dataset is big. | en_US |
