| dc.description.abstract | Logistics operations in Vietnam have seen significant development in recent years,
paralleling the expansion of e-commerce platforms throughout Asia. The efficiency of
processing and delivery plays a crucial role in determining the success or failure of a
firm venturing into this sector. Conventional delivery routes are carefully designed and
organized to guarantee the maintenance of client services. Nevertheless, when faced
with unexpected customer demands, only a limited number of enterprises are capable
of satisfying such demands, resulting in inefficiencies in maintaining the quality of
service. The aim of this study was to use the Dynamic Vehicle Routing Problem with
Time Windows (DVRP-TW) model in order to efficiently handle and optimize extra
orders. To address the complexity of this issue, a combination of the Artificial Bee
Colony Algorithm (ABC) and Greedy Algorithm is proposed as a solution for DVRP TW. In addition, the precise technique is also used on tiny data sets consisting of 9
consumers to verify the logical consistency of the restrictions in the mathematical
model. The computational findings indicate that the mathematical model will perform
well as long as the consumers count remains below reasonable limits. In addition,
ABC's versatility has been proved via operating with diverse data sets: from 30 to 100
customers, and real-time data from online maps also helps with implementation. While
this algorithm still need further improvement, it is essential for addressing the issue of
accommodating consumer requests in a flexible manner, especially when contrasted to
the exact method. | en_US |
