IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v46y2014i4p414-428.html
   My bibliography  Save this article

Tabu search with strategic oscillation for the quadratic minimum spanning tree

Author

Listed:
  • Manuel Lozano
  • Fred Glover
  • Carlos García-Martínez
  • Francisco Rodríguez
  • Rafael Martí

Abstract

The quadratic minimum spanning tree problem consists of determining a spanning tree that minimizes the sum of costs of the edges and pairs of edges in the tree. Many algorithms and methods have been proposed for this hard combinatorial problem, including several highly sophisticated metaheuristics. This article presents a simple Tabu Search (TS) for this problem that incorporates Strategic Oscillation (SO) by alternating between constructive and destructive phases. The commonalties shared by this strategy and the more recently introduced methodology called iterated greedy search are shown and implications of their differences regarding the use of memory structures are identified. Extensive computational experiments reveal that the proposed SO algorithm with embedded TS is highly effective for solving complex instances of the problem as compared with the best metaheuristics in the literature. A hybrid method that proves similarly effective for problem instances that are both simple and complex is introduced.

Suggested Citation

  • Manuel Lozano & Fred Glover & Carlos García-Martínez & Francisco Rodríguez & Rafael Martí, 2014. "Tabu search with strategic oscillation for the quadratic minimum spanning tree," IISE Transactions, Taylor & Francis Journals, vol. 46(4), pages 414-428.
    • Handle: RePEc:taf:uiiexx:v:46:y:2014:i:4:p:414-428
    DOI: 10.1080/0740817X.2013.768785
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2013.768785
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2013.768785?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.

    Citations

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


    Cited by:

    1. Ante Ćustić & Abraham P. Punnen, 2018. "A characterization of linearizable instances of the quadratic minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 436-453, February.
    2. Wei, Zequn & Hao, Jin-Kao & Ren, Jintong & Glover, Fred, 2023. "Responsive strategic oscillation for solving the disjunctively constrained knapsack problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 993-1009.

    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:taf:uiiexx:v:46:y:2014:i:4:p:414-428. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.