Multi-Depot Vehicle Routing Problem: A Case Study Of M-Green Co.Ltd

Abstract

This paper considers the multi-depot vehicle routing problem in which each vehicle starts from a depot and need to return to its primary depot after serving customers. The mathematic model aims to minimize the transportation costs including traveled distance in case of caring customers as much as possible in one route. Google API in Python will calculate exactly distance between nodes, this is one of the important part to create the real data for the problem, it means the practicality will be ensure in real cases. After that, the mathematic formulation is solved by using CPLEX finding solutions. Furthermore, in order to reduce the variables in formulation to increase the scale for this thesis, Tuple in Python is used to tackle this problem. In the following section, the model with Tuple assignment will be run for 30 datasets, identify optimal route in multi-depot vehicle routing problem (MVRP) which contains 3 depots, 30 customers, 3 vehicle types and others related features.