Historic vehicles: an overview from a transport policy perspective

Historic vehicles (HVs) are the heritage of road transport that have surprisingly received little attention in the academic literature. This study presents an overview of the literature on HVs, focusing on the three topics that dominate the policy debate on transport: environmental, safety and congestion impacts. We observed that polluting emissions of HVs are per kilometre much higher (often a factor 5 or more) than those of moderns vehicles. The annual average mileage per vehicle per year of HVs is much lower than other vehicles. The lower active and passive safety levels of HVs are compensated by the way these vehicles are driven, resulting in the risk factors per kilometre being roughly equal or lower than other vehicles. The contribution of HVs to congestion is negligible. However, the transport policy discourse is divided on the topic of HVs. More comprehensive and effective laws and regulation are needed to protect this aspect of the heritage of road transport whilst concurrently avoiding or limiting the problems caused by them.     

The design of single allocation incomplete hub networks

The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption constitutes the starting point of the present work. In this study, we provide a uniform modeling treatment to all the single allocation variants of the existing hub location problems, under the incomplete hub network design. No network structure other than connectivity is imposed on the induced hub network. Within this context, the single allocation incomplete p-hub median, the incomplete hub location with fixed costs, the incomplete hub covering, and the incomplete p-hub center network design problems are defined, and efficient mathematical formulations for these problems with O(n³) variables are introduced. Computational analyses with these formulations are presented on the various instances of the CAB data set and on the Turkish network.