One of the significant side-effects of growing urbanization is the constantly increasing amount of freight transportation in cities. This is mainly performed by conventional vans and trucks and causes a variety of problems such as road congestion, noise nuisance and pollution. Yet delivering goods to residents is a necessity. Sustainable concepts of city distribution networks are one way of mitigating difficulties of freight services. In this paper we develop a two-echelon city distribution scheme with temporal and spatial synchronization between cargo bikes and vans. The resulting heuristic is based on a greedy randomized adaptive search procedure with path relinking. In our computational experiments we use artificial data as well as real-world data of the city of Vienna. Furthermore we compare three distribution policies. The results show the costs caused by temporal synchronization and can give companies decision-support in planning a sustainable city distribution concept.

Two-echelon vehicle routing problems which contain synchronization between vehicles can be deeply impacted by time uncertainty, because one vehicle's delay can propagate to other vehicles. In this paper, we evaluate the deterministic solution of such a problem based on simulated travel time scenarios. The information obtained by simulation is incorporated in the optimization procedure iteratively. Computational results show that the degree of synchronization in an instance is directly correlated with the potential improvements by reoptimization. We present findings on the number of travel time scenarios required to obtain a representative picture of the stochastic solutions. In addition, we demonstrate that time dependent travel times can be aggregated on a city-wide level and linearized as a function of free flow times without major loss of reliability.

Increased product proliferation and global competition are forcing companies within the supply chain to adopt new strategies. Postponement is an effective strategy that allows companies to be agile and cost effective in dealing with the dynamics of global supply chains. Postponement centres around delaying activities in the supply chain until real information about the market is available, which reduces the complexity and uncertainty of dealing with a proliferation of products. A two-echelon divergent supply chain entailing a central production facility and N retailers facing stochastic demand is studied within the inventory-distribution system. A periodic review order-up-to strategy is incorporated at all echelons. Unique to the study, five different systems are created and the effectiveness of several postponement strategies (form and transshipment) under various operational settings are compared. The importance of postponement under an integrated supply chain context and its contribution to various sector implementations are also discussed. Simulation is used to analyze the performance of the systems especially with respect to cost, order lead time and the effectiveness of transshipment policies. The study is unique in determining factors that favour one system implementation over another and distinguishing sector requirements that support postponement. In the study, postponement is found to be an effective strategy in dealing with managing item variety, demand uncertainty and differences in review periods in the two echelon supply chain for different experimental settings.

In this dissertation, we consider a multi-item two-echelon inventory distribution system in which the central warehouse operates with (Q, R) policy, and each local warehouse implements base-stock policy. The objective is to find the policy parameters minimizing the relevant system-wide costs subject to an aggregate mean response time constraint at each facility. We first propose an exact solution procedure based on a branch-and-price algorithm to find the relevant policy parameters of the system considered. Then, we propose four alternative heuristics to find the optimal or near-optimal policy parameters of large practical-size systems. The first heuristic, which we call the Lagrangian heuristic, is based on the simultaneous approach and relies on the integration of a column generation method and a greedy algorithm. The other three heuristics are based on the sequential approach, in which first the order quantities are determined using a batch size heuristic, then the reorder levels at the central warehouse and the basestock levels at the local warehouses are determined through the same method used for the Lagrangian heuristic. We also propose a lower bound for the system-wide cost. Later, we extend our study to compound Poisson demand. The performance of the Lagrangian heuristic is found to be extremely well and improves even further as the number of parts increases. Also the computational requirement of the heuristic is quite tolerable. This makes the heuristic very promising for large practical industry-size problems. The performance of the sequential heuristics is also satisfactory, but not as much as the Lagrangian heuristic.

In this study, inventory&ndash / distribution system of a company operating in Fast Moving Consumer Goods (FMCG) industry is analyzed. The system is a multi&ndash / item, two-echelon, divergent inventory&ndash / distribution system with transportation constraints. The warehouses in the system are nonidentical and all of the warehouses are allowed to hold stock. The goal is to achive target customer service levels. Throughout the system, inventory is controlled by echelon stock periodic review (R, S) order-up-to level policy. The problem is the determination of inventory control parameters in the system and effective replenishment of the inventories of many items at regional warehouses under transportation constraints. An approach consisting of three modules operating in a hierarchy is developed to manage the system. The approach calculates the inventory control parameters of the items (order-up-to levels at the regional warehouses and stock allocation fractions) / determines the replenishment periods of the items with the objective of balancing the vehicle requirements among periods and performs the daily replenishment of inventories minimizing the maximum deviation from the inventory policy under transportation constraints. A heuristic approach is adapted from the literature for the inventory control parameter determination part of the approach / an IP model is formulated for the replenishment period scheduling part and a MIP model is constructed for the replenishment process. The proposed approach is simulated with retrospective data of the company and compared with the existing system in the company, in terms of the performance measures defined. Satisfactory results are obtained with the proposed system.

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of finding good-quality solutions quickly. The computational results on a large set of instances from the literature show that the ALNS outperforms existing heuristics. Furthermore, the branch-and-cut method provides tight lower bounds and is able to solve small- and medium-size instances to optimality within reasonable computing times.

In this paper,we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP).The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm out performs existing solution methods for the 2E-VRP and achieves excellent results on the LRP.

El texto completo de este trabajo no está disponible en el Repositorio Académico UPC por restricciones de la casa editorial donde ha sido publicado. / The present research seeks to show the importance of applying process management techniques and food safety norms in the operational processes of the supply chain to know the meaning and the need for an integrated hybrid model. The article reviews the sugarcane distillery sector of Peru and its main operational problems. Based on the literature reviewed and discussed with academics who have knowledge of the food supply chain, an integrated hybrid model was developed to help any distillery with lower levels of competitiveness than its competitors in other sectors, such as pisco, applying techniques of process management and food safety to increase the efficiency of liquor distilleries. The findings confirm that distilleries can increase their efficiency, thanks to the higher performance of their operations after their alignment with the integrated model. / Revisión por pares

We present a multi-objective two-echelon vehicle routing problem with vehicle synchronization and "grey zone" customers arising in the context of urban freight deliveries. Inner-city center deliveries are performed by small vehicles due to access restrictions, while deliveries outside this area are carried out by conventional vehicles for economic reasons. Goods are transferred from the first to the second echelon by synchronized meetings between vehicles of the respective echelons. We investigate the assignment of customers to vehicles, i.e., to the first or second echelon, within a so-called "grey Zone" on the border of the inner city and the area around it. While doing this, the economic objective as well as negative external effects of transport, such as emissions and disturbance (negative impact on citizens due to noise and congestion), are taken into account to include objectives of companies as well as of citizens and municipal authorities. Our metaheuristic - a large neighborhood search embedded in a heuristic rectangle/cuboid splitting - addresses this problem efficiently. We investigate the impact of the free assignment of part of the customers ("grey Zone") to echelons and of three different city layouts on the solution. Computational results show that the impact of a "grey Zone" and thus the assignment of these customers to echelons depend significantly on the layout of a city. Potentially pareto-optimal solutions for two and three objectives are illustrated to efficiently support decision makers in sustainable city logistics planning processes.

Avec la forte croissance du e-commerce et l'augmentation continue de la population des villes impliquant des niveaux de congestion plus élevés, les réseaux de distribution doivent déployer des échelons supplémentaires pour offrir un ajustement dynamique aux besoins des entreprises au cours du temps et faire face aux aléas affectant l’activité de distribution. Dans ce contexte, les praticiens s'intéressent aux réseaux de distribution à deux échelons. Dans cette thèse, nous commençons par présenter une revue complète des problèmes de design des réseaux de distribution et souligner des caractéristiques essentielles de modélisation. Ces aspects impliquent la structure à deux échelons, l’aspect multi-période, l’incertitude et les méthodes de résolution. Notre objectif est donc, d’élaborer un cadre complet pour le design d’un réseau de distribution efficace à deux échelons, sous incertitude et multi-périodicité, dans lequel les produits sont acheminés depuis les plateformes de stockage (WP) vers les plateformes de distribution (DP) avant d'être transportés vers les clients. Ce cadre est caractérisé par une hiérarchie temporelle entre le niveau de design impliquant des décisions relatives à la localisation des plateformes et à la capacité allouée aux DPs sur une échelle de temps annuelle, et le niveau opérationnel concernant des décisions journalières de transport. % sur une base journalière.Dans une première étude, nous introduisons le cadre complet pour le problème de design de réseaux de distribution à deux échelons avec une demande incertaine, une demande et un coût variables dans le temps. Le problème est formulé comme un programme stochastique à plusieurs étapes. Il implique au niveau stratégique des décisions de localisation des DPs ainsi que des décisions d'affectation des capacités aux DPs sur plusieurs périodes de design, et au niveau opérationnel des décisions de transport sous forme d'arcs origine-destination. Ensuite, nous proposons deux modèles alternatifs basés sur la programmation stochastique à deux étapes avec recours, et les résolvons par une approche de décomposition de Benders intégrée à une technique d’approximation moyenne d’échantillon (SAA). Par la suite, nous nous intéressons à la livraison du dernier kilomètre dans un contexte urbain où les décisions de transport dans le deuxième échelon sont caractérisées par des tournées de véhicules. Un problème multi-période stochastique de localisation-routage à deux échelons avec capacité (2E-SM-CLRP) est défini, dans lequel les décisions de localisation concernent les WPs et les DPs. Le modèle est un programme stochastique à deux étapes avec recours en nombre entier. Nous développons un algorithme de décomposition de Benders. Les décisions de localisation et de capacité sont déterminées par la solution du problème maître de Benders. Le sous-problème résultant est un problème multi-dépôt de tournées de véhicule avec des dépôts et véhicules capacitaires qui est résolu par un algorithme de branch-cut-and-price.Enfin, nous étudions le cadre à plusieurs étapes proposé pour le problème stochastique multi-période de design de réseaux de distribution à deux échelons et évaluons sa tractabilité. Pour ceci, nous développons une heuristique à horizon glissant qui permet d’obtenir des bornes de bonne qualité et des solutions de design pour le modèle à plusieurs étapes. / With the high growth of e-commerce and the continuous increase in cities population contrasted with the rising levels of congestion, distribution schemes need to deploy additional echelons to offer more dynamic adjustment to the requirement of the business over time and to cope with all the random factors. In this context, a two-echelon distribution network is nowadays investigated by the practitioners.In this thesis, we first present a global survey on distribution network design problems and point out many critical modeling features, namely the two-echelon structure, the multi-period setting, the uncertainty and solution approaches. The aim, here, is to propose a comprehensive framework for the design of an efficient two-echelon distribution network under multi-period and stochastic settings in which products are directed from warehouse platforms (WPs) to distribution platforms (DPs) before being transported to customers. A temporal hierarchy characterizes the design level dealing with facility-location and capacity decisions over a set of design periods, while the operational level involves transportation decisions on a daily basis.Then, we introduce the comprehensive framework for the two-echelon distribution network design problem under uncertain demand, and time-varying demand and cost, formulated as a multi-stage stochastic program. This work looks at a generic case for the deployment of a retailer's distribution network. Thus, the problem involves, at the strategic level, decisions on the number and location of DPs along the set of design periods as well as decisions on the capacity assignment to calibrate DP throughput capacity. The operational decisions related to transportation are modeled as origin-destination arcs. Subsequently, we propose alternative modeling approaches based on two-stage stochastic programming with recourse, and solve the resulting models using a Benders decomposition approach integrated with a sample average approximation (SAA) technique.Next, we are interested in the last-mile delivery in an urban context where transportation decisions involved in the second echelon are addressed through multi-drop routes. A two-echelon stochastic multi-period capacitated location-routing problem (2E-SM-CLRP) is defined in which facility-location decisions concern both WPs and DPs. We model the problem using a two-stage stochastic program with integer recourse. To solve the 2E-SM-CLRP, we develop a Benders decomposition algorithm. The location and capacity decisions are fixed from the solution of the Benders master problem. The resulting subproblem is a capacitated vehicle-routing problem with capacitated multi-depot (CVRP-CMD) and is solved using a branch-cut-and-price algorithm.Finally, we focus on the multi-stage framework proposed for the stochastic multi-period two-echelon distribution network design problem and evaluate its tractability. A scenario tree is built to handle the set of scenarios representing demand uncertainty. We present a compact formulation and develop a rolling horizon heuristic to produce design solutions for the multi-stage model. It provides good quality bounds in a reasonable computational times.