Transpn Res. 6, 293-308. This paper analyzes three different methods for specifying the transportation system characteristics in an intraurban behavioral modal split model. The procedures investigated include a null case where no system information is used, direct comparisons of intermodal travel times, and a methodology employing user perceptions of the modal characteristics. The latter approach is an innovation which is derived from utility theory and synthesizes origin-destination data and attitudinal survey information. The results indicate that the modal choice decision mode1 improves as the sophistication in method for representing the system attributes increases. A theory of modal choice behavior is formulated in view of user perceptions of preferred standards for transit service.
ROBERT G. MCGILLIVRAY:
Mode split and the value of travel time. Transpn Res. 6, 309-316.
The modal split problem is characterized as a perfect substitutes model of consumer choice. It is shown that, in the discrete choice case, a broad range of indeterminacy exists unless a value of time function is assumed or estimated. Several alternative estimation procedures for mode split and the value of time are summarized. For two cases the relationships between the fitted model, the value of time and traveler benefits are indicated.
BRIAN T. BENNETT and DENOS C. GAZIS:
School bus routing by computer. Transpn. Res. 6,
317-325. A procedure is described for the designing of school bus routes by computer. The procedure is more flexible than previously published ones in a number of ways. The objective function includes the reduction of student travel time, u-turns and bus overloading, as well as the reduction of bus travel time. The procedure can also handle one-way streets, a bus garage other than at the school site and the requirement that at certain stop + the bus must pick u children from one particular side of the road. The procedure is an extension of the Clarke and Wright algorithm for scheduling delivery vehicles.
DIETRICH R. BERGMANN:
Generalized expressions for the minimum time interval between consecutive arrivals at an idealized railway station. Transpn ReA. 6, 327-341. This paper presents recently derived solutions fo?‘the minimum time interval between successive arrivals at a station in a railway system. Railway systems are considered to include all modes of ground transport in which a vehicle follows another by a gap that is not less than the following vehicle’s emergency stopping distance. Seven independent variables are identified and the problem is formulated mathematically. The solutions that are then presented are based on the assumption that the level of emergency deceleration is The solutions are compared to less not less than the level of operational deceleration. general previous results and are applied in the development of conclusions regarding vehicle design and operational control at station entrances.