A ROBUST MULTI-TRIP VEHICLE ROUTING PROBLEM OF PERISHABLE PRODUCTS WITH INTERMEDIATE DEPOTS AND TIME WINDOWS

摘要

Distribution of products within the supply chain with the highest quality is one of the most important competitive activities in industries with perishable products. Companies should pay much attention to the distribution during the design of their optimal supply chain. In this paper, a robust multi-trip vehicle routing problem with intermediate depots and time windows is formulated to deals with the uncertainty nature of demand parameter. A mixed integer linear programming model is presented to minimize total traveled distance, vehicles usage costs, earliness and tardiness penalty costs of services, and determine optimal routes for vehicles so that all customers' demands are covered. A number of random instances in different sizes (small, medium, and large) are generated and solved by CPLEX solver of GAMS to evaluate the robustness of the model and prove the model validation. Finally, a sensitivity analysis is applied to study the impact of the maximum available time for vehicles on the objective function value.