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

A tabu search heuristic for the generalized minimum spanning tree problem

Author

Listed:
  • Öncan, Temel
  • Cordeau, Jean-François
  • Laporte, Gilbert

Abstract

This paper describes an attribute based tabu search heuristic for the generalized minimum spanning tree problem (GMSTP) known to be NP-hard. Given a graph whose vertex set is partitioned into clusters, the GMSTP consists of designing a minimum cost tree spanning all clusters. An attribute based tabu search heuristic employing new neighborhoods is proposed. An extended set of TSPLIB test instances for the GMSTP is generated and the heuristic is compared with recently proposed genetic algorithms. The proposed heuristic yields the best results for all instances. Moreover, an adaptation of the tabu search algorithm is proposed for a variation of the GMSTP in which each cluster must be spanned at least once.

Suggested Citation

  • Öncan, Temel & Cordeau, Jean-François & Laporte, Gilbert, 2008. "A tabu search heuristic for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 306-319, December.
  • Handle: RePEc:eee:ejores:v:191:y:2008:i:2:p:306-319
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00893-4
    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. P. Pop, 2007. "On the prize-collecting generalized minimum spanning tree problem," Annals of Operations Research, Springer, vol. 150(1), pages 193-204, March.
    2. Haouari, Mohamed & Chaouachi, Jouhaina Siala, 2006. "Upper and lower bounding strategies for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 632-647, June.
    3. Pop, Petrica C. & Kern, W. & Still, G., 2006. "A new relaxation method for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 170(3), pages 900-908, May.
    4. M Haouari & J Chaouachi & M Dror, 2005. "Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 382-389, April.
    5. Bruce Golden & S. Raghavan & Daliborka Stanojević, 2005. "Heuristic Search for the Generalized Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 290-304, August.
    6. Dror, M. & Haouari, M. & Chaouachi, J., 2000. "Generalized spanning trees," European Journal of Operational Research, Elsevier, vol. 120(3), pages 583-592, February.
    7. M Haouari & J S Chaouachi, 2002. "A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(7), pages 792-799, July.
    8. Ghosh, Diptesh, 2003. "Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems," IIMA Working Papers WP2003-08-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    9. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    10. Duin, C. W. & Volgenant, A. & Vo[ss], S., 2004. "Solving group Steiner problems as Steiner problems," European Journal of Operational Research, Elsevier, vol. 154(1), pages 323-329, April.
    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. F. Carrabs & R. Cerulli & R. Pentangelo & A. Raiconi, 2018. "A two-level metaheuristic for the all colors shortest path problem," Computational Optimization and Applications, Springer, vol. 71(2), pages 525-551, November.
    2. Markus Leitner, 2016. "Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems," Computational Optimization and Applications, Springer, vol. 65(1), pages 73-92, September.
    3. Martin Bichler & Zhen Hao & Richard Littmann & Stefan Waldherr, 2020. "Strategyproof auction mechanisms for network procurement," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 965-994, December.
    4. Pop, Petrică C. & Matei, Oliviu & Sabo, Cosmin & Petrovan, Adrian, 2018. "A two-level solution approach for solving the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 478-487.
    5. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 0. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
    6. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 2020. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 636-659, October.
    7. Mehmet Berkehan Akçay & Hüseyin Akcan & Cem Evrendilek, 2018. "All Colors Shortest Path problem on trees," Journal of Heuristics, Springer, vol. 24(4), pages 617-644, August.
    8. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.

    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. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    2. Pop, Petrică C. & Matei, Oliviu & Sabo, Cosmin & Petrovan, Adrian, 2018. "A two-level solution approach for solving the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 478-487.
    3. F. Carrabs & R. Cerulli & R. Pentangelo & A. Raiconi, 2018. "A two-level metaheuristic for the all colors shortest path problem," Computational Optimization and Applications, Springer, vol. 71(2), pages 525-551, November.
    4. Markus Leitner, 2016. "Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems," Computational Optimization and Applications, Springer, vol. 65(1), pages 73-92, September.
    5. Haouari, Mohamed & Chaouachi, Jouhaina Siala, 2006. "Upper and lower bounding strategies for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 632-647, June.
    6. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 0. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
    7. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 2020. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 636-659, October.
    8. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2016. "Generalized minimum spanning tree games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 167-188, May.
    9. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    10. Bruce Golden & S. Raghavan & Daliborka Stanojević, 2005. "Heuristic Search for the Generalized Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 290-304, August.
    11. Pop, Petrica C. & Kern, W. & Still, G., 2006. "A new relaxation method for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 170(3), pages 900-908, May.
    12. Mehmet Berkehan Akçay & Hüseyin Akcan & Cem Evrendilek, 2018. "All Colors Shortest Path problem on trees," Journal of Heuristics, Springer, vol. 24(4), pages 617-644, August.
    13. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    14. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    15. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    16. Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    17. Jorge Riera-Ledesma & Juan-José Salazar-González, 2006. "Solving the asymmetric traveling purchaser problem," Annals of Operations Research, Springer, vol. 144(1), pages 83-97, April.
    18. M Haouari & J Chaouachi & M Dror, 2005. "Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 382-389, April.
    19. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    20. Ali Amiri, 0. "Application placement in computer clustering in software as a service (SaaS) networks," Information Technology and Management, Springer, vol. 0, pages 1-13.

    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:2:p:306-319. 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.