Outbound supply chain network design with mode selection,lead times and capacitated vehicle distribution centers

Most distribution network design models considered to date have focused on minimizing fixed costs of facility location and transportation costs. Measures of customer satisfaction driven by the operational dynamics such as lead times have seldom been considered. We consider the design of an outbound supply chain network considering lead times, location of distribution facilities and choice of transportation mode. We present a Lagrangian heuristic that gives excellent solution quality in reasonable computational time. Scenario analyses are conducted on industrial data using this algorithm to observe how the supply chain behaves under different parameter values.     

Integrated location and two-echelon inventory network design under uncertainty

In this paper, we propose a two-stage stochastic model to address the design of an integrated location and two-echelon inventory network under uncertainty. The central issue in this problem is to design and operate an effective and efficient multi-echelon supply chain distribution network and to minimize the expected system-wide cost of warehouse location, the allocation of warehouses to retailers, transportation, and two-echelon inventory over an infinite planning horizon. We structure this problem as a two-stage nonlinear discrete optimization problem. The first stage decides the warehouses to open and the second decides the warehouse-retailer assignments and two-echelon inventory replenishment strategies. Our modeling strategy incorporates various probable scenarios in the integrated multi-echelon supply chain distribution network design to identify solutions that minimize the first stage costs plus the expected second stage costs. The two-echelon inventory cost considerations result in a nonlinear objective which we linearize with an exponential number of variables. We solve the problem using column generation. Our computational study indicates that our approach can solve practical problems of moderate-size with up to twenty warehouse candidate locations, eighty retailers, and ten scenarios efficiently.     

基于最大最小蚂蚁系统的物流配送中心选址算法的研究

提出了一种基于信息素自适应调节的最大最小蚂蚁系统的多物流配送中心选址算法,利用改进的蚁群算法的路径寻优机制结合蚂蚁聚集尸体的行为模式,根据物流配送总成本最低的原则将各配送点与候选配送中心进行聚类,合理选择配送中心。将已有物流配送模型进行拓展,加入经营管理成本。分别利用基本蚁群聚类算法和改进的蚁群聚类算法对配送中心选址进行仿真,实验结果表明在解决大规模配送中心选址问题时,改进的算法在解的质量和收敛速度方面明显优于基本蚁群聚类算法。     

A survey of literature on automated storage and retrieval systems

Automated Storage and Retrieval Systems (AS/RSs) are warehousing systems that are used for the storage and retrieval of products in both distribution and production environments. This paper provides an overview of literature from the past 30 years. A comprehensive explanation of the current state of the art in AS/RS design is provided for a range of issues such as system configuration, travel time estimation, storage assignment, dwell-point location, and request sequencing. The majority of the reviewed models and solution methods are applicable to static scheduling and design problems only. Requirements for AS/RSs are, however, increasingly of a more dynamic nature for which new models will need to be developed to overcome large computation times and finite planning horizons, and to improve system performance. Several other avenues for future research in the design and control of AS/RSs are also specified.     

On the lexicographic minimax approach to location problems

When locating public facilities, the distribution of travel distances among the service recipients is an important issue. It is usually tackled with the minimax (center) solution concept. The minimax solution concept, despite the most commonly used in the public sector location models, is criticized as it does not comply with the major principles of the efficiency and equity modeling. In this paper we develop a concept of the lexicographic minimax solution (lexicographic center) being a refinement of the standard minimax approach to location problems. We show that the lexicographic minimax approach complies with both the Pareto-optimality (efficiency) principle (crucial in multiple criteria optimization) and the principle of transfers (essential for equity measures) whereas the standard minimax approach may violate both these principles. Computational algorithms are developed for the lexicographic minimax solution of discrete location problems.     

Joint modelling of location and scale parameters of the skew-normal distribution

Joint location and scale models of the skew-normal distribution provide useful ex- tension for joint mean and variance models of the normal distribution when the data set under consideration involves asymmetric outcomes. This paper focuses on the maximum likelihood estimation of joint location and scale models of the skew-normal distribution. The proposed procedure can simultaneously estimate parameters in the location model and the scale model. Simulation studies and a real example are used to illustrate the proposed methodologies.     

Determining the optimal number of depots in a physical distribution system according to market characteristics

This paper is an extension of an earlier paper to investigate the interactive effects of location, price and demand using mathematical models of distribution systems.The paper considers the additive nature of solutions to depot location problems and shows how this property can be used to advantage in determining the optimal number of depots in a distribution system. The importance of using marginal profit and marginal return on investment in this context is demonstrated.The sensitivity of the results to changes in cost parameters is also discussed.     

Designing a two-echelon distribution network under demand uncertainty

This paper proposes a comprehensive methodology for the stochastic multi-period two-echelon distribution network design problem (2E-DDP) where product flows to ship-to-points are directed from an upper layer of primary warehouses to distribution platforms (DPs) before being transported to the ship-to-points. A temporal hierarchy characterizes the design level dealing with DP location and capacity decisions, as well as the operational level involving transportation decisions as origin-destination flows. These design decisions must be calibrated to minimize the expected distribution cost associated with the two-echelon transportation schema on this network under stochastic demand. We consider a multi-period planning horizon where demand varies dynamically from one planning period to the next. Thus, the design of the two-echelon distribution network under uncertain customer demand gives rise to a complex multi-stage decisional problem. Given the strategic structure of the problem, we introduce alternative modeling approaches based on two-stage stochastic programming with recourse. We solve the resulting models using a Benders decomposition approach. The size of the scenario set is tuned using the sample average approximation (SAA) approach. Then, a scenario-based evaluation procedure is introduced to post-evaluate the design solutions obtained. We conduct extensive computational experiments based on several types of instances to validate the proposed models and assess the efficiency of the solution approaches. The evaluation of the quality of the stochastic solution underlines the impact of uncertainty in the two-echelon distribution network design problem (2E-DDP).     

Fuzzy chance-constrained programming model for a multi-echelon reverse logistics network for household appliances

Efficient planning and design of an appropriate reverse logistics network is crucial to the economical collection and disposal of scrapped household appliances and electrical products. Such systems are commonly modelled as mixed-integer programs, whose solutions will determine the location of individual facilities that optimize material flow. One of the major drawbacks of current models is that they do not adequately address the important issue of uncertainty in demand and supply. Another deficiency in current models is that they are restricted to a two-echelon system. This study addresses these deficiencies by embodying such uncertainties in the model using the technique of fuzzy-chance constrained programming, and by extending the model to a three-echelon system. A heuristic in the form of a hybrid genetic algorithm is then employed to generate low-cost solutions. The overall objective is to find economical solutions to the general problem of determining the volume of appliances to be moved between the three echelons of customer base to collection sites, collection sites to disposal centres and disposal centre to landfill centre/remanufacturing centre; and to the problems of positioning the disposal centres and the landfill centre/remanufacturing centres within the problem domain. A case example in China is presented and the quality and robustness of the solutions are explored through sensitivity analysis.     

Capacitated Warehouse Location with Concave Costs

The mixed integer-linear models that have been used in most analyses of warehouse location problems fail to capture the potential operating efficiencies associated with large scale facilities. This paper presents an algorithm for finding a minimal cost warehouse system design wherein individual warehouses have limited capacities and exhibit economies of scale. The iterative procedure defines and solves a series of conventional transportation problems in order to converge on the optimal system design. The algorithm is well suited to solving large problems of the type commonly encountered in practice.     

Optimal model for warehouse location and retailer allocation

Warehouse location and retailer allocation is a high‐level strategic decision problem that is commonly encountered by logisticians and supply chain managers, especially during the supply chain design phase. Considering the product distribution cost and warehouse capital cost trade‐offs, this paper models the warehouse location and retailer allocation problem as a 0–1 integer programming problem and provides an efficient two‐stage set covering heuristic algorithm to solve large‐sized problems. Finally, concluding remarks and some recommendations for further research are also presented. Copyright © 2007 John Wiley & Sons, Ltd.     

Decision support system for planning telecommunication networks: a case study applied to the Andalusian region

Network planning is essential to design real broadband integrated services digital networks (B-ISDN). This paper presents an operations research application to the design of an optic fibre network for the Andalusian region. The economical appraisal is the main consideration in order to take the appropriate decisions: hub location, region sizes and selection of the urban nodes that will receive telecommunication contents. A decision support system with a graphic interface that allows interactive analysis of different scenarios is presented. The system contains a set of mathematical programming models and it has the capability to dynamically construct and solve instances of those models. In addition, it provides data preparation and reports. The system is an integrated, user-friendly and powerful tool to make planning studies by firms developing cable network systems in the telecommunications market.     

Facility location and supply chain management – A review

Facility location decisions play a critical role in the strategic design of supply chain networks. In this paper, a literature review of facility location models in the context of supply chain management is given. We identify basic features that such models must capture to support decision-making involved in strategic supply chain planning. In particular, the integration of location decisions with other decisions relevant to the design of a supply chain network is discussed. Furthermore, aspects related to the structure of the supply chain network, including those specific to reverse logistics, are also addressed. Significant contributions to the current state-of-the-art are surveyed taking into account numerous factors. Supply chain performance measures and optimization techniques are also reviewed. Applications of facility location models to supply chain network design ranging across various industries are presented. Finally, a list of issues requiring further research are highlighted.     

Designing two-echelon supply networks

A modern distribution network design model needs to deal with the trade-offs between a variety of factors, including (1) location and associated (fixed) operating cost of distribution centers (DCs), (2) total transportation costs, and (3) storage holding and replenishment costs at DCs and retail outlets. In addition, network design models should account for factors such as (4) stockouts, by setting appropriate levels of safety stocks, or (5) capacity concerns, which may affect operating costs in the form of congestion costs. The difficulty of making such trade-offs is compounded by the fact that even finding the optimal two-echelon inventory policy in a fixed and uncapacitated distribution network is already a hard problem. In this paper, we propose a generic modeling framework to address these issues that continues and extends a recent stream of research aimed at integrating insights from modern inventory theory into the supply chain network design domain. Our approach is flexible and general enough to incorporate a variety of important side constraints into the problem.     

Design models for unit load storage and retrieval systems using autonomous vehicle technology and resource conserving storage and dwell point policies

Computationally efficient design conceptualization models are proposed for automated unit load storage and retrieval systems based on autonomous vehicle technology. Vehicle and lift travel times and the probability distribution for 12 service scenarios occurring under realistic operating assumptions are formulated and used to generate expected transaction service times. Additional measures of system performance including transaction waiting time and vehicle utilization are formulated for systems using random storage and point-of-service-completion dwell point rules. The models provide a practical means of predicting key aspects of system performance based on five design variables that drive the majority of system costs. They are illustrated in the context of a conceptualization study adapted from an actual system installation.     

Survey of research in the design and control of automated guided vehicle systems

Automated guided vehicles (AGVs) are used for the internal and external transport of materials. Traditionally, AGVs were mostly used at manufacturing systems. Currently, AGVs are also used for repeating transportation tasks in other areas, such as warehouses, container terminals and external (underground) transportation systems. This paper discusses literature related to design and control issues of AGV systems at manufacturing, distribution, transshipment and transportation systems. It is concluded that most models can be applied for design problems at manufacturing centres. Some of these models and new models already proved to be successful in large AGV systems. In fact, new analytical and simulation models need to be developed for large AGV systems to overcome large computation times, NP-completeness, congestion, deadlocks and delays in the system and finite planning horizons. We specify more specific research perspectives in the design and control of AGV systems in distribution, transshipment and transportation systems.     

Bayesian Prediction via Partitioning

This article proposes a new Bayesian approach to prediction on continuous covariates. The Bayesian partition model constructs arbitrarily complex regression and classification surfaces by splitting the covariate space into an unknown number of disjoint regions. Within each region the data are assumed to be exchangeable and come from some simple distribution. Using conjugate priors, the marginal likelihoods of the models can be obtained analytically for any proposed partitioning of the space where the number and location of the regions is assumed unknown a priori. Markov chain Monte Carlo simulation techniques are used to obtain predictive distributions at the design points by averaging across posterior samples of partitions.     

Integer linear programming models for grid-based light post location problem

Selecting optimal location is a key decision problem in business and engineering. This research focuses to develop mathematical models for a special type of location problems called grid-based location problems. It uses a real-world problem of placing lights in a park to minimize the amount of darkness and excess supply. The non-linear nature of the supply function (arising from the light physics) and heterogeneous demand distribution make this decision problem truly intractable to solve. We develop ILP models that are designed to provide the optimal solution for the light post problem: the total number of light posts, the location of each light post, and their capacities (i.e., brightness). Finally, the ILP models are implemented within a standard modeling language and solved with the CPLEX solver. Results show that the ILP models are quite efficient in solving moderately sized problems with a very small optimality gap.     

Multi-criteria robust design of a JIT-based cross-docking distribution center for an auto parts supply chain

We present a solution framework based on discrete-event simulation and enhanced robust design technique to address a multi-response optimization problem inherent in logistics management. The objective is to design a robust configuration for a cross-docking distribution center so that the system is insensitive to the disturbances of supply uncertainty, and provides steady parts supply to downstream assembly plants. In the proposed approach, we first construct a simulation model using factorial design and central composite design (CCD), and then identify the models that best describe the relationship between the simulation responses and system factors. We employ the response surface methodology (RSM) to identify factor levels that would maximize system potential.     

The plant location and flexible technology acquisition problem

In many industries, production–distribution networks have become more complex due to globalization. In particular, increasing interdependencies among structural decisions call for the development of integrated models. In this paper, we present a mathematical model for simultaneous optimization of the plant location, capacity acquisition and technology selection decisions in a multi-commodity environment. The proposed model represents the possible scale and scope economies associated with manufacturing technology alternatives. The problem is formulated as a mixed integer nonlinear program with concave costs. We developed an exact and three heuristic solution procedures. Using these procedures, we are able to solve fairly large facility design problems with reasonable computational effort.