Vehicle Routing Problem – The Case Study Of Viettel Post

Abstract

Globalization and the quick development of information technologies have altered how things are delivered to consumers. To save transportation expenses, many businesses maintain several factories, warehouses, and distribution centers. They also aim for competitive efficiency in their distribution operations. To allow for numerous trips to a client, this study presented the mixed integer programming (MIP) paradigm for multi-depot split-delivery vehicle routing problems (MDSDVRPs) with hetero vehicles. Dynamic mutation strategies are included in a unique two dimensional chromosomal representation of a genetic algorithm (GA). The Taguchi approach is utilized to optimize the process parameters of the suggested GA. The suggested algorithms demonstrated the competitive performance even for the traditional single-depot vehicle routing issues without split-delivery, as well as the advantages of split-delivery in MDSDVRPs.