IDEAS home Printed from https://ideas.repec.org/h/spr/comchp/978-3-030-38766-2_10.html
   My bibliography  Save this book chapter

A Similarity Hybrid Harmony Search Algorithm for the Orienteering Problem

In: Operational Research in Agriculture and Tourism

Author

Listed:
  • Eleftherios Tsakirakis

    (School of Production Engineering and Management, Technical University of Crete)

  • Magdalene Marinaki

    (School of Production Engineering and Management, Technical University of Crete)

  • Yannis Marinakis

    (School of Production Engineering and Management, Technical University of Crete)

Abstract

In the last few years there is a continuous growth in modeling and solving of problems of different fields (logistics, tourism, games) as Orienteering Problems (OPs). The Orienteering Problem is a combinatorial optimization problem where a standard amount of nodes are given, each with a specific score. The main goal is to find a path, limited in length, from the start point to the end point through a subset of locations in order to maximize the total path score. In this paper, we present a variant of the classic Harmony Search (HS) algorithm, the Similarity Hybrid Harmony Search (SHHS) algorithm, for the solution of the Orienteering Problem. The SHHS follows the basic steps of the standard HS with some minor changes and includes a new idea considering the similarity of the feasible routes such as the musical notes of a suitable frequency for the Harmony Memory. The algorithm was tested in a number of benchmark instances from the literature and in most of them the best known solutions were found.

Suggested Citation

  • Eleftherios Tsakirakis & Magdalene Marinaki & Yannis Marinakis, 2020. "A Similarity Hybrid Harmony Search Algorithm for the Orienteering Problem," Cooperative Management, in: Evangelia Krassadaki & George Baourakis & Constantin Zopounidis & Nikolaos Matsatsinis (ed.), Operational Research in Agriculture and Tourism, pages 197-218, Springer.
    • Handle: RePEc:spr:comchp:978-3-030-38766-2_10
    DOI: 10.1007/978-3-030-38766-2_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:comchp:978-3-030-38766-2_10. 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: 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.