The Two-Echelon Routing Problem constitutes a class of combinatorial optimization problems with applications in many different fields such as city logistic planning, intermodal transportation, postal and parcel delivery distribution systems and so on. This thesis contains: a survey of the main contributions related to the two-echelon routing, focusing on the Two-Echelon Location Routing Problem...

We address a Multi-Commodity two-echelon Distribution Problem (MC2DP) where three sets of stakeholders are involved: suppliers, distribution centers, and customers. Multiple commodities have to be sent from suppliers customers, using multiple centers for consolidation purposes. Commodities collected the delivered with direct trips, while fleet homogeneous vehicles distributes compatible, that i...

In this work, we present a new algorithm for solving complex multi-stage optimization problems involving hard constraints and uncertainties, based on dynamic and multi-parametric programming techniques. Each echelon of the dynamic programming procedure, typically employed in the context of multi-stage optimization models, is interpreted as a multi-parametric optimization problem, with the prese...

<p style='text-indent:20px;'>In considering route optimization from multiple distribution centers called depots via some intermediate facilities satellites to final customers with commodities request, we introduce the Multi-Commodity Two-Echelon Vehicle Routing Problem Satellite Synchronization (MC-2E-VRPSS). The MC-2E-VRPSS involves transportation on first echelon and deliveries second e...

 In this research, a tri-objective mathematical model is proposed for the Transportation-Location-Routing problem. The model considers a three-echelon supply chain and aims to minimize total costs, maximize the minimum reliability of the traveled routes and establish a well-balanced set of routes. In order to solve the proposed model, four metaheuristic algorithms, including Multi-Objective Gre...