scholarly journals Case Article—Integrating Network Design Models for a Global Supply Network

2020 ◽  
Author(s):  
Yong Wu
Keyword(s):  
Network Design ◽  
Operations Research ◽  
Optimization Problems ◽  
Integrated Approach ◽  
Complex Problem ◽  
Network Design Problem ◽  
Supply Network ◽  
Assignment Problems ◽  
Design Models ◽  
Holistic Understanding

In typical operations research courses, optimization problems, such as transportation and assignment problems, are frequently discussed and taught as stand-alone problems. An integrated approach may prove to be necessary in order to enable students to have a holistic understanding of a complex problem (e.g., a project). In this paper, a global supply network design problem is presented where the case company can source from multiple “suppliers” using multiple modes of transport (including the use of containers with different capacities), allowing lateral supply between warehouses, etc. As more factors are considered, the problem becomes much more complex than any isolated problem in a typical course. The case was tested in an undergraduate course in Australia, and students found this case challenging but at the same time rewarding once solved.

A multi-stage stochastic supply network design problem with financial decisions and risk management

Omega ◽  
2012 ◽  
Vol 40 (5) ◽  
pp. 511-524 ◽  
Author(s):  
Stefan Nickel ◽  
Francisco Saldanha-da-Gama ◽  
Hans-Peter Ziegler
Keyword(s):  
Risk Management ◽  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Supply Network ◽  
Financial Decisions ◽  
Multi Stage

Supply Chain Network Design in Uncertain Environment

2018 ◽  
pp. 262-282
Author(s):  
Gholam Reza Nasiri ◽  
Fariborz Jolai
Keyword(s):  
Supply Chain ◽  
Network Design ◽  
Business Processes ◽  
Dynamic Environment ◽  
Integrated Approach ◽  
Network Design Problem ◽  
Uncertainty Sources ◽  
Efficient Management ◽  
Stochastic Parameters ◽  
Adjustment Mechanisms

Dynamic environment imposes such conditions that make it necessary for companies to consider sources of uncertainty in designing core business processes and optimizing supply chain operations. Efficient management of a supply system requires an integrated approach towards various operational functions and related source of uncertainties. Uncertain conditions in supply network design problem such as market demands, delivery time, and facility capacity are considered and incorporated by many studies at the mathematical programming formulations as well. In this chapter, extensive review of existing SCND literature, brief overview and classification on uncertainty sources, useful strategies to deal uncertainties, model formulation with uncertain/stochastic parameters, efficient developed solution methodologies, and improvement adjustment mechanisms are discussed. Lastly, some directions for further research in this area are suggested.

scholarly journals A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function

2020 ◽  
Vol 10 (16) ◽  
pp. 5698
Author(s):  
Marilisa Botte ◽  
Mariano Gallo ◽  
Mario Marinelli ◽  
Luca D’Acierno
Keyword(s):  
Network Design ◽  
Traffic Assignment ◽  
Convergence Speed ◽  
Network Design Problem ◽  
Traffic Flows ◽  
Assignment Problems ◽  
Design Problems ◽  
Method Of Successive Averages ◽  
Parameter Values ◽  
Real Scale

In this paper, we propose a generalisation of the Method of Successive Averages (MSA) for solving traffic assignment problems. The generalisation consists in proposing a different step sequence within the general MSA framework to reduce computing times. The proposed step sequence is based on the modification of the classic 1/k sequence for improving the convergence speed of the algorithm. The reduction in computing times is useful if the assignment problems are subroutines of algorithms for solving Network Design Problems—such algorithms require estimation of the equilibrium traffic flows at each iteration, hence, many thousands of times for real-scale cases. The proposed algorithm is tested with different parameter values and compared with the classic MSA algorithm on a small and on two real-scale networks. A test inside a Network Design Problem is also reported. Numerical results show that the proposed algorithm outperforms the classic MSA with reductions in computing times, reaching up to 79%. Finally, the theoretical properties are studied for stating the convergence of the proposed algorithm.

A Hybrid Lagrangian Relaxation and Tabu Search Method for Interdependent-Choice Network Design Problems

2011 ◽  
pp. 294-324 ◽  
Author(s):  
Chi Xie ◽  
Mark A. Turnquist ◽  
S. Travis Waller
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Lagrangian Relaxation ◽  
Optimization Problems ◽  
Search Method ◽  
Network Design Problem ◽  
Design Problems ◽  
Network Design Problems ◽  
Tabu Search Method ◽  
Algorithmic Logic

Hybridization offers a promising approach in designing and developing improved metaheuristic methods for a variety of complex combinatorial optimization problems. This chapter presents a hybrid Lagrangian relaxation and tabu search method for a class of discrete network design problems with complex interdependent-choice constraints. This method takes advantage of Lagrangian relaxation for problem decomposition and complexity reduction while its algorithmic logic is designed based on the principles of tabu search. The algorithmic advance and solution performance of the method are illustrated by implementing it for solving a network design problem with lane reversal and crossing elimination strategies, arising from urban evacuation planning.

scholarly journals New models of the generalized fixed-charge network design problem

2012 ◽  
Vol 28 (1) ◽  
pp. 143-150
Author(s):  
PETRICA C. POP ◽  
◽  
CORINA POP SITAR ◽  
Keyword(s):  
Network Design ◽  
Optimization Problems ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Computational Results ◽  
Combinatorial Optimization Problems ◽  
Backbone Network ◽  
New Models ◽  
The Given

We consider in this paper the generalized fixed-charge network design (GFCND) problem in which we are interested to find the cheapest backbone network connecting exactly one hub from each of the given clusters. The GFCND problem belongs to the class of generalized combinatorial optimization problems. We describe two mixed integer programming formulations of the GFCND problem. Based on one of the new proposed formulations, we solve the GFCND problem to optimality using CPLEX for problems with up to 30 clusters and 200 nodes. Computational results are reported and compared with those from the literature.

High Speed Information Network Planning using Stochastic Optimization Method

2013 ◽  
Author(s):  
Ki-Sang Song ◽  
Arun K. Somani
Keyword(s):  
Stochastic Optimization ◽  
Network Design ◽  
Multimedia Information ◽  
High Speed ◽  
Minimum Cost ◽  
Optimization Method ◽  
Multimedia Communication ◽  
Network Design Problem ◽  
Information Network ◽  
Traffic Characteristics

From the 1994 CAIS Conference: The Information Industry in Transition McGill University, Montreal, Quebec. May 25 - 27, 1994.Broadband integrated services digital network (B-ISDN) based on the asynchronous transmission mode (ATM) is becoming reality to provide high speed, multi bit rate multimedia communications. Multimedia communication network has to support voice, video and data traffics that have different traffic characteristics, delay sensitive or loss sensitive features have to be accounted for designing high speed multimedia information networks. In this paper, we formulate the network design problem by considering the multimedia communication requirements. A high speed multimedia information network design alogrithm is developed using a stochastic optimization method to find good solutions which meet the Quality of Service (QoS) requirement of each traffic class with minimum cost.

Sign in / Sign up

Export Citation Format

Share Document