IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i4d10.1057_palgrave.jors.2602360.html
   My bibliography  Save this article

A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies

Author

Listed:
  • Y Shim

    (University of Maryland, College Park)

  • S A Gabriel

    (University of Maryland, College Park)

  • A Desai

    (University of Maryland, College Park)

  • P Sahakij

    (University of Maryland, College Park)

  • S Milner

    (University of Maryland, College Park)

Abstract

We describe the development of fast heuristics and methodologies for congestion minimization problems in directional wireless networks, and we compare their performance with optimal solutions. The focus is on the network layer topology control problem (NLTCP) defined by selecting an optimal ring topology as well as the flows on it. Solutions to NLTCP need to be computed in near realtime due to changing weather and other transient conditions and which generally preclude traditional optimization strategies. Using a mixed-integer linear programming formulation, we present both new constraints for this problem and fast heuristics to solve it. The new constraints are used to increase the lower bound from the linear programming relaxation and hence speed up the solution of the optimization problem by branch and bound. The upper and lower bounds for the optimal objective function to the mixed integer problem then serve to evaluate new node-swapping heuristics which we also present. Through a series of tests on different sized networks with different traffic demands, we show that our new heuristics achieve within about 0.5% of the optimal value within seconds.

Suggested Citation

  • Y Shim & S A Gabriel & A Desai & P Sahakij & S Milner, 2008. "A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 521-539, April.
  • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:4:d:10.1057_palgrave.jors.2602360
    DOI: 10.1057/palgrave.jors.2602360
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602360
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2602360?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. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    2. Stan Van Hoesel, 2005. "Optimization in telecommunication networks," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 59(2), pages 180-205, May.
    3. Young-Soo Myung & Hu-Gon Kim & Dong-Wan Tcha, 1997. "Optimal Load Balancing on Sonet Bidirectional Rings," Operations Research, INFORMS, vol. 45(1), pages 148-152, February.
    Full references (including those not matched with items on IDEAS)

    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. Roy, Bernard, 2010. "Robustness in operational research and decision aiding: A multi-faceted issue," European Journal of Operational Research, Elsevier, vol. 200(3), pages 629-638, February.
    2. Man Xiao & Weidong Li & Xiaofei Liu, 2023. "Online Mixed Ring Covering Problem with Two Nodes," SN Operations Research Forum, Springer, vol. 4(1), pages 1-20, March.
    3. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    4. H. Neil Geismar & Yiwei Huang & Suresh D. Pillai & Chelliah Sriskandarajah & Seokjun Youn, 2020. "Location‐Routing with Conflicting Objectives: Coordinating eBeam Phytosanitary Treatment and Distribution of Mexican Import Commodities," Production and Operations Management, Production and Operations Management Society, vol. 29(6), pages 1506-1531, June.
    5. Kalaı¨, Rim & Lamboray, Claude & Vanderpooten, Daniel, 2012. "Lexicographic α-robustness: An alternative to min–max criteria," European Journal of Operational Research, Elsevier, vol. 220(3), pages 722-728.
    6. Qingqin Nong & Jinjiang Yuan & Yixun Lin, 2009. "The weighted link ring loading problem," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 38-50, July.
    7. De Rosa, Vincenzo & Gebhard, Marina & Hartmann, Evi & Wollenweber, Jens, 2013. "Robust sustainable bi-directional logistics network design under uncertainty," International Journal of Production Economics, Elsevier, vol. 145(1), pages 184-198.
    8. Hanif D. Sherali & J. Cole Smith & Youngho Lee, 2000. "Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 284-298, November.
    9. Häntsch, Marius & Huchzermeier, Arnd, 2016. "Transparency of risk for global and complex network decisions in the automotive industry," International Journal of Production Economics, Elsevier, vol. 175(C), pages 81-95.
    10. Zanyang Cui & Zhimei Wang & Junhua Chen & Xingchen Zhang & Chunxiao Zhao, 2023. "Integrated Planning for Depot Location and Line Planning Problems in the Intercity Railway Network with Passenger Demand Uncertainty," Sustainability, MDPI, vol. 15(20), pages 1-22, October.
    11. Jabbarzadeh, Armin & Fahimnia, Behnam & Sheu, Jiuh-Biing, 2017. "An enhanced robustness approach for managing supply and demand uncertainties," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 620-631.
    12. Ángel Marín & Patricia Jaramillo, 2009. "Urban rapid transit network design: accelerated Benders decomposition," Annals of Operations Research, Springer, vol. 169(1), pages 35-53, July.
    13. Michel Minoux, 2011. "On 2-stage robust LP with RHS uncertainty: complexity results and applications," Journal of Global Optimization, Springer, vol. 49(3), pages 521-537, March.
    14. Meunier, Frédéric & Pradeau, Thomas, 2014. "The uniqueness property for networks with several origin–destination pairs," European Journal of Operational Research, Elsevier, vol. 237(1), pages 245-256.
    15. 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.
    16. Fahimnia, Behnam & Jabbarzadeh, Armin & Sarkis, Joseph, 2018. "Greening versus resilience: A supply chain design perspective," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 129-148.
    17. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    18. Cole Smith, J., 2004. "Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network," European Journal of Operational Research, Elsevier, vol. 154(3), pages 659-672, May.
    19. Peng, Peng & Snyder, Lawrence V. & Lim, Andrew & Liu, Zuli, 2011. "Reliable logistics networks design with facility disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1190-1211, September.
    20. Ouhimmou, Mustapha & Nourelfath, Mustapha & Bouchard, Mathieu & Bricha, Naji, 2019. "Design of robust distribution network under demand uncertainty: A case study in the pulp and paper," International Journal of Production Economics, Elsevier, vol. 218(C), pages 96-105.

    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:pal:jorsoc:v:59:y:2008:i:4:d:10.1057_palgrave.jors.2602360. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.