The Time-Dependent Orienteering Problem (TDOP) is a generalization of the Orienteering Problem where graph weights vary with time. It has many real life applications particularly associated with transport networks, in which travel time between two points depends on the moment of start. The paper presents an evolutionary algorithm with embedded local search operators and heuristic crossover, which solves TDOP. The algorithm was tested on TDOP benchmark instances and in most cases achieved optimal or near optimal results clearly outperforming other published methods.
CITATION STYLE
Ostrowski, K. (2017). Evolutionary algorithm for the time-dependent orienteering problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10244 LNCS, pp. 50–62). Springer Verlag. https://doi.org/10.1007/978-3-319-59105-6_5
Mendeley helps you to discover research relevant for your work.