Probabilistic solution discovery algorithm for the orienteering problem

José Emmanuel Ramirez-Marquez, Sadan Kulturel-Konak, Claudio M.Rocco Sanseverino

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)45-61
Number of pages17
JournalInternational Journal of Industrial and Systems Engineering
Volume6
Issue number1
StatePublished - Jul 1 2010

Fingerprint

Evolutionary algorithms
Monte Carlo simulation

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Cite this

Ramirez-Marquez, José Emmanuel ; Kulturel-Konak, Sadan ; Sanseverino, Claudio M.Rocco. / Probabilistic solution discovery algorithm for the orienteering problem. In: International Journal of Industrial and Systems Engineering. 2010 ; Vol. 6, No. 1. pp. 45-61.
@article{0603e84e0d8142c4a9215180c2fca7b1,
title = "Probabilistic solution discovery algorithm for the orienteering problem",
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.",
author = "Ramirez-Marquez, {Jos{\'e} Emmanuel} and Sadan Kulturel-Konak and Sanseverino, {Claudio M.Rocco}",
year = "2010",
month = "7",
day = "1",
language = "English (US)",
volume = "6",
pages = "45--61",
journal = "International Journal of Industrial and Systems Engineering",
issn = "1748-5037",
publisher = "Inderscience Enterprises Ltd",
number = "1",

}

Probabilistic solution discovery algorithm for the orienteering problem. / Ramirez-Marquez, José Emmanuel; Kulturel-Konak, Sadan; Sanseverino, Claudio M.Rocco.

In: International Journal of Industrial and Systems Engineering, Vol. 6, No. 1, 01.07.2010, p. 45-61.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Probabilistic solution discovery algorithm for the orienteering problem

AU - Ramirez-Marquez, José Emmanuel

AU - Kulturel-Konak, Sadan

AU - Sanseverino, Claudio M.Rocco

PY - 2010/7/1

Y1 - 2010/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77954438517&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954438517&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:77954438517

VL - 6

SP - 45

EP - 61

JO - International Journal of Industrial and Systems Engineering

JF - International Journal of Industrial and Systems Engineering

SN - 1748-5037

IS - 1

ER -