The Comparison of Genetic Algorithms Which Solve Orienteering Problem Using Complete and Incomplete Graph

@inproceedings{Ostrowski2012TheCO,
  title={The Comparison of Genetic Algorithms Which Solve Orienteering Problem Using Complete and Incomplete Graph},
  author={Krzysztof Ostrowski and Jolanta Koszelew},
  year={2012}
}
The purpose of this work was to compare two forms of genetic algorithm (complete and incomplete graph version) which solves Orienteering Problem (OP). While in most papers concerning OP graph is complete and satisfies triangle inequality, in our versions such assumptions may not be satisfied. It could be more practical as transport networks are graphs which do not have to satisfy those conditions. In such cases, graphs are usually complemented with fictional edges before they can be used by… CONTINUE READING