An economic order quantity stochastic dynamic optimization model in a logistic 4.0 environment

This paper proposes a stock dynamic sizing optimization under the Logistic 4.0 environment. The safety stock is conceived to fill up the demand variability, providing continuous stock availability. Logistic 4.0 and the smart factory topics are considered. It focuses on vertical integration to implement flexible and reconfigurable smart production systems using the information system integration in order to optimize material flow in a 4.0 full-service approach. The proposed methodology aims to reduce the occurring stock-out events through a link among the wear-out items rate and the downstream logistic demand. The failure rate items trend is obtained through life-cycle state detection by a curve fitting technique. Therefore, the optimal safety stock size is calculated and then validated by an auto-tuning iterative modified algorithm. In this study, the reorder time has been optimized. The case study refers to the material management of a very high-speed train

Network Flexibility for Recourse Considerations in Bi-Criteria Facility Location

What is the best set of facility location decisions for the establishment of a logistics network when it is uncertain how a company’s distribution strategy will evolve? What is the best configuration of a distribution network that will most likely have to be altered in the future? Today’s business environment is turbulent, and operating conditions for firms can take a turn for the worse at any moment. This fact can and often does influence companies to occasionally expand or contract their distribution networks. For most companies operating in this chaotic business environment, there is a continuous struggle between staying cost efficient and supplying adequate service. Establishing a distribution network which is flexible or easily adaptable is the key to survival under these conditions. This research begins to address the problem of locating facilities in a logistics network in the face of an evolving strategic focus through the implicit consideration of the uncertainty of parameters. The trade-off of cost and customer service is thoroughly examined in a series of multi-criteria location problems. Modeling techniques for incorporating service restrictions for facility location in strategic network design are investigated. A flexibility metric is derived for the purposes of quantifying the similarity of a set of non-dominated solutions in strategic network design. Finally, a multi-objective greedy random adaptive search (MOG) metaheuristic is applied to solve a series of bi-criteria, multi-level facility location problems

A joint network design and mulit-echelon inventory optimisation approach for supply chain segmentation

Segmenting large supply chains into lean and agile segments has become a powerful strategy allowing companies to manage different market demands effectively. A current stream of research into supply chain segmentation proposes demand volume and variability as the key segmentation criteria. This literature adequately justifies these criteria and analyses the benefits of segmentation. However, current work fails to provide approaches for allocating products to segments which go beyond simple rules of thumb, such as 80-20 Pareto rules. We propose a joint network and safety stock optimisation model which optimally allocates Stock Keeping Units (SKUs) to segments. We use this model, populated both with synthetic data and data from a real case study and demonstrate that this approach significantly improves cost when compared to using simple rules of thumb alone

Evaluation of sales and operations planning in a process industry

Cette thèse porte sur la planification des ventes et des opérations (S±&OP) dans une chaîne d'approvisionnements axée sur la demande. L'objectif de la S±&OP, dans un tel contexte, est de tirer profit de l'alignement de la demande des clients avec la capacité de la chaîne d'approvisionnement par la coordination de la planification des ventes, de la production, de la distribution et de l'approvisionnement. Un tel processus de planification exige une collaboration multifonctionnelle profonde ainsi que l'intégration de la planification. Le but étant d'anticiper l'impact des décisions de vente sur les performances de la chaîne logistique , alors que l'influence de la dynamique des marchés est prise en compte pour les décisions concernant la production, la distribution et l'approvisionnement. La recherche a été menée dans un environnement logistique manufacturier multi-site et multi-produit, avec un approvisionnement et des ventes régis par des contrats ou le marché. Cette thèse examine deux approches de S±&OP et fournit un support à la décision pour l'implantation de ces méthodes dans une chaîne logistique multi-site de fabrication sur commande. Dans cette thèse, une planification traditionnelle des ventes et de la production basée sur la S±feOP et une planification S±fcOP plus avancée de la chaîne logistique sont tout d'abord caractérisées. Dans le système de chaîne logistique manufacturière multi-site, nous définissons la S±&OP traditionnelle comme un système dans lequel la planification des ventes et de la production est effectuée conjointement et centralement, tandis que la planification de la distribution et de l'approvisionnement est effectuée séparément et localement à chaque emplacement. D'autre part, la S±fcOP avancée de la chaîne logistique consiste en la planification des ventes, de la production, de la distribution et de l'approvisionnement d'une chaîne d'approvisionnement effectuée conjointement et centralement. Basés sur cette classification, des modèles de programmation en nombres entiers et des modèles de simulation sur un horizon roulant sont développés, représentant, respectivement, les approches de S±&OP traditionnelle et avancée, et également, une planification découplée traditionnelle, dans laquelle la planification des ventes est effectuée centralement et la planification de la production, la distribution et l'approvisionnement est effectuée séparément et localement par les unités d'affaires. La validation des modèles et l'évaluation pré-implantation sont effectuées à l'aide d'un cas industriel réel utilisant les données d'une compagnie de panneaux de lamelles orientées. Les résultats obtenus démontrent que les deux méthodes de S±feOP (traditionnelle et avancée) offrent une performance significativement supérieure à celle de la planification découplée, avec des bénéfices prévus supérieurs de 3,5% et 4,5%, respectivement. Les résultats sont très sensibles aux conditions de marché. Lorsque les prix du marché descendent ou que la demande augmente, de plus grands bénéfices peuvent être réalisés. Dans le cadre de cette recherche, les décisions de vente impliquent des ventes régies par des contrats et le marché. Les décisions de contrat non optimales affectent non seulement les revenus, mais également la performance manufacturière et logistique et les décisions de contrats d'approvisionnement en matière première. Le grand défi est de concevoir et d'offrir les bonnes politiques de contrat aux bons clients de sorte que la satisfaction des clients soit garantie et que l'attribution de la capacité de la compagnie soit optimisée. Également, il faut choisir les bons contrats des bons fournisseurs, de sorte que les approvisionnements en matière première soient garantis et que les objectifs financiers de la compagnie soient atteints. Dans cette thèse, un modèle coordonné d'aide à la décision pour les contrats e développé afin de fournir une aide à l'intégration de la conception de contrats, de l'attribution de capacité et des décisions de contrats d'approvisionnement pour une chaîne logistique multi-site à trois niveaux. En utilisant la programmation stochastique à deux étapes avec recours, les incertitudes liées à l'environnement et au système sont anticipées et des décisions robustes peuvent être obtenues. Les résultats informatiques montrent que l'approche de modélisation proposée fournit des solutions de contrats plus réalistes et plus robustes, avec une performance prévue supérieure d'environ 12% aux solutions fournies par un modèle déterministe

Differentiation vs. standardisation in supply chain segmentation: a quantitative study

The key value proposition of supply chain segmentation is to differentiate supply chains through a reasonable number of segments in order to gain a level of standardisation and avoid managerial complexity incurred in fully customised supplychains. The decision on how products are grouped into segments is at the core of a successful implementation. A fundamental trade-off in this decision-making process is between higher differentiation by having small group sizes and higher standardisation from a smaller number of groups. In this manuscript, we implement segmentation on supply chain configurations and investigate the trade-off by analysing several network scenarios. We use optimisation models for each scenarioto align decisions of segment formation and supply chain configurations. We show that divergences in demand characteristics, geographic difference, and cost synergy such as pooling effect have impacts on the balance of standardisation and differentiation

Stochastic programming for City Logistics: new models and methods

The need for mobility that emerged in the last decades led to an impressive increase in the number of vehicles as well as to a saturation of transportation infrastructures. Consequently, traffic congestion, accidents, transportation delays, and polluting emissions are some of the most recurrent concerns transportation and city managers have to deal with. However, just building new infrastructures might be not sustainable because of their cost, the land usage, which usually lacks in metropolitan regions, and their negative impact on the environment. Therefore, a different way of improving the performance of transportation systems while enhancing travel safety has to be found in order to make people and good transportation operations more efficient and support their key role in the economic development of either a city or a whole country. The concept of City Logistics (CL) is being developed to answer to this need. Indeed, CL focus on reducing the number of vehicles operating in the city, controlling their dimension and characteristics. CL solutions do not only improve the transportation system but the whole logistics system within an urban area, trying to integrate interests of the several. This global view challenges researchers to develop planning models, methods and decision support tools for the optimization of the structures and the activities of the transportation system. In particular, this leads researchers to the definition of strategic and tactical problems belonging to well-known problem classes, including network design problem, vehicle routing problem (VRP), traveling salesman problem (TSP), bin packing problem (BPP), which typically act as sub-problems of the overall CL system optimization. When long planning horizons are involved, these problems become stochastic and, thus, must explicitly take into account the different sources of uncertainty that can affect the transportation system. Due to these reasons and the large-scale of CL systems, the optimization problems arising in the urban context are very challenging. Their solution requires investigations in mathematical and combinatorial optimization methods as well as the implementation of efficient exact and heuristic algorithms. However, contributions answering these challenges are still limited number. This work contributes in filling this gap in the literature in terms of both modeling framework for new planning problems in CL context and developing new and effective heuristic solving methods for the two-stage formulation of these problems. Three stochastic problems are proposed in the context of CL: the stochastic variable cost and size bin packing problem (SVCSBPP), the multi-handler knapsack problem under uncertainty (MHKPu) and the multi-path traveling salesman problem with stochastic travel times (mpTSPs). The SVCSBPP arises in supply-chain management, in which companies outsource the logistics activities to a third-party logistic firm (3PL). The procurement of sufficient capacity, expressed in terms of vehicles, containers or space in a warehouse for varying periods of time to satisfy the demand plays a crucial role. The SVCSBPP focuses on the relation between a company and its logistics capacity provider and the tactical-planning problem of determining the quantity of capacity units to secure for the next period of activity. The SVCSBPP is the first attempt to introduce a stochastic variant of the variable cost and size bin packing problem (VCSBPP) considering not only the uncertainty on the demand to deliver, but also on the renting cost of the different bins and their availability. A large number of real-life situations can be satisfactorily modeled as a MHKPu, in particular in the last mile delivery. Last mile delivery may involve different sequences of consolidation operations, each handled by different workers with different skill levels and reliability. The improper management of consolidation operations can cause delay in the operations reducing the overall profit of the deliveries. Thus, given a set of potential logistics handlers and a set of items to deliver, characterized by volume and random profit, the MHKPu consists in finding a subset of items which maximizes the expected total profit. The profit is given by the sum of a deterministic profit and a stochastic profit oscillation, with unknown probability distribution, due to the random handling costs of the handlers.The mpTSPs arises mainly in City Logistics applications. Cities offer several services, such as garbage collection, periodic delivery of goods in urban grocery distribution and bike sharing services. These services require the planning of fixed and periodic tours that will be used from one to several weeks. However, the enlarged time horizon as well as strong dynamic changes in travel times due to traffic congestion and other nuisances typical of the urban transportation induce the presence of multiple paths with stochastic travel times. Given a graph characterized by a set of nodes connected by arcs, mpTSPs considers that, for every pair of nodes, multiple paths between the two nodes are present. Each path is characterized by a random travel time. Similarly to the standard TSP, the aim of the problem is to define the Hamiltonian cycle minimizing the expected total cost. These planning problems have been formulated as two-stage integer stochastic programs with recourse. Discretization methods are usually applied to approximate the probability distribution of the random parameters. The resulting approximated program becomes a deterministic linear program with integer decision variables of generally very large dimensions, beyond the reach of exact methods. Therefore, heuristics are required. For the MHKPu, we apply the extreme value theory and derive a deterministic approximation, while for the SVCSBPP and the mpTSPs we introduce effective and accurate heuristics based on the progressive hedging (PH) ideas. The PH mitigates the computational difficulty associated with large problem instances by decomposing the stochastic program by scenario. When effective heuristic techniques exist for solving individual scenario, that is the case of the SVCSBPP and the mpTSPs, the PH further reduces the computational effort of solving scenario subproblems by means of a commercial solver. In particular, we propose a series of specific strategies to accelerate the search and efficiently address the symmetry of solutions, including an aggregated consensual solution, heuristic penalty adjustments, and a bundle fixing technique. Yet, although solution methods become more powerful, combinatorial problems in the CL context are very large and difficult to solve. Thus, in order to significantly enhance the computational efficiency, these heuristics implement parallel schemes. With the aim to make a complete analysis of the problems proposed, we perform extensive numerical experiments on a large set of instances of various dimensions, including realistic setting derived by real applications in the urban area, and combinations of different levels of variability and correlations in the stochastic parameters. The campaign includes the assessment of the efficiency of the meta-heuristic, the evaluation of the interest to explicitly consider uncertainty, an analysis of the impact of problem characteristics, the structure of solutions, as well as an evaluation of the robustness of the solutions when used as decision tool. The numerical analysis indicates that the stochastic programs have significant effects in terms of both the economic impact (e.g. cost reduction) and the operations management (e.g. prediction of the capacity needed by the firm). The proposed methodologies outperform the use of commercial solvers, also when small-size instances are considered. In fact, they find good solutions in manageable computing time. This makes these heuristics a strategic tool that can be incorporated in larger decision support systems for CL

How to deal correctly with Lead Time in General Supply Chains

In the new global economy, the inventory control has become a priority for the supply chain management. Safety stock is the sole way to fight against the demand and the supply uncertainty, so determining the amount of it that must be kept along the network to holistically minimize the risk of disruption while maximize the profit is a critical issue. For the supply side, the focus is held in the lead time variability which can significantly vary depending on the part of the supply chain or new inconvenient facts could relevantly affect the lead time. Even so, developed models have forced to assume a certain value or a distribution for the lead time, yet this is risky. Historical data is often unreliable, not available or insufficiently representative. Therefore, a new model based on the Guaranteed Service approach and combined with robust optimization techniques is proposed, working with the lead time volatility without assuming any specific distribution. Interesting features arise from the new model such as the smooth tractability of the problem, the facile computational skills required or the lack of resources needed. This approach has been formulated and tested, as well as the Guaranteed Service when a distribution is assumed for the lead time and the original model. Then, the performance of the three of them has been compared in order to find the correct way to deal with uncertain lead time. Finally, the Robust Guaranteed model benefits promise better security to companies and it also provides a powerful tool to manage the risk from the supply side.Outgoin