| dc.description.abstract | Two Echelon- Multi Depot Capacitated Vehicle Routing Problem (2E-MDCVRP)
is a multi-depot, capacity, and two-echelon vehicle routing problem. This dissertation
aims to develop a 2E-MDCVRP model that can be used to solve e-commerce
logistics distribution problems in cities. In this model, it is possible to combine
several orders from the same customer. The satellite between the depot and the
customer makes it possible to collect and sort orders. The model’s objective function
is to minimize the costs of driver wages, handling, fuel consumption, vehicle
maintenance, and application services. In the solution method, the 2E-MDVRP
problem is solved in two stages. The first stage solves the routing problem between
the satellite and the customer in the second echelon. In the second stage, solving
the first echelon problem, namely, the problem of routing between the depot and
the satellite. Collaboration of the K-Means clustering algorithm and the Repetitive
Nearest Neighbor heuristic method is used in finding solutions. At the end of the
dissertation, a simulation is presented to test the model’s effectiveness. | en_US |
