iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1287/TRSC.29.2.128
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T18:30:37Z","timestamp":1724178637311},"reference-count":0,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Transportation Science"],"published-print":{"date-parts":[[1995,5]]},"abstract":" Dynamic models of the behavior of automobile drivers in choosing routes through urban transportation networks are required for the design and operation of intelligent transportation systems generally, and traveler information systems in particular. In this paper, drivers' route choice behavior based on current, or instantaneous, information on network conditions is described using an optimal control theory formulation. The time-dependent origin-destination vehicle trip pattern is assumed to be known. The instantaneous dynamic user-optimal route choice problem is to allocate vehicle flows to the current minimal-cost routes, defined as the routes that minimize the route travel cost between each decision node (any node on the route including the origin) and the destination node based on the currently prevailing travel times. The continuous time formulation of the problem is transformed into a discrete time nonlinear programming (NLP) formulation. Each of a sequence of NLPs is then solved by an algorithm based on the Frank-Wolfe technique. In this sequence, approximate link travel times are updated iteratively in order to represent flow propagation over routes. Computational results from applying the algorithm to two test networks conclude the paper. <\/jats:p>","DOI":"10.1287\/trsc.29.2.128","type":"journal-article","created":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T22:50:20Z","timestamp":1225493420000},"page":"128-142","source":"Crossref","is-referenced-by-count":44,"title":["Solving an Instantaneous Dynamic User-Optimal Route Choice Model"],"prefix":"10.1287","volume":"29","author":[{"given":"David E.","family":"Boyce","sequence":"first","affiliation":[{"name":"Urban Transportation Center, University of Illinois at Chicago, Chicago, Illinois 60607"}]},{"given":"Bin","family":"Ran","sequence":"additional","affiliation":[{"name":"Institute of Transportation Studies, University of California at Berkeley, Richmond, California 94804"}]},{"given":"Larry J.","family":"Leblanc","sequence":"additional","affiliation":[{"name":"Owen Graduate School of Management, Vanderbilt University, Nashville, Tennessee 37203"}]}],"member":"109","container-title":["Transportation Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/trsc.29.2.128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:58:22Z","timestamp":1680469102000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/trsc.29.2.128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["10.1287\/trsc.29.2.128"],"URL":"https:\/\/doi.org\/10.1287\/trsc.29.2.128","relation":{},"ISSN":["0041-1655","1526-5447"],"issn-type":[{"value":"0041-1655","type":"print"},{"value":"1526-5447","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}