A feasibility evaluation approach for time-evolving multi-item production–distribution networks

Time-dependent multi-item problems arise frequently in management applications, communication systems, and production–distribution systems. Our problem belongs to the last category, where we wish to address the feasibility of such systems when all network parameters change over time and product. The objective is to determine whether it is possible to have a dynamic production–shipment circuit within a finite planning horizon. And, if there is no such a flow, the goal is to determine where and when the infeasibility occurs and the approximate magnitude of the infeasibility. This information may help the decision maker in their efforts to resolve the infeasibility of the system. The problem in the discrete-time settings is investigated and a hybrid of scaling approach and penalty function method together with network optimality condition is utilized to develop a network-based algorithm. This algorithm is analysed from theoretical and practical perspectives by means of instances corresponding to some electricity transmission-distribution networks and many random instances. Computational results illustrate the performance of the algorithm.

[1]  S. Singh,et al.  Reconfiguration of Power Distribution Systems Considering Reliability and Power Loss , 2012, IEEE Transactions on Power Delivery.

[2]  T. P. Hughes,et al.  Networks of Power: Electrification in Western Society, 1880-1930 , 1984 .

[3]  Dan Wu,et al.  Lagrangean decomposition using an improved Nelder-Mead approach for Lagrangean multiplier update , 2006, Comput. Chem. Eng..

[4]  Ignacio E. Grossmann,et al.  Time representations and mathematical models for process scheduling problems , 2011, Comput. Chem. Eng..

[5]  Phillipp Kaestner,et al.  Linear And Nonlinear Programming , 2016 .

[6]  I. Grossmann,et al.  Temporal Decomposition Scheme for Nonlinear Multisite Production Planning and Distribution Models , 2003 .

[7]  Hassan Salehi Fathabadi,et al.  MAXIMUM FLOW PROBLEM ON DYNAMIC GENERATIVE NETWORK FLOWS WITH TIME-VARYING BOUNDS , 2010 .

[8]  Ignacio E. Grossmann,et al.  New General Continuous-Time State−Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants , 2003 .

[9]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[10]  Di Yuan,et al.  A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation , 2003, INFORMS J. Comput..

[11]  Jana Vogel,et al.  Electric Distribution Systems , 2016 .

[12]  José M. Pinto,et al.  Lagrangean-based techniques for the supply chain management of flexible process networks , 2008, Comput. Chem. Eng..

[13]  François Maréchal,et al.  Multi-Objective, Multi-Period Optimization of Biomass Conversion Technologies Using Evolutionary Algorithms and Mixed Integer Linear Programming (MILP) , 2013 .

[14]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[15]  Om P. Malik,et al.  Electric Distribution Systems: Sallam/Electric Distribution Systems , 2011 .

[16]  Tonguç Ünlüyurt,et al.  A Decomposition-Based Approach for the Multiperiod Multiproduct Distribution Planning Problem , 2014, J. Appl. Math..

[17]  François Maréchal,et al.  Multi-objectives, multi-period optimization of district energy systems: III. Distribution networks , 2014, Comput. Chem. Eng..

[18]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[19]  M. Goetschalckx,et al.  A primal decomposition method for the integrated design of multi-period production–distribution systems , 1999 .

[20]  S. M. S. Neiro,et al.  Langrangean decomposition applied to multiperiod planning of petroleum refineries under uncertainty , 2006 .

[21]  Said Salhi,et al.  An Efficient Hybrid Genetic Algorithm for the MultiProduct Multi Period Inventory Routing Problem , 2011 .

[22]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[23]  Marina Fruehauf,et al.  Nonlinear Programming Analysis And Methods , 2016 .

[24]  R. Ravi,et al.  Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[25]  Anthony J. Zahorik,et al.  Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems , 1984 .

[26]  Hlynur Stefansson,et al.  Production , Manufacturing and Logistics Discrete and continuous time representations and mathematical models for large production scheduling problems : A case study from the pharmaceutical industry , 2011 .

[27]  Seyed Ahmad Hosseini.  A Model-Based Approach and Analysis for Multi-Period Networks , 2013, J. Optim. Theory Appl..

[28]  Leonard L. Grigsby,et al.  The Electric Power Engineering Handbook , 2000 .

[29]  Harold N. Gabow,et al.  Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[30]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations */I , 1993 .

[31]  James B. Orlin,et al.  Scaling algorithms for multicommodity flow problems and network flow problems with side constraints , 1991 .

[32]  Warren B. Powell,et al.  Multicommodity network flows: The impact of formulation on decomposition , 1993, Math. Program..

[33]  Ignacio E. Grossmann,et al.  Temporal and spatial Lagrangean decompositions in multi-site, multi-period production planning problems with sequence-dependent changeovers , 2011, Comput. Chem. Eng..