IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v54y2006i4p611-626.html
   My bibliography  Save this article

The Network Packing Problem in Terrestrial Broadcasting

Author

Listed:
  • Carlo Mannino

    (Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza,” via Buonarroti 12, 00185, Roma, Italy)

  • Fabrizio Rossi

    (Dipartimento di Informatica, Università di L'Aquila, via Vetoio, 67010, Coppito (AQ), Italy)

  • Stefano Smriglio

    (Dipartimento di Informatica, Università di L'Aquila, via Vetoio, 67010, Coppito (AQ), Italy)

Abstract

The introduction of digital terrestrial broadcasting all over Europe requires a complete and challenging replanning of in-place analog systems. However, an abrupt migration of resources (transmitters and frequencies) from analog to digital networks cannot be accomplished because the analog services must be preserved temporarily. Hence, a multiobjective problem arises, in which several networks sharing a common set of resources have to be designed. This problem is referred to as the network packing problem. In Italy, this problem is particularly challenging because of a large number of transmitters, orographical features, and strict requirements imposed by Italian law. In this paper, we report our experience in developing solution methods at the major Italian broadcaster Radiotelevisione Italiana (RAI S.p.A.). We propose a two-stage heuristic. In the first stage, emission powers are assigned to each network separately. In the second stage, frequencies are assigned to all networks so as to minimize the loss from mutual interference. A software tool incorporating our methodology is currently in use at RAI to help discover and select high-quality alternatives for the deployment of digital equipment.

Suggested Citation

  • Carlo Mannino & Fabrizio Rossi & Stefano Smriglio, 2006. "The Network Packing Problem in Terrestrial Broadcasting," Operations Research, INFORMS, vol. 54(4), pages 611-626, August.
    • Handle: RePEc:inm:oropre:v:54:y:2006:i:4:p:611-626
    DOI: 10.1287/opre.1060.0312
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1060.0312
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1060.0312?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
    ---><---

    References listed on IDEAS

    as
    1. Kumar Rajaram & Reza Ahmadi, 2003. "Flow Management to Optimize Retail Profits at Theme Parks," Operations Research, INFORMS, vol. 51(2), pages 175-184, April.
    2. F. Rossi & S. Smriglio & A. Sassano, 2001. "Models and Algorithms for Terrestrial Digital Broadcasting," Annals of Operations Research, Springer, vol. 107(1), pages 267-283, October.
    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. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    2. C. Mannino & S. Mattia & A. Sassano, 2011. "Planning wireless networks by shortest path," Computational Optimization and Applications, Springer, vol. 48(3), pages 533-551, April.
    3. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2010. "GUB Covers and Power-Indexed Formulations for Wireless Network Design," DIS Technical Reports 2010-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    4. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2009. "A Power-Indexed Formulation for Wireless Network Design," DIS Technical Reports 2009-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    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. Feng Qiu & Shabbir Ahmed & Santanu S. Dey & Laurence A. Wolsey, 2014. "Covering Linear Programming with Violations," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 531-546, August.
    2. Zhang, Yingsha & Li, Xiang (Robert) & Su, Qin & Hu, Xingbao, 2017. "Exploring a theme park's tourism carrying capacity: A demand-side analysis," Tourism Management, Elsevier, vol. 59(C), pages 564-578.
    3. Alexander, Matthew & MacLaren, Andrew & O’Gorman, Kevin & White, Christopher, 2012. "Priority queues: Where social justice and equity collide," Tourism Management, Elsevier, vol. 33(4), pages 875-884.
    4. Linze Chen & Junhan Liu & Yang Zhao, 2023. "Innovation and Development: An Analysis of Landscape Construction Factors in Quanzhou Maritime Silkroad Art Park," Sustainability, MDPI, vol. 15(4), pages 1-22, February.
    5. Edoardo Amaldi & Raphael Hauser, 2005. "Boundedness Theorems for the Relaxation Method," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 939-955, November.
    6. Fotiadis, Anestis K., 2016. "Modifying and applying time and cost blocks: The case of E-Da theme park, Kaohsiung, Taiwan," Tourism Management, Elsevier, vol. 54(C), pages 34-42.
    7. Carlo Mannino & Sara Mattia & Antonio Sassano, 2009. "Planning Wireless Networks by Shortest Path," DIS Technical Reports 2009-02, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    8. Rutger D. van Oest & Harald J. van Heerde & Marnik G. Dekimpe, 2010. "Return on Roller Coasters: A Model to Guide Investments in Theme Park Attractions," Marketing Science, INFORMS, vol. 29(4), pages 721-737, 07-08.

    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:inm:oropre:v:54:y:2006:i:4:p:611-626. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.