SYSTEM-OPTIMAL TRIP SCHEDULING AND ROUTING IN COMMUTING NETWORKS

Auteur(s)
CHANG, G-L MAHMASSANI, HS ENGQUIST, ML
Samenvatting

A time-space network formulation is presented for the system-optimal assignment to departure times and routes of traffic flows from multiple origins to a common destination. Time is discretized, and congestion is represented using simplified deterministic queuing stations. The solution minimizes total travel time in the system subjectto arrivals at the destination taking place within a specified timeinterval. Alternatively, a formulation is presented for the minimization of a total cost measure consisting of a weighted sum of the users' travel time and schedule delay. The solution can be obtained using efficient and widely available pure network optimization algorithms. A numerical application is presented to illustrate the methodology, including a network generator developed for this purpose. Thispaper appears in transportation research record no. 1251, Transportsupply analysis.

Publicatie aanvragen

10 + 0 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
I 835537 IRRD 9101
Uitgave

TRANSPORTATION RESEARCH RECORD WASHINGTON D.C. USA 0361-1981 SERIAL 1989-01-01 1251 PAG:54-65 T28

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.