Dynamic capacitated user-optimal route choice problem
- Author
- CHEN, H.-K1 ; WANG, C.-Y1
[1] Department of Civil Engineering, National Central University, Chung-Li, 32054, Taiwan, Province of China - Conference title
- Transportation network modeling
- Conference name
- Annual Meeting of the Transportation Research Board (78 ; 1999-01)
- Author (monograph)
- National Research Council ; Transportation Research Board, Washington, DC 20418, United States (Funder/Sponsor)
- Source
Transportation research record. 1999, Num 1667, pp 16-24 ; ref : 12 ref
- CODEN
- TRREDM
- ISSN
- 0361-1981
- Scientific domain
- Civil engineering; Transportation
- Publisher
- National Research Council, Washington, DC
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Algorithme Congrès international Critère sélection Durée trajet Exemple Itinéraire Longueur file Modèle origine destination Méthode Lagrange Simulation numérique Temps retard Trafic routier Méthode projection gradient
- Keyword (en)
- Algorithm International conference Selection criterion Travel time Example Route Queue length Origin destination model Lagrangian method Numerical simulation Delay time Road traffic
- Keyword (es)
- Algoritmo Congreso internacional Criterio selección Duración trayecto Ejemplo Itinerario Longitud hilera Modelo origen destinación Método Lagrange Simulación numérica Tiempo retardo Tráfico carretera
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D15 Ground, air and sea transportation, marine construction / 001D15C Road transportation and traffic
- Discipline
- Building. Public works. Transport. Civil engineering
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1211598
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.3141/1667-03 
https://dx.doi.org/10.3141/1667-03
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:15:\"10.3141\/1667-03\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Transportation research record\";s:9:\"\u0000*\u0000stitle\";s:16:\"Transp. res. rec\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:4:\"1667\";s:8:\"\u0000*\u0000spage\";s:2:\"16\";s:8:\"\u0000*\u0000epage\";s:2:\"24\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-1981\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"H.-K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"WANG, C.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRREDM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:31:\"Transportation network modeling\";s:8:\"\u0000*\u0000title\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:8:\"\u0000*\u0000place\";s:14:\"Washington, DC\";s:6:\"\u0000*\u0000pub\";s:25:\"National Research Council\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:15:\"10.3141\/1667-03\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Transportation research record\";s:9:\"\u0000*\u0000stitle\";s:16:\"Transp. res. rec\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:4:\"1667\";s:8:\"\u0000*\u0000spage\";s:2:\"16\";s:8:\"\u0000*\u0000epage\";s:2:\"24\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-1981\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"H.-K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"WANG, C.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRREDM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:31:\"Transportation network modeling\";s:8:\"\u0000*\u0000title\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:8:\"\u0000*\u0000place\";s:14:\"Washington, DC\";s:6:\"\u0000*\u0000pub\";s:25:\"National Research Council\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:15:\"10.3141\/1667-03\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:15:\"10.3141\/1667-03\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Transportation research record\";s:9:\"\u0000*\u0000stitle\";s:16:\"Transp. res. rec\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:4:\"1667\";s:8:\"\u0000*\u0000spage\";s:2:\"16\";s:8:\"\u0000*\u0000epage\";s:2:\"24\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-1981\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"H.-K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"WANG, C.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRREDM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:31:\"Transportation network modeling\";s:8:\"\u0000*\u0000title\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:8:\"\u0000*\u0000place\";s:14:\"Washington, DC\";s:6:\"\u0000*\u0000pub\";s:25:\"National Research Council\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:15:\"10.3141\/1667-03\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Transportation research record\";s:9:\"\u0000*\u0000stitle\";s:16:\"Transp. res. rec\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:4:\"1667\";s:8:\"\u0000*\u0000spage\";s:2:\"16\";s:8:\"\u0000*\u0000epage\";s:2:\"24\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-1981\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"H.-K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"WANG, C.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRREDM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:31:\"Transportation network modeling\";s:8:\"\u0000*\u0000title\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:8:\"\u0000*\u0000place\";s:14:\"Washington, DC\";s:6:\"\u0000*\u0000pub\";s:25:\"National Research Council\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:15:\"10.3141\/1667-03\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Transportation research record\";s:9:\"\u0000*\u0000stitle\";s:16:\"Transp. res. rec\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:4:\"1667\";s:8:\"\u0000*\u0000spage\";s:2:\"16\";s:8:\"\u0000*\u0000epage\";s:2:\"24\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-1981\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"H.-K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"WANG, C.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRREDM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:31:\"Transportation network modeling\";s:8:\"\u0000*\u0000title\";s:53:\"Dynamic capacitated user-optimal route choice problem\";s:8:\"\u0000*\u0000place\";s:14:\"Washington, DC\";s:6:\"\u0000*\u0000pub\";s:25:\"National Research Council\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
