Dynamic Vehicle Routing Problem For Perishable Food

Vehicle Routing Problems are optimization problems.They are a field of operation research that apply to delivery businesses.The aim of these problems is to fulfill the deliveries while optimizing the logistical resources(travel costs,human and material resources,etc.).The problem studied in this paper was formulated as a Heterogeneous Vehicle Routing Problem with Multiple Capacities and Time Windows(HVRPMCTW).The company concerned delivers 2 types of food across Shanghai and would like to include exceptional customers to its everyday routes.In order to optimize the computational time of the business,a procedure is developed here that allows a few modifications to the initial problem without excessive computation time.The study is focused on the relationship between logistical cost and computation time.Using Late Acceptance algorithm,several datasets will be compared with dynamic or static situations,in order to find the best results with the shortest computation time.The results of this research enable the financial justification of dynamic solving for specific business strategies in delivery activities.