| dc.description.abstract | Planning for the fleet to operation for a week is a crucial and challenging task when ensure
all KPI about customer planning, truck utilization, save cost. Therefore this thesis has dived
into the special case of the Multi-Trip, Multi-Depot Vehicle Routing Problem
(MTMDVRP), with a specific focus on the case study of Thuan Hai. The investigation has
provided valuable insights into the challenges and intricacies faced by organizations
operating in a multi-depot environment, emphasizing the need for efficient route
optimization strategies. In this thesis, Constraint programming technique with new
modelling approach is used to provide the optimal solution for real case data of Thuan Hai.
A sensitivity analysis is conduct to find the suitable parameter for Thuan Hai operation. The
result show that Thuan Hai should replace small dump truck (10T) into medium or large
dump truck (20T/30T) for increasing truck utilization. The result also prove that changing
the objective function into minimize total truck using and adding constraint about customer
receiving time less than 12h can provide the most suitable solution that can apply in real
world | en_US |
