A Genetic Algorithm with an Adaptive Penalty Function for the Orienteering Problem

  • Tasgetiren M
  • 24


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


This paper presents a genetic algorithm to solve the orienteering problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are specified, so as to maximize the total score collected subject to a prescribed distance constraint. Employing several sets of test problems from the literature, the performance of the genetic algorithm is evaluated against problem specific heuristics and an artificial neural network optimizer

Author-supplied keywords

  • genetic algorithm
  • near feasibility threshold
  • orienteering problem

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links


  • Mf Tasgetiren

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free