Advanced Search
MyIDEAS: Login to save this article or follow this journal

Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search

Contents:

Author Info

  • Jiefeng Xu

    (Delta Technology, Inc., 1001 International Boulevard, Atlanta, Georgia 30354-1801)

  • Steve Y. Chiu

    (GTE Laboratories, Inc., 40 Sylvan Road, Waltham, Massachusetts 02254)

  • Fred Glover

    (Graduate School of Business, University of Colorado at Boulder, Boulder, Colorado 80309-0419)

Registered author(s):

    Abstract

    One of the private line network design problems in the telecommunications industry is to interconnect a set of customer locations through a ring of end offices so as to minimize the total tariff cost and provide reliability. We develop a Tabu Search method for the problem that incorporates long term memory, probabilistic move selections, hierarchical move evaluation, candidate list strategies and an elite solution recovery strategy. Computational results for test data show that the Tabu Search heuristic finds optimal solutions for all test problems that can be solved exactly by a branch-and-cut algorithm, while running about three orders of magnitude faster than the exact algorithm. In addition, for larger size problems that cannot be solved exactly, the tabu search algorithm outperforms the best local search heuristic currently available. The performance gap favoring Tabu Search increases significantly for more difficult problem instances.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mnsc.45.3.330
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 45 (1999)
    Issue (Month): 3 (March)
    Pages: 330-345

    as in new window
    Handle: RePEc:inm:ormnsc:v:45:y:1999:i:3:p:330-345

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: digital data service; telecommunications network design; traveling salesman problem; tabu search; heuristic;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    2. Labbe, Martine & Laporte, Gilbert & Rodriguez Martin, Inmaculada & Gonzalez, Juan Jose Salazar, 2005. "Locating median cycles in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 457-470, January.
    3. Balakrishnan, Anantaram & Banciu, Mihai & Glowacka, Karolina & Mirchandani, Prakash, 2013. "Hierarchical approach for survivable network design," European Journal of Operational Research, Elsevier, vol. 225(2), pages 223-235.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:3:p:330-345. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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