Optimization of Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery

Résumé fourni par la source

This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery (MVRPTWSPD), aiming to optimize logistics distribution routes and minimize total costs. A vehicle routing optimization model is developed based on the operational requirements of the KS Logistics Center, focusing on minimizing vehicle dispatch, loading and unloading, operating, and time window penalty costs. The model incorporates constraints such as vehicle capacity, time windows, and travel distance, and is solved using a genetic algorithm to ensure optimal route planning. Through MATLAB simulations, 34 customer points are analyzed, demonstrating that the simultaneous pickup and delivery model reduces total costs by 30.13%, increases vehicle loading rates by 20.04%, and decreases travel distance compared to delivery-only or pickup-only models. The results demonstrate the significant advantages of the simultaneous pickup and delivery mode in reducing logistics costs and improving vehicle utilization, offering valuable insights for enhancing the operational efficiency of the KS Logistics Center.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.