Probabilistic solution discovery algorithm for the orienteering problem Online publication date: Tue, 06-Jul-2010
by Jose Emmanuel Ramirez-Marquez, Sadan Kulturel-Konak, Claudio M. Rocco Sanseverino
International Journal of Industrial and Systems Engineering (IJISE), Vol. 6, No. 1, 2010
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com