IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v232y2014i3p618-629.html
   My bibliography  Save this article

Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks

Author

Listed:
  • Morabito, Reinaldo
  • de Souza, Mauricio C.
  • Vazquez, Mariana

Abstract

In this study we deal with network routing decisions and approximate performance evaluation approaches for generalized open queuing networks (OQN), in which commodities enter the network, receive service at one or more arcs and then leave the network. Exact performance evaluation has been applied for the analysis of Jackson OQN, where the arrival and service processes of the commodities are assumed to be Poisson. However, the Poisson processes’ hypotheses are not a plausible or acceptable assumption for the analysis of generalized OQN, as their arrival and service processes can be much less variable than Poisson processes, resulting in overestimated system performance measures and inappropriate flow routing solutions. In this paper we merge network routing algorithms and network decomposition methods to solve multicommodity flow problems in generalized OQN. Our focus is on steady-state performance measures as average delays and waiting times in queue. The main contributions are twofold: (i) to highlight that solving the corresponding multicommodity flow problem by representing the generalized OQN as a Jackson OQN may be a poor approximation and may lead to inaccurate estimates of the system performance measures, and (ii) to present a multicommodity flow algorithm based on a routing step and on an approximate decomposition step, which leads to much more accurate solutions. Computational results are presented in order to show the effectiveness of the proposed approach.

Suggested Citation

  • Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    • Handle: RePEc:eee:ejores:v:232:y:2014:i:3:p:618-629
    DOI: 10.1016/j.ejor.2013.08.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713006796
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.08.014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Laoucine Kerbache & Mario Norbis & Jose A. Gonzalez, 2004. "Optimal server assignment for a multiple customer classes problem," Post-Print hal-00465145, HAL.
    2. Ouorou, A. & Mahey, P., 2000. "A minimum mean cycle cancelling method for nonlinear multicommodity flow problems," European Journal of Operational Research, Elsevier, vol. 121(3), pages 532-548, March.
    3. Warsing, Donald P. & Souza, Gilvan C. & Greis, Noel P., 2001. "Determining the value of dedicated multimodal cargo facilities in a multi-region distribution network," European Journal of Operational Research, Elsevier, vol. 133(1), pages 81-93, August.
    4. Laoucine Kerbache & James Macgregor Smith, 2004. "Queuing Networks and the Topological Design of Supply Chain Systems," Post-Print hal-00796346, HAL.
    5. Kerbache, Laoucine & MacGregor Smith, James, 2004. "Queueing networks and the topological design of supply chain systems," International Journal of Production Economics, Elsevier, vol. 91(3), pages 251-272, October.
    6. Stepanov, Alexander & Smith, James MacGregor, 2009. "Multi-objective evacuation routing in transportation networks," European Journal of Operational Research, Elsevier, vol. 198(2), pages 435-446, October.
    7. S. L. Albin, 1982. "On Poisson Approximations for Superposition Arrival Processes in Queues," Management Science, INFORMS, vol. 28(2), pages 126-137, February.
    8. Ward Whitt, 1985. "The Best Order for Queues in Series," Management Science, INFORMS, vol. 31(4), pages 475-487, April.
    9. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    10. Gabriel R. Bitran & Devanath Tirupati, 1988. "Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference," Management Science, INFORMS, vol. 34(1), pages 75-100, January.
    11. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    12. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    13. Bakuli, David L. & MacGregor Smith, J., 1996. "Resource allocation in state-dependent emergency evacuation networks," European Journal of Operational Research, Elsevier, vol. 89(3), pages 543-555, March.
    14. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, August.
    15. Kerbache, Laoucine & Smith, J. MacGregor, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 121(1), pages 105-123, February.
    16. Souza, Gilvan C. & Wagner, Harvey M. & Whybark, D. Clay, 2001. "Evaluating focused factory benefits with queuing theory," European Journal of Operational Research, Elsevier, vol. 128(3), pages 597-610, February.
    17. A. Ouorou & P. Mahey & J.-Ph. Vial, 2000. "A Survey of Algorithms for Convex Multicommodity Flow Problems," Management Science, INFORMS, vol. 46(1), pages 126-147, January.
    18. Laoucine Kerbache & James Macgregor Smith, 2004. "Queueing networks and the topological design of supply chain systems," Post-Print hal-00465149, HAL.
    19. Smith, J. MacGregor & Cruz, F.R.B. & van Woensel, T., 2010. "Topological network design of general, finite, multi-server queueing networks," European Journal of Operational Research, Elsevier, vol. 201(2), pages 427-441, March.
    20. Xiuli Chao & Liming Liu & Shaohui Zheng, 2003. "Resource Allocation in Multisite Service Systems with Intersite Customer Flows," Management Science, INFORMS, vol. 49(12), pages 1739-1752, December.
    21. Lixiang Jiang & Ronald Giachetti, 2008. "A queueing network model to analyze the impact of parallelization of care on patient cycle time," Health Care Management Science, Springer, vol. 11(3), pages 248-261, September.
    22. Kan Wu & Leon McGinnis, 2013. "Interpolation approximations for queues in series," IISE Transactions, Taylor & Francis Journals, vol. 45(3), pages 273-290.
    23. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Brooks, James D. & Kar, Koushik & Mendonça, David J., 2016. "Allocation of flows in closed bipartite queueing networks," European Journal of Operational Research, Elsevier, vol. 255(2), pages 333-344.
    2. Kurz, Julian, 2016. "Capacity planning for a maintenance service provider with advanced information," European Journal of Operational Research, Elsevier, vol. 251(2), pages 466-477.
    3. Wang, X.J. & Choi, S.H., 2015. "Stochastic lot sizing manufacturing under the ETS system for maximisation of shareholder wealth," European Journal of Operational Research, Elsevier, vol. 246(1), pages 66-75.
    4. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hui-Yu Zhang & Qing-Xin Chen & James MacGregor Smith & Ning Mao & Ai-Lin Yu & Zhan-Tao Li, 2017. "Performance analysis of open general queuing networks with blocking and feedback," International Journal of Production Research, Taylor & Francis Journals, vol. 55(19), pages 5760-5781, October.
    2. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    3. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    4. Pourvaziri, Hani & Pierreval, Henri, 2017. "Dynamic facility layout problem based on open queuing network theory," European Journal of Operational Research, Elsevier, vol. 259(2), pages 538-553.
    5. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    6. Wu, Kan & Zhao, Ning, 2015. "Dependence among single stations in series and its applications in productivity improvement," European Journal of Operational Research, Elsevier, vol. 247(1), pages 245-258.
    7. Feng, Cheng-Min & Wu, Pei-Ju, 2009. "A tax savings model for the emerging global manufacturing network," International Journal of Production Economics, Elsevier, vol. 122(2), pages 534-546, December.
    8. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    9. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    10. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    11. Saharidis, Georgios K.D. & Kouikoglou, Vassilis S. & Dallery, Yves, 2009. "Centralized and decentralized control polices for a two-stage stochastic supply chain with subcontracting," International Journal of Production Economics, Elsevier, vol. 117(1), pages 117-126, January.
    12. Kerbache, Laoucine & MacGregor Smith, James, 2004. "Queueing networks and the topological design of supply chain systems," International Journal of Production Economics, Elsevier, vol. 91(3), pages 251-272, October.
    13. Subba Rao, S. & Gunasekaran, A. & Goyal, S. K. & Martikainen, T., 1998. "Waiting line model applications in manufacturing," International Journal of Production Economics, Elsevier, vol. 54(1), pages 1-28, January.
    14. Kurt M. Bretthauer, 2000. "Optimal service and arrival rates in Jackson queueing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 1-17, February.
    15. Rabta, Boualem, 2013. "A hybrid method for performance analysis of G/G/m queueing networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 89(C), pages 38-49.
    16. Yunyue He & Zhong Liu & Jianmai Shi & Yishan Wang & Jiaming Zhang & Jinyuan Liu, 2015. "K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    17. Tsai, Eline R. & Demirtas, Derya & Tintu, Andrei N. & de Jonge, Robert & de Rijke, Yolanda B. & Boucherie, Richard J., 2023. "Design of fork-join networks of First-In-First-Out and infinite-server queues applied to clinical chemistry laboratories," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1101-1117.
    18. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    19. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    20. Pradhan, Salil & Damodaran, Purushothaman & Srihari, Krishnaswami, 2008. "Predicting performance measures for Markovian type of manufacturing systems with product failures," European Journal of Operational Research, Elsevier, vol. 184(2), pages 725-744, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:232:y:2014:i:3:p:618-629. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.