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

Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks

Author

Listed:
  • Höller, Holger
  • Melián, Belén
  • Voí, Stefan

Abstract

Variable neighborhood search (VNS) and Greedy randomized adaptive search procedure (GRASP) are among the well studied local search based metaheuristics providing good results for many combinatorial optimization problems throughout the last decade. While they are usually explored in different environments one may encounter quite obvious commonalities. Based on previous successful applications of these two types of metaheuristics on various network design problems in telecommunications, we further enhance these approaches by incorporating ideas from the pilot method. The different heuristics are compared among each other as well as against objective function values obtained from a mathematical programming formulation based on a commercial solver. The problem instances cover a large variety of networks and demand patterns.

Suggested Citation

  • Höller, Holger & Melián, Belén & Voí, Stefan, 2008. "Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks," European Journal of Operational Research, Elsevier, vol. 191(3), pages 691-704, December.
    • Handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:691-704
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00126-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, April.
    2. Stefan Voßs & Andreas Fink & Cees Duin, 2005. "Looking Ahead with the Pilot Method," Annals of Operations Research, Springer, vol. 136(1), pages 285-302, April.
    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. Vidyarthi, Navneet & Jayaswal, Sachin & Chetty, Vikranth Babu Tirumala, 2013. "Exact Solution to Bandwidth Packing Problem with Queuing Delays," IIMA Working Papers WP2013-11-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    3. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    4. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    5. Michael Brusco & Douglas Steinley, 2007. "A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer;The Psychometric Society, vol. 72(4), pages 583-600, December.
    6. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    7. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    8. GALARZA MONTENEGRO, Bryan David & SÖRENSEN, Kenneth & VANSTEENWEGEN, Pieter, 2023. "A demand-responsive feeder service with a maximum headway at mandatory stops," Working Papers 2023001, University of Antwerp, Faculty of Business and Economics.
    9. Goodson, Justin C. & Thomas, Barrett W. & Ohlmann, Jeffrey W., 2017. "A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs," European Journal of Operational Research, Elsevier, vol. 258(1), pages 216-229.
    10. Costamagna, Eugenio & Fanni, Alessandra & Giacinto, Giorgio, 1998. "A Tabu Search algorithm for the optimisation of telecommunication networks," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 357-372, April.
    11. Wen-Chyuan Chiang & Panagiotis Kouvelis & Timothy L. Urban, 2002. "Incorporating Workflow Interference in Facility Layout Design: The Quartic Assignment Problem," Management Science, INFORMS, vol. 48(4), pages 584-590, April.
    12. Michele Ciavotta & Carlo Meloni & Marco Pranzo, 2016. "Speeding up a Rollout algorithm for complex parallel machine scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4993-5009, August.
    13. Raka Jovanovic & Antonio P. Sanfilippo & Stefan Voß, 2022. "Fixed set search applied to the multi-objective minimum weighted vertex cover problem," Journal of Heuristics, Springer, vol. 28(4), pages 481-508, August.
    14. Amiri, Ali, 2005. "The selection and scheduling of telecommunication calls with time windows," European Journal of Operational Research, Elsevier, vol. 167(1), pages 243-256, November.
    15. Seohee Kim & Chungmok Lee, 2021. "A branch and price approach for the robust bandwidth packing problem with queuing delays," Annals of Operations Research, Springer, vol. 307(1), pages 251-275, December.
    16. Raffaele Cerulli & Ciriaco D'Ambrosio & Domenico Serra & Carmine Sorgente, 2024. "The Budgeted Labeled Minimum Spanning Tree Problem," Mathematics, MDPI, vol. 12(2), pages 1-22, January.
    17. Bose, Indranil, 2009. "Bandwidth packing with priority classes," European Journal of Operational Research, Elsevier, vol. 192(1), pages 313-325, January.
    18. Marti, Rafael & Laguna, Manuel & Glover, Fred, 2006. "Principles of scatter search," European Journal of Operational Research, Elsevier, vol. 169(2), pages 359-372, March.
    19. Michael Brusco & Renu Singh & Douglas Steinley, 2009. "Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis," Psychometrika, Springer;The Psychometric Society, vol. 74(4), pages 705-726, December.
    20. Raka Jovanovic & Abdelkader Bousselham & Stefan Voß, 2018. "Partitioning of supply/demand graphs with capacity limitations: an ant colony approach," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 224-249, January.

    More about this item

    Statistics

    Access and download statistics

    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:191:y:2008:i:3:p:691-704. 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.