IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v71y2018i2d10.1007_s10589-018-0014-2.html
   My bibliography  Save this article

A two-level metaheuristic for the all colors shortest path problem

Author

Listed:
  • F. Carrabs

    (University of Salerno)

  • R. Cerulli

    (University of Salerno)

  • R. Pentangelo

    (University of Salerno)

  • A. Raiconi

    (University of Salerno)

Abstract

Given an undirected weighted graph, in which each vertex is assigned to a color and one of them is identified as source, in the all-colors shortest path problem we look for a minimum cost shortest path that starts from the source and spans all different colors. The problem is known to be NP-Hard and hard to approximate. In this work we propose a variant of the problem in which the source is unspecified and show the two problems to be computationally equivalent. Furthermore, we propose a mathematical formulation, a compact representation for feasible solutions and a VNS metaheuristic that is based on it. Computational results show the effectiveness of the proposed approach for the two problems.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:coopap:v:71:y:2018:i:2:d:10.1007_s10589-018-0014-2
    DOI: 10.1007/s10589-018-0014-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-018-0014-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-018-0014-2?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.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Festa, P. & Guerriero, F. & Laganà, D. & Musmanno, R., 2013. "Solving the shortest path tour problem," European Journal of Operational Research, Elsevier, vol. 230(3), pages 464-474.
    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. 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.
    8. Ö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.
    9. Snyder, Lawrence V. & Daskin, Mark S., 2006. "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 38-53, 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. Ze Pan & Xinyun Wu & Caiquan Xiong, 2023. "Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem," Mathematics, MDPI, vol. 11(19), pages 1-20, October.
    2. Tristan Becker, 2020. "A decomposition heuristic for rotational workforce scheduling," Journal of Scheduling, Springer, vol. 23(5), pages 539-554, October.

    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. Ö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.
    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. 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. 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.
    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. 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.
    9. Bernardino, Raquel & Paias, Ana, 2018. "Solving the family traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 267(2), pages 453-466.
    10. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    11. 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.
    12. 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.
    13. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
    14. Karapetyan, D. & Gutin, G., 2012. "Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 219(2), pages 234-251.
    15. Mehdi El Krari & Belaïd Ahiod & Youssef Bouazza El Benani, 2021. "A pre-processing reduction method for the generalized travelling salesman problem," Operational Research, Springer, vol. 21(4), pages 2543-2591, December.
    16. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    17. Baniasadi, Pouya & Foumani, Mehdi & Smith-Miles, Kate & Ejov, Vladimir, 2020. "A transformation technique for the clustered generalized traveling salesman problem with applications to logistics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 444-457.
    18. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    19. Bruce Golden & Zahra Naji-Azimi & S. Raghavan & Majid Salari & Paolo Toth, 2012. "The Generalized Covering Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 534-553, November.
    20. Amir Hossein Gharehgozli & Gilbert Laporte & Yugang Yu & René de Koster, 2015. "Scheduling Twin Yard Cranes in a Container Block," Transportation Science, INFORMS, vol. 49(3), pages 686-705, August.

    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:spr:coopap:v:71:y:2018:i:2:d:10.1007_s10589-018-0014-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.