On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model
Summary: The multiproduct two-layer supply chain is very common in various industries. In this paper, we introduce a possible modeling and algorithms to solve a multiproduct two-layer supply chain network design problem. The decisions involved are the DCs location and capacity design decision and the initial distribution planning decision. First we describe the problem and give a mixed integer programming (MIP) model; such problem is NP-hard and it is not easy to reduce the complexity. Inspired by it, we develop a transformation mechanism of relaxing the fixed cost and adding some virtual nodes and arcs to the original network. Thus, a network flow problem (NFP) corresponding to the original problem has been formulated. Given that we could solve the NFP as a minimal cost flow problem. The solution procedures and network simplex algorithm (INS) are discussed. To verify the effectiveness and efficiency of the model and algorithms, the performance measure experimental has been conducted. The experiments and result showed that comparing with MIP model solved by genetic algorithm (GA) and Benders, decomposition algorithm (BD) the NFP model and INS are also effective and even more efficient for both small-scale and large-scale problems.
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
- A computational study for common network design in multi-commodity supply chains
- Designing two-echelon supply networks
- Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs
- Multiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulation
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- A combinatorial arc tolerance analysis for network flow problems
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- A model and methodologies for the location problem with logistical components
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
- A simulated annealing methodology to distribution network design and management
- Competition and integration in closed-loop supply chain network with variational inequality
- Designing a supply chain network under the risk of disruptions
- Efficient computation of time-based customer service levels in a multi-item, multi-echelon supply chain: a practical approach for inventory optimization
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost flows by double scaling
- Multi-product supply chain horizontal network integration: models, theory, and computational results
- Multicommodity Distribution System Design by Benders Decomposition
- Network flows. Theory, algorithms, and applications.
- Optimal inventory location and control in production and distribution networks
- Planning and coordination of production and distribution facilities for multiple commodities
- Supply chain network operations management of a blood banking system with cost and risk minimization
This page was built for publication: On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718489)
