Thesis (M. Phil.)--University of Hong Kong, 1997. / Includes bibliographical references (leaf 95-102).

In multi-modal transit networks with several intersecting lines and modes, travel through the network typically requires one or more transfers among transit lines and modes, and as such transfer time is a significant component of transit travel time from the perspective of passengers. Accordingly, efficient transfers are very important to increase the attractiveness and productivity of transit service. This study presents two approaches for the provision of efficient transfers: schedule coordination and real-time CP (Connection Protection) control. The coordination of transit schedules can reduce transfer time significantly. This dissertation develops an optimization model for generating transit timetables that minimize transfer-related times. The model attempts to find an optimal timetable by shifting the existing timetable and/or adding holding time to the timetable to minimize delays associated with transfers from a feeder route to a receiving route. Analytical models are developed to estimate the waiting time of the transfer passengers, and also to determine the influence of the schedule modification on the waiting times of non-transfer passengers. The developed model is evaluated through a case study, and the results show that the model reduces effectively the total transfer and waiting times through the modification of the current schedule. However, even though timetables among intersecting lines may be properly coordinated, an operational control method is necessary to maintain coordinated transfers, which may occasionally be disrupted due to unexpected delays of transit vehicles. A promising approach is to utilize real-time CP control. It involves holding a transit unit in order to wait for another transit unit that is planned to provide a coordinated transfer but has been delayed. This study also develops a CP model to apply a holding control to a receiving run in order to protect the scheduled connection. It incorporates the probabilistic nature of transit operations in formulating a cost function, and accordingly makes more robust decisions for control. The developed model is evaluated and compared with previous models to demonstrate its ability to improve transfer efficiency and reduce the waiting times of affected passengers.

In multi-modal transit networks with several intersecting lines and modes, travel through the network typically requires one or more transfers among transit lines and modes, and as such transfer time is a significant component of transit travel time from the perspective of passengers. Accordingly, efficient transfers are very important to increase the attractiveness and productivity of transit service. This study presents two approaches for the provision of efficient transfers: schedule coordination and real-time CP (Connection Protection) control. The coordination of transit schedules can reduce transfer time significantly. This dissertation develops an optimization model for generating transit timetables that minimize transfer-related times. The model attempts to find an optimal timetable by shifting the existing timetable and/or adding holding time to the timetable to minimize delays associated with transfers from a feeder route to a receiving route. Analytical models are developed to estimate the waiting time of the transfer passengers, and also to determine the influence of the schedule modification on the waiting times of non-transfer passengers. The developed model is evaluated through a case study, and the results show that the model reduces effectively the total transfer and waiting times through the modification of the current schedule. However, even though timetables among intersecting lines may be properly coordinated, an operational control method is necessary to maintain coordinated transfers, which may occasionally be disrupted due to unexpected delays of transit vehicles. A promising approach is to utilize real-time CP control. It involves holding a transit unit in order to wait for another transit unit that is planned to provide a coordinated transfer but has been delayed. This study also develops a CP model to apply a holding control to a receiving run in order to protect the scheduled connection. It incorporates the probabilistic nature of transit operations in formulating a cost function, and accordingly makes more robust decisions for control. The developed model is evaluated and compared with previous models to demonstrate its ability to improve transfer efficiency and reduce the waiting times of affected passengers.

Diss. Umeå : Univ., 2003.

Dans le cadre de la synthèse de haut niveau (SHN), qui permet d'extraire un modèle structural à partir d'un modèle algorithmique, nous proposons des solutions pour opti- miser l'accès et le transfert de données du matériel cible. Une méthodologie d'exploration de l'espace des architectures mémoire possibles a été mise au point. Cette méthodologie trouve un compromis entre la quantité de mémoire interne utilisée et les performances temporelles du matériel généré. Deux niveau d'optimisation existe : 1. Une optimisation architecturale, qui consiste à créer une hiérarchie mémoire, 2. Une optimisation algorithmique, qui consiste à partitionner la totalité des données manipulées pour stocker en interne seulement celles qui sont utiles dans l'immédiat. Pour chaque répartition possible, nous résolvons le problème de l'ordonnancement des calculs et de mapping des données. À la fin, nous choisissons la ou les solutions pareto. Nous proposons un outil, front-end de la SHN, qui est capable d'appliquer l'optimisation algorithmique du point 2 à un algorithme de traitement d'image spécifié par l'utilisateur. L'outil produit en sortie un modèle algorithmique optimisé pour la SHN, en customisant une architecture générique.