@inproceedings{40425edd26af4864aceb9a6df006826a,
title = "Dynamic time-linkage problems revisited",
abstract = "Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where {"}decisions that are made now... may influence the maximum score that can be obtained in the future{"}[3]. This paper contributes to understanding the questions of what are the unknown characteristic of DTPs and how to characterize DTPs. Firstly, based on existing definitions we will introduce a more detailed definition to help characterize DTPs. Secondly, although it is believed that DTPs can be solved to optimality with a perfect prediction method to predict function values [3] [4], in this paper we will discuss a new class of DTPs where even with such a perfect prediction method algorithms might still be deceived and hence will not be able to get the optimal results. We will also propose a benchmark problem to study that particular type of time-linkage problems. {\textcopyright}Springer-Verlag Berlin Heidelberg 2009.",
author = "NGUYEN, {Trung Thanh} and Xin YAO",
year = "2009",
doi = "10.1007/978-3-642-01129-0_83",
language = "English",
isbn = "9783642011283",
series = "Lecture Notes in Computer Science",
publisher = "Springer Berlin Heidelberg",
pages = "735--744",
editor = "Mario GIACOBINI and Anthony BRABAZON and CAGNONI, { Stefano} and CARO, {Gianni A.} and Anik{\'o} EK{\'A}RT and ESPARCIA-ALC{\'A}ZAR, {Anna Isabel} and Muddassar FAROOQ and Andreas FINK and Penousal MACHADO",
booktitle = "Applications of Evolutionary Computing : EvoWorkshops 2009 : EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG,T{\"u}bingen, Germany, April 15-17, 2009, Proceedings",
note = "2009 Workshops on Applications of Evolutionary Computation, EvoWorkshops 2009 ; Conference date: 15-04-2009 Through 17-04-2009",
}