The vagrant ethic: Need for a sea-lane philosophy

Although considerable progress has recently been made in the evolution of marine traffic procedures in coastal and waterway areas, mariners are finding difficulty in coping with the diverse traffic schemes that have so far been devised. This paper is a plea for international and logical marine traffic management, so that ships can operate safely and efficiently within a framework of the proliferating offshore zonal legislation that we are now witnessing.     

Traffic assignment by trip type using volume restraint and link restraint for application in small urban areas

This research involved the development of a new traffic assignment model consisting of a set of procedures for an urbanized area with a population of 172,000. Historical, social, and economic data were used as input to conventional trip generation and trip distribution models to produce a trip table for network assignment. This fixed table was divided into three trip types: external-external trips, external-internal trips, and internal-internal trips. The methodology used to develop the new traffic assignment model assigned each of the trip types by varying the diversion of trips from the minimum path. External-external trips were assigned on a minimum path routing and external-internal trips were assigned with a slight diversion from the minimum path. Internal-internal trips were assigned with more diversion than external-internal trips and adjusted by utilizing iterative volume restraint and incremental link restraint. A statistical analysis indicated that assigning trips by trip types using trip diversion and volume and link restraint produces a significant improvement in the accuracy of the assigned traffic volumes.     

A maritime productivity study 1859-1919

This is one of two papers designed to test the ability of a theoretical model of productivity measurement [1] with times series empirical data. The analysis was able to identify trends in productivity growth for sailing ships and stcamships. scparating long and short run components . One of the interesting features of the findings is that the long run growth rate is the same for both sailing and steamships. Although sail and steam appear to be two unique technologies, it is found that technologica progress is evolutionary not revolutionary.

The techique using covariance analysis proved useful for times series productivity measurement.     

An assignment principle for urban networks based on travel budgets

A new assignment principle for traveler behavior in an urban network is described which is based on empirical findings in the theory of travel budgets. It characterizes the distribution of travelers, demand, and modal split. It treats all travel decisions (whether to travel, where to go, how to get there) and the important costs (time and money) in a single, unified way. A numerical technique is proposed and it is applied to several examples to illustrate qualitative features.     

A regression model for bus running times in suburban areas of winnipeg

To plan new bus routes in suburban areas, expected bus running times on these routes are needed. Using most readily available relevant variables, a regression model is developed for estimating bus running times. The model is conceptually reasonable and it was tested using data other than that used for estimation.     

Ship finance and Euro-markets

Due to the capital-intensive nature of the modern shipping industry, loan finance plays a major role in vessel-acquisition cost. In this paper, J. B. Yolland discusses government-guaranteed finance, ancillary and commercial new building finance and finance for second-hand tonnage. He also examines a new source of funding found in the Euro-market.     

A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration

This paper presents a novel user-equilibrium (UE) traffic assignment algorithm, which under conventional assumptions, promises to compute UE arc flows to acceptable precision, regardless of the network’s topology, size or congestion:

• The algorithm takes the simple approach of shifting flow from a costliest path to a cheapest path until the costs of all used paths are within a given of the cheapest.

• Because of being path-based, it avoids tailing.

• In spite of being path-based, it neither stores nor enumerates paths.

• These efficiencies derive from decomposing the problem into a sequence of easy single-origin problems on acyclic sub-networks.

Solutions to this sequence of sub-network flows converge rapidly to a sharp practical estimate of UE arc flows—as is amply demonstrated by tests using the Chicago region’s 40,000-arc network model.     

Parameter estimability in the multinomial probit model

A particular parameter estimability problem in the multinomial probit model is considered. Making use of a model discussed in the literature, some problems with the usual method of specification are discussed. Some general comments are made on the problem of selecting a normalisation when using the multinomial probit model.