Dissertations / Theses on the topic 'Timetable optimization'

The aim of the thesis is to create a model of timetable for primary school for all teachers and classes so that the timetable is in compliance with all teaching plans, the conditions of the Ministry of Education, Youth and Sports (general education program), the school's needs and requirements of teachers. The timetable is created for a particular school, ZŠ nám. Svobody in Prague. The first part of the thesis is focused on the theoretical description of methods and procedures for dealing with the problem of timetable. The second part describes the elementary school, for which the timetable is made, it's classes, teachers and conditions of the tuition. It is also formulated and described a mathematical model of the problem that is solved by using the program Lingo.

Este trabalho tem como objetivo solucionar problemas complexos em diferentes segmentos da Engenharia de Produção e Transporte a partir da utilização de técnicas de otimização. São consideradas as áreas de sistemas de saúde, transportes e análise sensorial, envolvendo problemas de formação de grade de horários e análise de clusters. De forma específica, as abordagens objetivam: (i) em relação ao setor hospitalar, alocar especialidades cirúrgicas em uma grade de horários de um hospital de modo a minimizar a variância do tempo pós-operatório; (ii) quanto à análise sensorial, desenvolver um índice capaz de identificar painelistas que necessitam de treinamento utilizando conceitos de análise de clusters; (iii) no setor aeroportuário, identificar aeroportos com baixa capacidade preditiva de demanda e relacioná-los com suas características físicas, a partir da análise de clusters. Em todos os problemas abordados, as soluções envolvendo métodos de otimização se mostraram adequadas, com resultados satisfatórios.
This study aims to solve complex problems in different segments of Production Engineering and Transportation using optimization techniques. Different areas are considered, such as the areas of health systems, transport and sensory analysis, involving the timetable scheduling problem and cluster analysis. Specifically, this works aims to: (i) in relation to the hospital sector, allocate surgical specialties in a timetable in order to minimize the variance of postoperative time; (ii) for the sensory analysis, develop an index able to identify panelists who require training, using concepts of cluster analysis; (iii) in the airport sector, identify airports with low predictive capacity of demand and relate them to their physical characteristics, using cluster analysis. In all addressed problems, solutions involving optimization methods were adequate, with satisfactory results.

This thesis has focused on an aircraft schedule and network design problem that involves multiple types of aircraft and flight service. First, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. Then, this thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch. After developing models in the three steps and creating large-scale instances of these models, this dissertation develops iterative algorithms and subproblem approaches to solving these instances, and it presents computational results of these large-scale instances. To validate the models and solution algorithms developed, this thesis compares the daily flight schedules that it designed with the schedules of the existing airlines. In addition, it discusses the implication of using new aircraft in the future flight schedules. Finally, future research in three areas--model, computational method, and simulation for validation--is proposed.

This master thesis deals with the automatic design of examinations and courses scheduling. The design is adapted to the specific requirements of the Faculty of Information Technology of Brno University of Technology. A genetic algorithm and a heuristic algorithm are employed to solve this task. The genetic algorithm is used to specify the sequence of the examinations (or the courses) and then the heuristic algorithm spread them out into a timetable. An implementation (written in Python 3) provides a fast parallel processing calculation which can generate satisfactory schedules in tens of minutes. Performed experiments show approximately 13% better results in all considered criteria in comparison with utilized examination schedules in the past. The development was periodically consulted with persons responsible for the schedule processing at the faculty. The program will be used while designing of examination schedules for the academic year 2015/2016.

The timetable is an essential part for the operations of railway traffic, and its quality is considered to have large impact on capacity utilization and reliability of the transport mode. The process of generating a timetable is most often a manual task with limited computer aid, and is known to be a complex planning problem due to inter-train dependencies. These inter-train dependencies makes it hard to manually generate feasible timetables, and also makes it hard to improve a given timetable as new conflicts and surprising effects easily can occur. As the demand for railway traffic is expected to continue grow, higher frequencies and more saturated timetables are required. However, in many European countries there is also an on-going public debate on the punctuality of the railway, which may worsen by increased capacity utilization. It is therefore also a need to increase the robustness of the services. This calls for increased precision of both the planning and the operation, which can be achieved with a higher degree of automation. The research in this thesis is aimed at improving the robustness of railway timetables by combining micro-simulation with mathematical optimization, two methods that today are used frequently by practitioners and researchers but rarely in combination. In this research a sequential approach based on simulating a given timetable and re-optimizing it to reduce the weighted sum of scheduled travel time and predicted average delay is proposed. The approach has generated promising results in simulation studies, in which it has been possible to substantially improve the punctuality and reduce the average delays by only increasing the advertised travel times slightly. Further, the results have also indicated a positive socio-economic benefit. This demonstrates the methods potential usefulness and motivates further research.
För järnvägen har tidtabellen en central roll, och dess kvalité har stor betydelse för kapacitet och tillförlitlighet. Processen att konstruera en tidtabell är ofta en uppgift som utförs manuellt med begränsat datorstöd och på grund av beroenden mellan enskilda tåg är det ofta ett tidskrävande och svårt arbete. Dessa tågberoenden gör det svårt att manuellt konstruera konfliktfria tidtabeller samtidigt som det också är svårt att manuellt förbättra en given tidtabell, vilket beror på att de är svårt att förutsäga vad effekten av en given ändring blir. Eftersom efterfrågan på järnväg fortsatt förväntas öka, finns det ett behov av att kunna köra fler tåg. Samtidigt pågår det redan i många europeiska länder en offentlig debatt om järnvägen punktlighet, vilken riskeras att försämras vid högre kapacitetsanvändning. Därför finns det även ett behov av att förbättra tidtabellernas robusthet, där robusthet syftar till en tidtabells möjlighet att stå emot och återhämta mindre förseningar. För att hantera denna målkonflikt kommer det behövas ökad precision vid både planering och drift, vilket kan uppnås med en högre grad av automation. Forskningen i denna avhandling syftar till att förbättra robustheten för tågtidtabeller genom att kombinera mikro-simulering med matematisk optimering, två metoder som redan används i hög grad av både yrkesverksamma trafikplanerare och forskare men som sällan kombineras. I den här avhandlingen förslås en sekventiell metod baserad på att simulera en given tidtabell och optimera den för att minska den viktade summan av planerad restid och predikterad medelförsening. Metoden har visat på lovande resultat i simuleringsstudier, där det har varit möjligt att uppnå en väsentligt bättre punktlighet och minskad medelförsening, genom att endast förlänga de planerade restiderna marginellt. Även förbättrad samhällsekonomisk nytta har observerats av att tillämpa den föreslagna metoden. Sammantaget visar detta metodens potentiella nytta och motiverar även fortsatt forskning.

QC 20191112

With increase in the use of railway transport, ensuring robustness in railway timetables has never been this important. In a dense railway timetable even a small disturbance can propagate easily and affect trains' arrival and departure times. In a robust timetable small delays are absorbed and knock-on effects are prevented effectively. The aim of this thesis is to study how optimization tools can support the generation of robust railway traffic timetables. We address two Train Timetabling Problems (TTP) and for both problems we apply Mixed Integer Linear Programming (MILP) to solve them from network management perspectives. The first problem is how robustness in a given timetable can be assessed and ensured. To tackle this problem, a headway-based method is introduced. The proposed method is implemented in real timetables and evaluated from performance perspectives. Furthermore, the impact of the proposed method on capacity utilization, heterogeneity and the speed of trains, is monitored. Results show that the proposed method can improve robustness without imposing major changes in timetables. The second problem addressed in the thesis is how robustness can be assessed and maintained in a given timetable when allocating additional traffic and maintenance slots. Different insertion strategies are studied and their consequences on capacity utilization and on the properties of the timetables are analyzed. Two different insertion strategies are considered: i) simultaneous and ii) stepwise insertion. The results show that inserting the additional trains simultaneously usually results in generating more optimal solutions. However, solving this type of problem is computationally challenging. We also observed that the existing robustness metrics cannot capture the essential properties of having more robust timetables. Therefore we proposed measuring Channel Width, Channel Width Forward, Channel Width Behind and Track Switching. Furthermore, the experimental analysis of the applied MILP model shows that some cases are computationally hard to solve and there is a need to decrease the computation time. Hence several valid inequalities are developed and their effects on the computation time are analyzed. This thesis contains three papers which are appended. The results of this thesis are of special interests for railway traffic planners and it would support their working process. However, railway traffic operators and passengers also benefit from this study.

La régulation ferroviaire sur de vastes zones est un problème complexe. Elle intervient dans la phase opérationnelle de la production. Son rôle consiste à trouver de nouvelles solutions en termes de planification des mouvements de trains suite à l'apparition d'un incident empêchant la réalisation normale du plan de transport préétabli dans les phases amont de la production.La contribution de ce travail s'organise autour de trois axes.Le premier consiste à définir une formalisation exhaustive du système ferroviaire, associé à une représentation plus cohérente (modèle multiniveau).Le deuxième axe s'articule autour de l'étude des modèles mathématiques pour la régulation du trafic ferroviaire: évolutions d'un modèle en temps continu complet (espacements dynamiques), proposition d'un modèle innovant à temps discret et d'un modèle mixte (continu-discret) adossé au modèle multiniveau.Enfin, le dernier axe traite de la mise en oeuvre concrète au niveau industriel, en particulier des gains attendus du couplage avec un outil de simulation
On-line re-scheduling of trains aims to find accurate solutions after an incident has occurred on the railway network. When we consider a large area, solutions consist in calculating new timetables, sequences and routes of trains. This problem asks for decision support tools based on operational research techniques.This thesis aims to develop solutions toward an operational tool, it articulates around three main parts. The first part defines an exhaustive model of the railway system operations and a multiscalable description of the infrastructure.The second part presents three mathematical models of the rescheduling problem associated with this description. We preset a exhaustive continuous time based model including headways that take into account speeds of trains, plus a discrete time based model and an hybrid model combining both formulations.The last part describes first implementations and the global framework we need to develop in order to solve the real world problem. It emphases on expected synergies, specilaly between simulation and optimization techniques

La conception d’un plan de transport d’un service ferroviaire est un processus qui se réalise entre deux ans et six mois avant la mise en service de celui-ci. Les principales phases de la conception sont la définition des dessertes, le calcul de la grille horaire et enfin l’organisation des roulements de rames et des conducteurs. La manière dont le plan de transport est conçu peut avoir de nombreuses conséquences sur la qualité de service : fréquence en gare insuffisante qui peut entrainer une perte de clients, robustesse de la grille horaire face à de petits incidents... En zone dense, tous ces éléments sont à prendre en compte, dès la conception de la grille horaire.Aujourd’hui, SNCF Transilien conçoit ses plans de transport en prenant d’abord en compte l’optimisation des ressources de production (sillons, rames et agents de conduite). Toutefois, l’augmentation des ressources mises en œuvre n’améliore plus l’adéquation du plan de transport à la demande des voyageurs. Ce mode de conception ne permet donc plus de faire face à l’augmentation de la demande de mobilité. C’est pourquoi il faut repenser la conception du plan de transport en intégrant immédiatement la dimension voyageuse.Nos travaux se concentrent sur les problématiques de conception de dessertes et de grille horaire, en prenant en compte le point de vue des voyageurs. Nous présentons un modèle multiobjectif de conception de dessertes, puis nous présentons un modèle de conception de grille horaire intégrant le choix d’itinéraire des voyageurs. Ensuite, nous présentons une méthode cherchant à intégrer ces deux modèles. Enfin, nous présentons une évaluation de nos résultats grâce à des indicateurs de fiabilité
The design of a railway transportation plan is a process achieved between two years and six months before it is put into service. The main phases in the design of a transportation plan are the line planning, the timetabling, the rolling stock and the crew scheduling.The design of the transportation plan can have many consequences on the quality of service: an inadequate frequency in station can cause a loss of passengers, sufficient number of seated places, robustness of the timetable in the face of small incidents... In dense area, as in the Ile-de-France region, all these elements must be taken into account as the transportation plan is designed.Today, SNCF Transilien designs its transportation plans by first taking into account the optimization of production resources (train paths, rolling stock units and drivers). However, today, the increase in resources implemented no longer improves the adequacy of the transportation plan to passengers’ demand. This design method no longer makes it possible to cope with the increase in the demand for mobility (+3% each year since 2000). This is why we must rethink the design of the transport plan by immediately integrating the passenger dimension. Our work focuses on issues of line planning and timetabling in a passenger-oriented approach. First, we present a multi-objective model for line planning. Then, we present a model of timetabling incorporating passenger route choice. Then, we initiate a method to integrate these two models. Finally, we present an evaluation of our results thanks to reliability indicators from the literature and a macroscopic simulation of the timetables

The examination scheduling problem is a difficult problem with NP-hard complexity and several methods for heuristically solving it have been developed over the past decades. This thesis investigates the casting of examination timetables with tabu search techniques, the combination of the move or transition recency based short-term memory and move frequency based longer-term memory and several tabu search variations such as solution restructuring, tabu relaxation, and alternating neighborhoods. By integrating the tabu techniques mentioned above, a multi-phase system OTTASYS has been implemented and tested on several sets of real data. It is shown here that the quality of the solutions obtained compare favourably with other published algorithms when presented with the same data. As the engine of the system, the algorithm OTTABU is proven powerful and productive and also can be used as a platform for further research.

Submitted by Raildo Barros Rodrigues (raildo.barros@gmail.com) on 2018-09-24T15:10:31Z No. of bitstreams: 1 Dissertação_Grade_Horária_Raildo_Marins_Aneirson.pdf: 2926580 bytes, checksum: 6799724ac48abd21caecd50cf5156480 (MD5)
Rejected by Pamella Benevides Gonçalves null (pamella@feg.unesp.br), reason: Solicitamos que realize correções na submissão seguindo as orientações abaixo Verificar formatação com a equipe da biblioteca. Agradecemos a compreensão. on 2018-09-24T18:49:58Z (GMT)
Submitted by Raildo Barros Rodrigues (raildo.barros@gmail.com) on 2018-09-25T16:48:30Z No. of bitstreams: 2 Dissertação_Grade_Horária_Raildo_Marins_Aneirson.pdf: 2926580 bytes, checksum: 6799724ac48abd21caecd50cf5156480 (MD5) Dissertação_Grade_Horária_Raildo_Marins_Aneirson.pdf: 2944631 bytes, checksum: d0f33c161c9cb711a7b75cd2666f0470 (MD5)
Approved for entry into archive by Pamella Benevides Gonçalves null (pamella@feg.unesp.br) on 2018-09-25T18:15:24Z (GMT) No. of bitstreams: 1 rodrigues_rb_me_guara.pdf: 2944631 bytes, checksum: d0f33c161c9cb711a7b75cd2666f0470 (MD5)
Made available in DSpace on 2018-09-25T18:15:24Z (GMT). No. of bitstreams: 1 rodrigues_rb_me_guara.pdf: 2944631 bytes, checksum: d0f33c161c9cb711a7b75cd2666f0470 (MD5) Previous issue date: 2018-09-20
Outra
Esta dissertação trata da construção de um modelo matemático para a elaboração do quadro de horários dos cursos de graduação do CBV/IFRR. A programação de horários é um problema de otimização combinatória estudado há anos pela Pesquisa Operacional e, em termos de complexidade computacional, é tido como NP-Completo, sendo assim, é um problema que exige grande capacidade de processamento. A elaboração do quadro de horários em qualquer instituição de ensino é complexa e demanda tempo para os responsáveis por essa atividade, pois as necessidades dos professores e alunos devem ser atendidas e devem-se evitar conflitos nos horários dos professores. A instituição estudada nesta dissertação assim como outras instituições, possui particularidades institucionais, dessa forma, uma formulação geral do problema acaba não lhe sendo útil. O CBV/IFRR realiza a elaboração dos horários de forma manual, por meio de planilha eletrônica e realização de reuniões entre os gestores, o que torna difícil encontrar uma solução factível. Sendo assim, foi necessária a realização de pesquisa científica para encontrar métodos que poderiam ser aplicados ao problema. Assim, este trabalho teve como objetivo desenvolver um modelo de Programação Matemática que permitisse a elaboração dos horários para cursos de graduação do CBV/IFRR. Utilizou-se entrevistas com as Coordenações de Cursos para obtenção das informações acerca do problema tratado, tais como restrições e prioridades a serem atendidas com a programação de aulas para professores. Estas informações serviram de base para a construção do modelo conceitual, que foi utilizado para elaboração do modelo matemático final, que foi implementado na linguagem de alto nível GAMS® e resolvido pelo solver CPLEX®. Os testes do modelo foram realizados otimizando uma instância com dados reais da instituição estudada. Os resultados obtidos da otimização foram satisfatórios, pois foi possível encontrar uma solução ótima para a instância em tempo computacional adequado, com todas as restrições, impostas pelas características peculiares do problema tratado, sendo respeitadas e as prioridades estabelecidas pelas Coordenações de Cursos atendidas.
This dissertation deals with the construction of a mathematical model for the elaboration of the timetable of the undergraduate courses of the CBV/IFRR. Time scheduling is a combinatorial optimization problem that has been studied for years by Operational Research and, in terms of computational complexity, is considered as NP-Complete, so it is a problem that requires large processing capacity. The elaboration of the timetable in any educational institution is complex and takes time for those responsible for this activity, because the needs of teachers and students must be met and avoid conflicts in the schedules of teachers. The institution studied in this dissertation as well as other institutions, has institutional features, so a general formulation of the problem ends up being of no use to it. The CBV/IFRR performs the elaboration of the schedules manually, through a spreadsheet and holding meetings between managers, which makes it difficult to find a feasible solution. Thus, it was necessary to carry out scientific research to find methods that could be applied to the problem. Thus, this work had the objective of developing a Mathematical Programming model that allowed the elaboration of the schedules for the undergraduate courses of the CBV/IFRR. We used interviews with the Course Coordinators to obtain information about the problem, such as constraints and priorities to be met with the programming of classes for teachers. This information was the basis for the construction of the conceptual model, which was used to elaborate the final mathematical model, which was implemented in the GAMS® high-level language and solved by the CPLEX® solver. The tests of the model were performed optimizing an instance with real data of the studied institution. The results obtained from the optimization were satisfactory, since it was possible to find an optimal solution for the instance in adequate computational time, with all the restrictions imposed by the peculiar characteristics of the problem, being respected and the priorities established by the Coordination of Courses attended.

Transit agencies include buffer time in their schedules to maintain stable headways and avoid bus bunching. In this work, a real-time holding mechanism is proposed to dispatch buses on a loop-shaped route, solely based on operating conditions in real-time. Holds are applied at the terminal station to minimize the expected variance of bus headways at departure. The bus-dispatching problem is formulated as a stochastic decision process. The optimality equations are derived and structural properties of the optimal policy are inferred by backward induction. The exact optimal holding policy is then found in closed form, as a function of the expected travel time of buses currently running. A simulation assuming stochastic operating conditions and unstable headway dynamics is performed to assess the expected average waiting time of passengers at stations. The proposed control strategy is found to provide lower passenger waiting time and better resiliency than methods recommended in the literature and used in practice.

碩士
國立高雄應用科技大學
電子工程系
98
In a timetable scheduling problem, examination subjects must be slotted to certain times so as to avoid conflicting as well as meet some specific requirements. They are combinatorial optimization problems and exactly NP-Complete. Modern optimization methods have emerged. Tremendous efforts have been made in dealing with these problems in recent years. Methods and techniques such as Genetic Algorithms, Tabu Search techniques, Particle Swarm Optimization, and Neural Networks have been applied in tackling these problems. Ant Colony System, as a randomized search and optimization technique, suited for these problems. In this paper, a seriously design of an automatic problem solver for these problem based on Ant Colony System methods has been proposed and tested. Both of the theoretical analysis and experimental results showed the feasibility and efficiency of proposed approach.

碩士
國立成功大學
交通管理學系碩博士班
99
Nowadays, many metropolitans have a convenient subway or MRT network system by which people can travel to their destinations through transferring between different lines. However, passengers would not like to spend too much time on waiting or transferring, especially for the case of “just miss” which may decrease service quality and custom satisfaction. Therefore, trying to arrange feeder and connecting trains for proper transfer, and to reduce waiting time, is a critical issue for operators. This research designed a timetable planning model for minimized transfer waiting time based on real operating data of Kaohsiung MRT system with two lines of red and orange. Transfer related analyses in past literatures mostly focus only on transfer station itself, so in this research, train operation planning on each segment of lines in whole network would be considered. Besides, for operators, some adjustments such as headway reducing for better transfer service could cause more costs. Therefore, this study would apply terminal restrictions for train cost calculating to find the trade-off between passengers’ time and operator’s cost. Finally, the model is also used to analyze suitable transfer arrangement under different situations of trip demands, network types and station configurations. The findings from this transfer optimizing model could be generally applied to relative railway service operations as some suggestions for transfer improvements in the future. The model solution indicates better improvements than current timetable used in Kaohsiung MRT system. The total transfer waiting time has around 35% savings in peak-hour periods, and almost 60% in off-peak hours. While considering the trade-off between passengers’ time value and operator’s cost, reducing headway from 5 to 4 minutes in peak hours and from 10 to 8 minutes in off-peak hours is suggested. Also, making the headway differences between red line and orange line smaller is better for passengers transferring between these two lines without waiting too long. Then the model is solved under different situations of transferring trip demands, route network and transfer station configuration design types. Situation analysis results show that trains running on sections or directions with larger transferring demand could be adjusted with lower running speed or longer stopping times at stations to make train connections smoother when arriving at transfer stations. Furthermore, train departure time at terminal stations of each line should be arranged with differences subject to kinds of route network types. The configuration and walking passageways design in transfer stations, which is relevant to passenger transfer walking time variations, should also be taken into consideration when planning the train timetable. In brief, train timetable with appropriate arrangements according to varieties of conditions could provide smoother connection between different trains of each line and better transfer services.

碩士
華梵大學
資訊管理學系碩士班
91
Timetable scheduling is a kind of problems, encountered in many domains and scheduling methods have wide range of applications. Prior researches mainly focus on how to find a scheduling solution that minimizes the requirement of total costs or human resources. This research tries to examine the scheduling problem from a different perspective by adding another dimension: to optimize the schedule for considering the preference of the people being scheduled. In general, the scheduling problem can be divided into two stages. In first stage, a timetable is arranges to maximum the satisfaction of the requirement under the resource limitation. The second stage then proceeds to arrange the working schedule of each worker with a goal optimizing their satisfaction levels. In order to find feasible and acceptable optimal solutions within a reasonable time, genetic algorithms (GAs) are employed as the search mechanism to explore in the problem space. For the implementation part of this study, we use the course scheduling of a university as an example. From the viewpoint of instructors, we aim to find a course schedule that meets all the constraints imposed by available resources and maximizes the satisfaction levels of instructors. In terms of practical applications, we think this study can be extended to many types of scheduling problems with dissimilar constraints. The results show that our model can search for the optimal working hours that are based on the preferences of the people being scheduled, and the scheduling solution is fair to most people.

L’oggetto dello studio è stato il recupero di energia disponibile durante la frenatura dei veicoli dei sistemi ferroviari a trazione elettrica e ad alta densità di traffico. Il tema è stato affrontato dal punto di vista teorico, a partire dall’applicazione delle leggi del moto, e dal punto di vista sperimentale, effettuando misure su veicoli in esercizio sulla linea A della Metropolitana di Roma nell’ambito di una convenzione di ricerca tra ATAC e DICEA. Inoltre sono state sviluppate specifiche simulazioni in ambiente RoMan/MatLab per esaminare gli assorbimenti di una linea ferroviaria regionale a carattere suburbano e in particolare sulla linea FL3 nella tratta La Storta – Valle Aurelia. L’obiettivo è stato quello di quantificare l’energia recuperata in relazione alla programmazione dell’orario e verificarne la correlazione con delle variazioni imposte alle tracce dei treni simulati. I risultati mostrano come, in un’applicazione seppur locale del metodo proposto, sia possibile un incremento dell’indice temporale di recupero dell’energia tra treno e treno di circa il 10%.

La conception d’un plan de transport d’un service ferroviaire est un processus qui se réalise entre deux ans et six mois avant la mise en service de celui-ci. Les principales phases de la conception sont la définition des dessertes, le calcul de la grille horaire et enfin l’organisation des roulements de rames et des conducteurs. La manière dont le plan de transport est conçu peut avoir de nombreuses conséquences sur la qualité de service : fréquence en gare insuffisante qui peut entrainer une perte de clients, robustesse de la grille horaire face à de petits incidents... En zone dense, tous ces éléments sont à prendre en compte, dès la conception de la grille horaire.Aujourd’hui, SNCF Transilien conçoit ses plans de transport en prenant d’abord en compte l’optimisation des ressources de production (sillons, rames et agents de conduite). Toutefois, l’augmentation des ressources mises en œuvre n’améliore plus l’adéquation du plan de transport à la demande des voyageurs. Ce mode de conception ne permet donc plus de faire face à l’augmentation de la demande de mobilité. C’est pourquoi il faut repenser la conception du plan de transport en intégrant immédiatement la dimension voyageuse.Nos travaux se concentrent sur les problématiques de conception de dessertes et de grille horaire, en prenant en compte le point de vue des voyageurs. Nous présentons un modèle multiobjectif de conception de dessertes, puis nous présentons un modèle de conception de grille horaire intégrant le choix d’itinéraire des voyageurs. Ensuite, nous présentons une méthode cherchant à intégrer ces deux modèles. Enfin, nous présentons une évaluation de nos résultats grâce à des indicateurs de fiabilité
The design of a railway transportation plan is a process achieved between two years and six months before it is put into service. The main phases in the design of a transportation plan are the line planning, the timetabling, the rolling stock and the crew scheduling.The design of the transportation plan can have many consequences on the quality of service: an inadequate frequency in station can cause a loss of passengers, sufficient number of seated places, robustness of the timetable in the face of small incidents... In dense area, as in the Ile-de-France region, all these elements must be taken into account as the transportation plan is designed.Today, SNCF Transilien designs its transportation plans by first taking into account the optimization of production resources (train paths, rolling stock units and drivers). However, today, the increase in resources implemented no longer improves the adequacy of the transportation plan to passengers’ demand. This design method no longer makes it possible to cope with the increase in the demand for mobility (+3% each year since 2000). This is why we must rethink the design of the transport plan by immediately integrating the passenger dimension. Our work focuses on issues of line planning and timetabling in a passenger-oriented approach. First, we present a multi-objective model for line planning. Then, we present a model of timetabling incorporating passenger route choice. Then, we initiate a method to integrate these two models. Finally, we present an evaluation of our results thanks to reliability indicators from the literature and a macroscopic simulation of the timetables

博士
國立中央大學
土木工程學系
102
As more and more governments are planning or constructing high-speed rail (HSR) systems, the central control mechanism of such systems, i.e., train timetables, should be investigated more in order to cope with various disturbances due to a disaster. Several optimization-based approaches have been successfully utilized for generating stable and reliable train timetables; however, few researchers have considered train circulation issues, especially for HSR systems, even though it could be such a way to reschedule the timetable against disturbances. This research proposed a scheduling optimization model that has the capability to accommodate not only basic requirements but train circulation as well for Taiwan HSR system. The intelligent agent technology was integrated with the optimization model proposed, so that the communication between train drivers, the control center, and the depot managers can be formalized and managed. Actions that can be taken to mitigate the impact of a disaster can be predicted. With proper enhancement, the proposed model could be a good simulation tool to help predict the effect of disruptions on the timetable without doing real experiments. Key words: Timetables; Trainset utilization; Timetable correction; Timetable fluctuation; Timetable crossover; Train headway; Auto train route setting; Notch; Optimization; Intelligent agents.