%0 Conference Proceedings
%T Evolutionary Algorithm for the Time-Dependent Orienteering Problem
%+ Białystok University of Technology
%A Ostrowski, Krzysztof
%Z Part 1: Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Bialystok, Poland
%Y Khalid Saeed
%Y Władysław Homenda
%Y Rituparna Chaki
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-10244
%P 50-62
%8 2017-06-16
%D 2017
%R 10.1007/978-3-319-59105-6_5
%K Time-dependent orienteering problem
%K Evolutionary algorithm
%K Metaheuristic
%K Local search operators
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01656243/document
%2 https://inria.hal.science/hal-01656243/file/448933_1_En_5_Chapter.pdf
%L hal-01656243
%U https://inria.hal.science/hal-01656243
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-10244