Problem of optimal choice of a route under conditions of time discounting

被引：0

作者：

Tonkov, LV

Chentsov, AG

机构：

来源：

CYBERNETICS AND SYSTEMS ANALYSIS | 1999年 / 35卷 / 01期

关键词：

Dynamic Programming; Nonempty Subset; Travel Salesman Problem; Travel Salesman Problem; Polygonal Line;

D O I：

10.1007/BF02667918

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：89 / 99

页数：11

共 50 条

[1] Problem of optimal choice of a route under conditions of time discounting
L. V. Tonkov
A. G. Chentsov
Cybernetics and Systems Analysis, 1999, 35 : 89 - 99
[2] Dynamic user-optimal departure time/route choice problem with time-window
Chen, HK
Chang, MS
JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2000, 23 (01) : 71 - 81
[3] Optimal supplier choice with discounting
Goldengorin, B.
Keane, J.
Kuzmenko, V.
Tso, M. K-S
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (04) : 690 - 699
[4] Dynamic capacitated user-optimal departure time/route choice problem with time-window
Chen, HK
Chang, MS
Wang, CY
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 132 (03) : 603 - 618
[5] Optimal toll design problem in dynamic traffic networks with joint route and departure time choice
Joksimovic, D
Blierner, MCJ
Bovy, PHL
NETWORK MODELING 2005, 2005, (1923): : 61 - 72
[6] Optimality Conditions in Infinite-Horizon Optimal Control Problem with Vanishing Discounting
Shvartsman, Ilya
2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC, 2023, : 6273 - 6276
[7] Route choice behavior model under time pressure
Gao, Feng
CIVIL ENGINEERING AND URBAN PLANNING III, 2014, : 349 - 353
[8] A model and an algorithm for the dynamic user-optimal route choice problem
Chen, HK
Hsueh, CF
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1998, 32 (03) : 219 - 234
[9] Route choice decision under travel time uncertainty
de Palma, A
Picard, N
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2005, 39 (04) : 295 - 324
[10] Time horizons, discounting, and intertemporal choice
Streich, Philip
Levy, Jack S.
JOURNAL OF CONFLICT RESOLUTION, 2007, 51 (02) : 199 - 226

← 1 2 3 4 5 →