The existence of high load and latency in the CAN bus network would indeed lead to a situation where a given message crosses its deadline; this situation would disturb the continuity of the required service as well as activating fault codes due to delay of message delivery, which might lead to system failure. The outcome and goal of this thesis is to research and formulate methods to determine and model busload and latencies, by determining parameters such as alpha and breakdown utilization, which are considered as indications to the start of network breakdown when a given message in a dataset start to introduce latency by crossing its deadline which are totally prohibited in critical real time communications. The final goal of this master thesis is to develop a TOOL for calculating, modeling, determining and visualizing worst case busload, throughput, networks’ breakdown points and worst case latency in Scania CAN bus networks which is based on the J1939 protocol. SCANLA (The developed CAN busload analyzer tool in this thesis) is running as an executable application and uses a Graphical User Interface as a human-computer interface (i.e., a way for humans to interact with the tool) that useswindows,icons and menus and which can be manipulated by a mouse.

Thesis (M.A.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 46-50).

Thesis (M.S.)--University of Wisconsin--Madison, 1968. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (M.A.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 46-50). Also available in print.

Thesis (M. A.)--University of Hong Kong, 2004. / Title proper from title frame. Also available in printed format.

Akademisk avhandling--Lund. / Added t.p., with thesis statement, inserted.

Thesis (M.S.)--University of Wisconsin--Madison, 1959. / Typescript. eContent provider-neutral record in process. Description based on print version record.

Since the initial development of inter-city transport, fixed stopping places serving inter-city common carrier modes have become established. Such stopping places include locations with specialized structures or terminals that facilitate the interchange process and link the access or egress journey to the line haul mode. Traditionally inter-city bus terminals have been situated in the central business district of metropolitan areas. However, the expansion of urban areas and the dispersion of urban activities into these areas would suggest that the traditional location of the bus terminals is no longer optimal. This thesis poses this question in the hypothesis which states: The optimal location for an inter-city bus terminal in an urban metropolitan area is one at or near that metropolitan area's central business district. In order to develop a definition for optimal location an examination is first made of inter-model competition and factors that affect demand. Time and cost are indicated in the literature to be of prime importance and their minimization encourages travel. As access and egress journeys form significant elements of the inter-city journey, the time and cost of these journey segments receive most of the attention in the literature surveyed. Measurements of these factors is discussed at length. As the inter-city terminal is the interchange point which links the access or egress journey to the line haul mode, a variation in the terminals' location will affect these journey segments. The optimal location is defined in terms of minimizing the access/egress journey times and cost in order to stimulate demand. However, demand oriented locations may have high land acquisition and operating costs that would negate the benefit of such locations and for this reason this aspect must be considered in the location evaluation. Finally, consideration is given to the consequences of such location on the present and future urban environment. These three criteria - demand, cost and urban impacts must be included in the evaluation of terminal location. It is concluded that a central location near the hub of the urban transit system is most desirable for main bus terminals. In the future, the importance of the central location will decline and a location on the transit system will become the most desirable. However, with the dispersion of urban patterns, it may be necessary, to add .suburban terminals which can best be located near major arterials and at points where suburban town centers should be encouraged. / Applied Science, Faculty of / Community and Regional Planning (SCARP), School of / Graduate

Aujourd'hui, le transport est devenu indispensable dans la vie quotidienne. Cependant, la congestion du trafic du fait de la forte urbanisation et de l'augmentation rapide du nombre de véhicules a réduit l'efficacité du système de transport et a causé d'énorme pollution urbaine. Dans ce contexte, pour répondre aux besoins spécifiques de transport et améliorer la performance des systèmes de transport, la réservation de voie, en tant que stratégie de gestion du trafic flexible, a été largement mise en oeuvre. La majorité des études existantes sur la réservation de voie se focalisent au niveau microscopique, par exemple, un segment de route principale. Dans cette thèse, nous nous concentrons sur la réservation optimale des voies dans un réseau de transport au niveau macroscopique en minimisant son impact négatif pour deux catégories de problèmes. Nous étudions d'abord des problèmes de réservation robuste de voie et de grande taille pour les futurs poids lourds intelligents et les grands événements spéciaux. Ensuite, nous étudions la réservation de voie dans le but d'améliorer la performance du transport public avec des hypothèses spécifiques. Pour chaque problème étudié dans cette thèse, des modèles appropriés sont construits et leurs complexités sont analysées. Différentes approches de résolution sont élaborées en fonction des caractéristiques des problèmes, à savoir : une méthode exacte à deux phases, une méthode de epsilon-contrainte, une méthode de "cut-and-solve", et une méthode de "kernel search". La performance des algorithmes proposés est évaluée à l'aide de benchmarks et d'instances générées aléatoirement. Les expériences numériques montrent que les algorithmes proposés sont plus performants que les algorithmes existant dans la littérature et le progiciel commercial CPLEX. / Nowadays, transportation has become an indispensable part in modern life. However, heavy traffic congestion due to high urbanization and rapid increase of vehicles has caused low transportation efficiency and huge amounts of urban pollution. In this context, to meet special transportation requirements and improve the performance of transportation systems, lane reservation, as a flexible and economic traffic management strategy, has been widely implemented in real life. The majority of studies about lane reservation in the literature focus on the impact at a microscope level, e.g., a single link or corridor.In this thesis, we focus on optimally reserving lanes at a macroscopic network level with the objective of minimizing negative impact for two categories of problems. We firstly investigate the large-size and robust lane reservation problems in the contexts of future automated truck freight transportation and large-scale special events. Then, we study lane reservation for improving the performance of bus transit system under different assumptions. For all problems studied in this thesis, appropriate models are provided and their complexities are analyzed. Different resolution approaches are developed according to the characteristics of problems, including exact two-phase method, exact epsilon-constraint based method, cut-and-solve method, and kernel search method. The performance of the proposed algorithms is evaluated by benchmark and randomly generated instances. Extensive numerical experiments show the proposed algorithms outperform the state-of-the-art algorithms and the commercial software CPLEX.

Thesis (Ph.D.)--University of Adelaide, Dept. of Mathematics, 1967. / Typescript. Includes bibliographical references.