Skip to Main content Skip to Navigation
Conference papers

Evolutionary Algorithm for the Time-Dependent Orienteering Problem

Abstract : 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.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-01656243
Contributor : Hal Ifip <>
Submitted on : Tuesday, December 5, 2017 - 2:58:40 PM
Last modification on : Wednesday, December 6, 2017 - 1:20:59 AM

File

448933_1_En_5_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Krzysztof Ostrowski. Evolutionary Algorithm for the Time-Dependent Orienteering Problem. 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.50-62, ⟨10.1007/978-3-319-59105-6_5⟩. ⟨hal-01656243⟩

Share

Metrics

Record views

170

Files downloads

135