| dc.description.abstract | We introduce the Multi-depot Two-Echelon Vehicle Routing Problem while considering
route optimization from numerous distribution centers called depots to certain intermediary
facilities called satellites to the end client (MD-TEVRP). The MD-TEVRP involves the
delivery of goods from numerous depots to satellites and from satellites to ultimate
consumers. The MD-TEVRP includes satellite time window limitations for satellites on the
two-echelon network and tries to discover the most cost-effective paths for the two-echelon
network. In this paper, a mixed integer programming model for the MD-TEVRP is
developed. We undertake computer tests on a collection of small-scale examples using
CPLEX and an Adaptive Large Neighborhood Search (ALNS) heuristic that we design for
the problem in order to validate the model formulation. In addition, computer experiments
are undertaken to evaluate the applicability of the ALNS heuristic on a collection of largescale examples, proving the efficacy of the ALNS. | en_US |
