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
CITATION STYLE
Tasgetiren, M. (2002). A Genetic Algorithm with an Adaptive Penalty Function for the Orienteering Problem. Journal of Economic & Social Research, 4(2), 1–26. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&profile=ehost&scope=site&authtype=crawler&jrnl=13021060&AN=16238246&h=x14BS5Cbdga0F7YflJtxoAFGB55wvaU4EdrgpgtY2r7ZkOxHsIdwoLqAo6sgtD6ZFmvU15b49jo5ow6oS1zoqQ==&crl=c
Mendeley helps you to discover research relevant for your work.