Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Conference on Discrete Optimization and Operations Research, DOOR 2016; Vladivostok; Vladivostok
Год издания: 2016
Ключевые слова: ALT algorithm, Big graphs, heuristic, landmarks, routing, shortest path
Аннотация: The Time-Dependent Shortest-Path problem is extension of shortest path problem in the graph when the graph arc weight is a function of the departure time from the initial vertex of the arc. Such graph is called a time-dependent network. We propose a modification of the algorithm ALT (A∗ with Landmarks & Triangle), carrying out goalПоказать полностью-directed search of way in the network using landmarks. Landmarks are set using adaptive strategy. Presents the results of experiments.
Выпуск журнала: 1623
Номера страниц: 367-372