Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 825058, 25 pages
http://dx.doi.org/10.1155/2014/825058
Research Article

A Decomposition-Based Approach for the Multiperiod Multiproduct Distribution Planning Problem

Faculty of Engineering and Natural Sciences, Sabanci University, 34956 Istanbul, Turkey

Received 27 January 2014; Revised 9 July 2014; Accepted 13 July 2014; Published 31 August 2014

Academic Editor: X. Zhang

Copyright © 2014 S. Ahmad Hosseini et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. K. Ahuja, M. Magnanti, and J. Orlin, Network Flows. Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, USA, 1993.
  2. J. E. Aronson, “A survey of dynamic network flows,” Annals of Operations Research, vol. 20, no. 1–4, pp. 1–66, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. X. Cai, D. Sha, and C. K. Wong, Time-Varying Network Optimization, Springer, New York, NY, USA, 2007. View at MathSciNet
  4. B. Hoppe, Efficient dynamic network flow algorithms [Ph.D. thesis], Cornell University, 1995.
  5. K. D. Wayne, Generalized maximum flow algorithms [Ph.D. thesis], Cornell University, 1999.
  6. D. Lozovanu, Optimization and Multiobjective Control of Time-Discrete Systems: Dynamic Networks and Multilayered Structures, Springer, 2010.
  7. S. A. Hosseini, “The minimum cost flow problem in dynamic multi generative network flows,” in Proceedings of the SIAM Conference on Discrete Mathematics, DM 10 Abstracts, Austin, Tex, USA, 2010.
  8. M. Newman, A. Barabasi, and D. Watts, The Structure and Dynamics of Networks, Princeton University Press, 2006. View at MathSciNet
  9. C. Pantelides, “Unified frameworks for the optimal process planning and scheduling,” in Proceedings of the 2nd Conference on the Foundations of Computer Aided Operations, p. 253, Cache, New York, NY, USA, 1994.
  10. M. Groß and M. Skutella, “Maximum multicommodity flows over time without intermediate storage,” in Algorithms—ESA 2012, vol. 7501 of Lecture Notes in Computer Science, pp. 539–550, Springer, 2012. View at Google Scholar
  11. M. Groß and M. Skutella, Generalized Maximum Flows over Time, WAOA, 2011.
  12. H. Stefansson, S. Sigmarsdottir, P. Jensson, and N. Shah, “Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry,” European Journal of Operational Research, vol. 215, no. 2, pp. 383–392, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. J. Ford and D. R. Fulkerson, “Constructing maximal dynamic flows from static flows,” Operations Research, vol. 6, pp. 419–433, 1958. View at Publisher · View at Google Scholar · View at MathSciNet
  14. S. A. Hosseini, “An introduction to dynamic generative networks: minimum cost flow,” Applied Mathematical Modelling, vol. 35, no. 10, pp. 5017–5025, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. S. A. Hosseini and F. D. Saridarq, “Determining the optimal flows in zero-time dynamic networks,” Journal of Mathematical Modelling and Algorithms, vol. 11, no. 2, pp. 105–117, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. S. Mokhatab and W. Poe, Handbook of Natural Gas Transmission and Processing, Gulf Professional Publishing, 2012.
  17. B. P. Binks, P. D. I. Fletcher, B. L. Holt, P. Beaussoubre, and K. Wong, “Selective retardation of perfume oil evaporation from oil-in-water emulsions stabilized by either surfactant or nanoparticles,” Langmuir, vol. 26, no. 23, pp. 18024–18030, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. J. R. Jackson and I. E. Grossmann, “Temporal decomposition scheme for nonlinear multisite production planning and distribution models,” Industrial and Engineering Chemistry Research, vol. 42, no. 13, pp. 3045–3055, 2003. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Terrazas-Moreno, P. A. Trotter, and I. E. Grossmann, “Temporal and spatial Lagrangean decompositions in multi-site, multi-period production planning problems with sequence-dependent changeovers,” Computers & Chemical Engineering, vol. 35, no. 12, pp. 2913–2928, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. N. H. Moin, S. Salhi, and N. A. B. Aziz, “An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem,” International Journal of Production Economics, vol. 133, no. 1, pp. 334–343, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. E. Kondili, C. C. Pantelides, and R. W. H. Sargent, “A general algorithm for short-term scheduling of batch operations-I. MILP formulation,” Computers and Chemical Engineering, vol. 17, no. 2, pp. 211–227, 1993. View at Publisher · View at Google Scholar · View at Scopus
  22. S. Mouret, I. E. Grossmann, and P. Pestiaux, “Time representations and mathematical models for process scheduling problems,” Computers and Chemical Engineering, vol. 35, no. 6, pp. 1038–1063, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. C. T. Maravelias and I. E. Grossmann, “New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants,” Industrial and Engineering Chemistry Research, vol. 42, no. 13, pp. 3056–3074, 2003. View at Publisher · View at Google Scholar · View at Scopus
  24. P. Chen and J. M. Pinto, “Lagrangean-based techniques for the supply chain management of flexible process networks,” Computers and Chemical Engineering, vol. 32, no. 11, pp. 2505–2528, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. S. M. S. Neiro and J. M. Pinto, “Lagrangean decomposition applied to multiperiod planning of petroleum refineries under uncertainty,” Latin American Applied Research, vol. 36, no. 4, pp. 213–220, 2006. View at Google Scholar · View at Scopus
  26. R. G. Bartle and D. R. Sherbert, Introduction to Real Analysis, John Wiley & Sons, 2011.
  27. R. Johnsonbaugh and W. E. Pfaffenberger, Foundations of Mathematical Analysis, Dover, 2010.
  28. H. Royden and P. Fitzpatrick, Real Analysis, Prentice Hall, 2010.
  29. J. A. J. Hall and K. I. M. McKinnon, “Hyper-sparsity in the revised simplex method and how to exploit it,” Computational Optimization and Applications, vol. 32, no. 3, pp. 259–283, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. M. C. Ferris and J. D. Horn, “Partitioning mathematical programs for parallel solution,” Mathematical Programming, vol. 80, no. 1, Ser. A, pp. 35–61, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  31. M. C. Ferris and M. M. Voelker, “Slice models in general purpose modeling systems: an application to DEA,” Optimization Methods & Software, vol. 17, no. 6, pp. 1009–1032, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. M. M. Voelker, Optimization of slice models [Ph.D. thesis], University of Wisconsin, Madison, Wis, USA, 2002.
  33. D. P. Rutenberg, “Generalized networks, generalized upper bounding and decomposition of the convex simplex method,” Management Science, vol. 16, no. 5, pp. 388–401, 1970. View at Publisher · View at Google Scholar
  34. J. K. Hartman and L. S. Lasdon, “A generalized upper bounding algorithm for multicommodity network flow problems,” Networks, vol. 1, no. 4, pp. 333–354, 1971. View at Google Scholar · View at MathSciNet
  35. G. B. Dantzig and P. Wolfe, “The decomposition algorithm for linear programs,” Econometrica, vol. 29, no. 4, pp. 767–778, 1961. View at Publisher · View at Google Scholar · View at MathSciNet
  36. G. Dantzig and P. Wolfe, “Decomposition principle for linear programs,” Operations Research, vol. 8, pp. 101–111, 1960. View at Google Scholar
  37. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Belmont, Mass, USA, 1997.
  38. M. Bazaraa, J. Jarvis, and H. Sherali, Linear Programming and Network Flows, John Wiley & Sons, 2009.
  39. P. L. Jackson and D. F. Lynch, “Revised Dantzig-Wolfe decomposition for staircase-structured linear programs,” Mathematical Programming, vol. 39, no. 2, pp. 157–179, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  40. R. Borndörfer, C. E. Ferreira, and A. Martin, “Decomposing matrices into blocks,” SIAM Journal on Optimization, vol. 9, no. 1, pp. 236–269, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” The Bell System Technical Journal, vol. 49, no. 2, pp. 291–307, 1970. View at Google Scholar
  42. R. L. Weil and P. C. Kettler, “Rearranging matrices to block-angular form for decomposition (and other) algorithms,” Management Science, vol. 18, pp. 98–108, 1971. View at Google Scholar
  43. S. A. Hosseini, “A model-based approach and analysis for multi-period networks,” Journal of Optimization Theory and Applications, vol. 157, no. 2, pp. 486–512, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  44. K. L. Jones, I. J. Lustig, J. M. Farvolden, and W. B. Powell, “Multicommodity network flows: the impact of formulation on decomposition,” Mathematical Programming, vol. 62, no. 1, pp. 95–117, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus