Skip to main content
SpringerLink
Log in

A Model-Based Approach and Analysis for Multi-Period Networks

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

The aim of this contribution is to address a general class of network problems, very common in process systems engineering, where spoilage on arcs and storage in nodes are inevitable as time changes. Having a set of capacities, so-called horizon capacity which limits the total flow passing arcs over all periods, the min-cost flow problem in the discrete-time model with time-varying network parameters is investigated. While assuming a possibility of storage or and spoilage, we propose some approaches employing polyhedrals to obtain optimal solutions for a pre-specified planning horizon. Our methods describe some reformulations based on polyhedrals that lead to LP problems comprising a set of sparse subproblems with exceptional structures. Considering the sparsity and repeating structure of the polyhedrals, algorithmic approaches based on decomposition techniques of block-angular and block-staircase cases are proposed to handle the global problem aiming to reduce the computational resources required.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, M., Orlin, J.: Network Flows. Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Aronson, J.E.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1–66 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cal, X., Sha, D., Wong, C.K.: Time-Varying Network Optimization. Springer, Berlin (2007)

    Google Scholar 

  4. Hoppe, B.: Efficient dynamic network flow algorithms. Ph.D. thesis, Cornell University (1995)

  5. Lozovanu, D.: Optimization and Multiobjective Control of Time-Discrete Systems: Dynamic Networks and Multilayered Structures. Springer, Berlin (2010)

    Google Scholar 

  6. Newman, M., Barabási, A., Watts, D.: The Structure and Dynamics of Networks. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  7. Pantelides, C.: Unified frameworks for the optimal process planning and scheduling. In: Proceedings of the Second Conference on the Foundations of Computer Aided Operations, p. 253. Cache, New York (1994)

    Google Scholar 

  8. Stefansson, H., Sigmarsdottir, S., Jensson, P., Shah, N.: Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry. Eur. J. Oper. Res. 215, 383–392 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Song, H.: A Study on the Dynamic Network Flow Problems: With Applications to the Dynamic Resource Management in Logistics Networks. VDM, Saarbrücken (2009)

    Google Scholar 

  10. Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419–433 (1958)

    Article  MathSciNet  Google Scholar 

  11. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  12. Hosseini, S.A.: The minimum cost flow problem in dynamic multi-generative network flows. In: DM 10 Abstracts, the SIAM Conference on Discrete Mathematics. Hyatt Regency, Austin (2010)

    Google Scholar 

  13. Mouret, S., Grossmann, I.E., Pestiaux, P.: Time representations and mathematical models for process scheduling problems. Comput. Chem. Eng. 35, 1038–1063 (2011)

    Article  Google Scholar 

  14. Kondili, E., Pantelides, C., Sargent, W.: A general algorithm for short-term scheduling of batch operations—I. MILP formulation. Comput. Chem. Eng. 2, 211–227 (1993)

    Article  Google Scholar 

  15. Terrazas, S., Trotter, P., Grossmann, I.E.: Temporal and spatial Lagrangian decompositions in multi-site, multi-period production planning problems with sequence-dependent changeovers. Comput. Chem. Eng. 35, 2913–2928 (2011)

    Article  Google Scholar 

  16. Maravelias, C.T., Grossmann, I.E.: New continuous-time state task network formulation for the scheduling of multipurpose batch plants. Ind. Eng. Chem. Res. 42, 3056–3074 (2003)

    Article  Google Scholar 

  17. Moin, N.H., Salhi, S., Aziz, N.A.B.: An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Int. J. Prod. Econ. 133, 334–343 (2011)

    Article  Google Scholar 

  18. Bartle, R.G., Sherbert, D.R.: Introduction to Real Analysis. Wiley, New York (2011)

    Google Scholar 

  19. Johnsonbaugh, R., Pfaffenberger, W.E.: Foundations of Mathematical Analysis. Dover, New York (2010)

    Google Scholar 

  20. Royden, H., Fitzpatrick, P.: Real Analysis. Prentice Hall, New York (2010)

    MATH  Google Scholar 

  21. Bazaraa, M., Jarvis, J., Sherali, H.: Linear Programming and Network Flows. Wiley, New York (2009)

    Book  Google Scholar 

  22. Jackson, P.L., Lynch, D.F.: Revised Dantzig–Wolfe decomposition for staircase-structured linear programs. Math. Program. 39, 157–179 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  23. Tebboth, J.: A computational study of Dantzig–Wolfe decomposition. Ph.D. thesis, University of Buckingham (2001)

  24. Ferris, M.C., Horn, J.D.: Partitioning mathematical programs for parallel solution. Math. Program. 80, 35–61 (1998)

    MathSciNet  MATH  Google Scholar 

  25. Ferris, M.C., Voelker, M.M.: Slice models in general purpose modelling systems: an application to DEA. Optim. Methods Softw. 17, 1009–1032 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  26. Voelker, M.M.: Optimization of slice models. Ph.D. thesis, University of Wisconsin, Madison (2002)

  27. Binks, B.P., Fletcher, P., Holt, B.: Selective retardation of perfume oil evaporation from oil-in-water emulsions stabilized by either surfactant or nanoparticles. Langmuir 26(23), 18024–18030 (2010)

    Article  Google Scholar 

  28. Mokhatab, S., Poe, W.: Handbook of Natural Gas Transmission and Processing. Gulf Pub., Houston (2012)

    Google Scholar 

  29. Dantzig, G., Wolfe, P.: The decomposition algorithm for linear programs. Econometrica 29, 767–778 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  30. Dantzig, G., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101–111 (1960)

    Article  MATH  Google Scholar 

  31. Borndorfe, R., Ferreira, C.E., Martin, A.: Decomposing matrices into blocks. SIAM J. Optim. 9, 236–269 (1998)

    Article  Google Scholar 

  32. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 291–307 (1970)

  33. Weil, R.L., Kettler, P.C.: Rearranging matrices to block-angular form for decomposition (and other) algorithms. Manag. Sci. 18, 98–108 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  34. Hosseini, A.: An introduction to dynamic generative networks: minimum cost flow. Appl. Math. Model. 35, 5017–5025 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  35. Klingman, D., Napie, A., Stutzu, J.: NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problem. Manag. Sci. 20(5), 814–821 (1974)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

The author would like to express his gratitude to Prof. Christodoulos A. Floudas for his constructive suggestions. He would also like to thank two anonymous referees for insightful comments, which have substantially helped improve the quality of the paper.

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Sabanci University, 34956, Istanbul, Turkey

    Seyed Ahmad Hosseini

Authors
  1. Seyed Ahmad Hosseini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyed Ahmad Hosseini.

Additional information

Communicated by Christodoulos A. Floudas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hosseini, S.A. A Model-Based Approach and Analysis for Multi-Period Networks. J Optim Theory Appl 157, 486–512 (2013). https://doi.org/10.1007/s10957-012-0183-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-012-0183-6

Keywords

Search

Navigation