Individual Versus Social Optimization in Commuter Route Choice

摘要

Each of N customers must select one of K commuter routes daily. Each commuter route is represented as a series of M/D/1 queuing stations with fixed travel times between stations. In the basic model, all customers arrive at the start of their selected route simultaneously; results which are optimal for the basic model are shown to be nearly optimal under a variety of more realistic arrival assumptions. (Author)