Optimal Vehicle Routing in Consumer Goods Distribution: A GNU Linear Programming Kit-Based Analysis

In businesses entailing the distribution of goods, the vehicle routing problem (VRP) critically influences the minimization of distribution costs and the curtailment of excessive vehicle utilization. This study delves into the formulation of the VRP within a firm specializing in the distribution of appliances and consumer goods, emphasizing the firm's unique operational characteristics. A mathematical model addressing the vehicle routing issue is meticulously crafted and subsequently resolved, yielding exact solutions through the application of the GNU Linear Programming Kit (GLPK). Comparative insights into the pre-existing and newly devised routing methodologies within the firm are elucidated. Owing to the dynamism in customer demands and daily deliveries, the propounded model has been designed for facile adaptability and frequent utilization. It demonstrates a marked enhancement over the conventional routing paradigms prevalent within the company. Recognizing potential avenues for advancement, considerations such as multi-warehouse integration and the introduction of customer-specific time windows, wherein goods must be dispatched within stipulated intervals, are acknowledged as prospects for future research and implementation.