| dc.description.abstract | The multi-depot vehicle routing problem with time window (MDVRPWTW) is
an extension of the vehicle routing problem (VRP) involving the departure and
return of vehicles from multiple depot locations while still meeting the customer's
working time requirements. In addition, customers that must be visited must be
identified. The MDVRPWTW determines each depot's service areas and vehicle
routes. This thesis describes the creation of a mixed integer programming model
and a constraint programming model for the MDVRPWTW. MILP conducts
computer tests on a collection of small-scale examples and a constraint
programming model designed for solving the problem faster. The MILP model
of MDVRPWTW was developed by Mirabi et al. (2016) improved under a new
version to have better control over the results and will become a solid foundation
for further development for other VRP problems in the future. In this thesis, both
CP and MILP algorithms are assumed to be Cplex. Thesis mentions an
MDVRPTW issue of an electrical appliance company that helps them to reduce
the risk of delivery time, while contributing to reducing the workload of an entire
delivery process. | en_US |
