IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v6y2010i1p45-61.html
   My bibliography  Save this article

Probabilistic solution discovery algorithm for the orienteering problem

Author

Listed:
  • Jose Emmanuel Ramirez-Marquez
  • Sadan Kulturel-Konak
  • Claudio M. Rocco Sanseverino

Abstract

Orienteering is a competition where participants have a specific time to travel between initial and final locations. This competition is known as the orienteering problem (OP) where the objective is to maximise the reward of visiting sites while not violating constraints on time and final location. Although very good solutions can be obtained via search space heuristics, their coding, development and implementation still require extensive familiarisation and background on the technique of choice. This paper presents an evolutionary algorithm that offers simple and efficient analysis for the OP via three interrelated steps: solution generation via Monte Carlo (MC) simulation; analysis and computation of the reward and distance of these solutions and an evolutionary technique that drives the selection of potentially optimal solutions. The algorithm is tested against benchmark techniques for problems previously solved in the literature and newly developed larger size test problems.

Suggested Citation

  • Jose Emmanuel Ramirez-Marquez & Sadan Kulturel-Konak & Claudio M. Rocco Sanseverino, 2010. "Probabilistic solution discovery algorithm for the orienteering problem," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 6(1), pages 45-61.
    • Handle: RePEc:ids:ijisen:v:6:y:2010:i:1:p:45-61
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=33996
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijisen:v:6:y:2010:i:1:p:45-61. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.