Evolutionary Algorithm for the Time-Dependent Orienteering Problem - Computer Information Systems and Industrial Management (CISIM 2017) Access content directly
Conference Papers Year : 2017

Evolutionary Algorithm for the Time-Dependent Orienteering Problem

Krzysztof Ostrowski
  • Function : Author
  • PersonId : 1024479

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.
Fichier principal
Vignette du fichier
448933_1_En_5_Chapter.pdf (380.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01656243 , version 1 (05-12-2017)

Licence

Attribution

Identifiers

Cite

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⟩
106 View
109 Download

Altmetric

Share

Gmail Facebook X LinkedIn More