Academic literature on the topic 'Timetable optimization'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Timetable optimization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Timetable optimization"

1

Yusop, Noorrezam. "A Systematic Literature Review: Optimization Timetable in Education to Support Work-Life Balance (WLB)." Journal of Computing Research and Innovation 7, no. 2 (September 30, 2022): 316–26. http://dx.doi.org/10.24191/jcrinn.v7i2.324.

Full text
Abstract:
Scheduling academic staff timetables is crucial and necessary to avoid redundancy and clash of class between teacher and student timetables. A good timetable allows students and teachers to manage their time and support a good and healthy lifestyle. However, with the scheduling, academic staff timetable may use many procedures to get efficient results. Therefore, this paper provides a gap of study for existing work on Optimization Timetable to support Work-Life Balance (WLB) regarding their market commercial and research purposes. The methodology of this study was conducted using a Systematic Literature Review (SLR). Result: two findings investigate 1) relevant optimization timetable scheduling used and 2) the method for timetable optimization to support WLB. The strengths and weaknesses of the features and utilities behind each study are also presented to provide a further understanding of the gaps and weaknesses of each body of research. We conclude that these studies are still insufficient and require further evaluation and improvement.
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Dingjun, Sihan Li, Junjie Li, Shaoquan Ni, and Xiaolong Liu. "Optimal High-Speed Railway Timetable by Stop Schedule Adjustment for Energy-Saving." Journal of Advanced Transportation 2019 (December 8, 2019): 1–9. http://dx.doi.org/10.1155/2019/4213095.

Full text
Abstract:
Timetable optimization techniques offer opportunity for saving energy and hence reducing operational costs for high-speed rail services. The existing energy-saving timetable optimization is mainly concentrated on the train running state adjustment and the running time redistribution between two stations. Not only the adjustment space of timetables is limited, but also it is hard for the train to reach the optimized running state in reality, and it is difficult to get feasible timetable with running time redistribution between two stations for energy-saving. This paper presents a high-speed railway energy-saving timetable based on stop schedule optimization. Under the constraints of safety interval and stop rate, with the objective of minimizing the increasing energy consumption of train stops and the shortest travel time of trains, the high-speed railway energy-saving timetable optimization model is established. The fuzzy mathematics programming method is used to design an efficient algorithm. The proposed model and algorithm are demonstrated in the actual operation data of Beijing-Shanghai high-speed railway. The results show that the total operating energy consumption of the train is reduced by 3.7%, and the total travel time of the train is reduced by 11 minutes.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Renjie, Shisong Yin, Mao Ye, Zhiqiang Yang, and Shanglu He. "A Timetable Optimization Model for Urban Rail Transit with Express/Local Mode." Journal of Advanced Transportation 2021 (April 19, 2021): 1–15. http://dx.doi.org/10.1155/2021/5589185.

Full text
Abstract:
Nowadays, an express/local mode has be studied and applied in the operation of urban rail transit, and it has been proved to be beneficial for the long-distance travel. The optimization of train patterns and timetables is vital in the application of the express/local mode. The former one has been widely discussed in the various existing works, while the study on the timetable optimization is limited. In this study, a timetable optimization model is proposed by minimizing the total passenger waiting time at platforms. Further, a genetic algorithm is used to solve the minimization problems in the model. This study uses the data collected from Guangzhou Metro Line 14 and finds that the total passenger waiting time at platforms is reduced by 9.3%. The results indicate that the proposed model can reduce the passenger waiting time and improve passenger service compared with the traditional timetable.
APA, Harvard, Vancouver, ISO, and other styles
4

Yuan, Yu, Pengcheng Wang, and Minghui Wang. "Multi-Objective Stochastic Synchronous Timetable Optimization Model Based on a Chance-Constrained Programming Method Combined with Augmented Epsilon Constraint Algorithm." Mathematical Problems in Engineering 2022 (August 28, 2022): 1–18. http://dx.doi.org/10.1155/2022/9222636.

Full text
Abstract:
The design of the timetable is essential to improve the service quality of the public transport system. A lot of random factors in the actual operation environment will affect the implementation of the synchronous timetable, and adjusting timetables to improve synchronization will break the order of normal service and increase the cost of operation. A multi-objective bus timetable optimization problem is characterized by considering the randomness of vehicle travel time and passenger transfer demand. A multi-objective optimization model is proposed, aiming at minimizing the total waiting time of passengers in the whole bus network and the inconsistency between the timetable after synchronous optimization and the original timetable. Through large sample analysis, it is found that the random variables in the model obey normal distribution, so the stochastic programming problem is transformed into the traditional deterministic programming problem by the chance-constrained programming method. A model solving method based on the augmented epsilon-constraint algorithm is designed. Examples show that when the random variables are considered, the proposed algorithm can obtain multiple high-quality Pareto optimal solutions in a short time, which can provide more practical benefits for decisionmakers. Ignoring the random influence will reduce the effectiveness of the schedule optimization scheme. Finally, sensitivity analysis of random variables and constraint confidence in the model is made.
APA, Harvard, Vancouver, ISO, and other styles
5

LEE, HSIN-YUN. "A DECISION SUPPORT SYSTEM FOR EXPOSITION TIMETABLING USING ANT COLONY OPTIMIZATION." International Journal of Information Technology & Decision Making 11, no. 03 (May 2012): 609–26. http://dx.doi.org/10.1142/s0219622012500137.

Full text
Abstract:
The exposition industry has developed rapidly in recent years. For exposition centers, exposition timetabling is a complicated problem. The timetables arranged by the administrators usually result in an imbalanced usage percentage between showgrounds and a low total usage percentage for all showgrounds. In this paper, we developed a decision support system that considers the characteristics of exposition timetabling. The proposed system applies ant colony optimization for determining the near-optimal timetable of expositions. The ants are grouped into teams representing multi-layer ant paths for priority ranking. This improvement allows us to classify candidate expositions with different time preferences. The showground timetabling of an exposition center is used to validate the proposed system. The timetable proposed by the decision support system ensures a higher efficiency and a higher total usage percentage of the showgrounds than the timetable proposed by a human expert.
APA, Harvard, Vancouver, ISO, and other styles
6

Takamatsu, Mizuyo, and Azuma Taguchi. "Bus Timetable Design to Ensure Smooth Transfers in Areas with Low-Frequency Public Transportation Services." Transportation Science 54, no. 5 (September 2020): 1238–50. http://dx.doi.org/10.1287/trsc.2019.0918.

Full text
Abstract:
This study investigates the timetable design problem in areas with low-frequency public transportation services. In Japan, rural areas face sparse populations and rapid growth in the percentage of elderly people. In these areas, many bus lines offer fewer than 10 services per day. In addition to low-frequency services, it is also inconvenient to transfer to another bus or train service. Thus, there is a strong need to design a timetable that ensures smooth transfers among buses and trains. We tackle this problem by adopting existing bus lines and train timetables as much as possible to avoid drastic changes such as an increase in the number of services. Based on this approach, we present a mathematical optimization model to generate a revised bus timetable that shortens waiting time for transfers compared with the current timetable. We apply our model to a part of the Tohoku District in Japan and demonstrate its usefulness in the real world.
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Guang, Junjie Wang, Feng Zhang, Shiwen Zhang, and Cheng Gong. "A Real-Time Timetable Rescheduling Method for Metro System Energy Optimization under Dwell-Time Disturbances." Journal of Advanced Transportation 2019 (December 2, 2019): 1–11. http://dx.doi.org/10.1155/2019/5174961.

Full text
Abstract:
Automatic Train Systems (ATSs) have attracted much attention in recent years. A reliable ATS can reschedule timetables adaptively and rapidly whenever a possible disturbance breaks the original timetable. Most research focuses the timetable rescheduling problem on minimizing the overall delay for trains or passengers. Few have been focusing on how to minimize the energy consumption when disturbances happen. In this paper, a real-time timetable rescheduling method (RTTRM) for energy optimization of metro systems has been proposed. The proposed method takes little time to recalculate a new schedule and gives proper solutions for all trains in the network immediately after a random disturbance happens, which avoids possible chain reactions that would attenuate the reuse of regenerative energy. The real-time feature and self-adaptability of the method are attributed to the combinational use of Genetic Algorithm (GA) and Deep Neural Network (DNN). The decision system for proposing solutions, which contains multiple DNN cells with same structures, is trained by GA results. RTTRM is upon the foundation of three models for metro networks: a control model, a timetable model and an energy model. Several numerical examples tested on Shanghai Metro Line 1 (SML1) validate the energy saving effects and real-time features of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Angyang, Xingchen Zhang, Junhua Chen, and Zhimei Wang. "Joint optimization of high-speed train timetables, speed levels and stop plans for increasing capacity based on a compressed multilayer space-time network." PLOS ONE 17, no. 3 (March 3, 2022): e0264835. http://dx.doi.org/10.1371/journal.pone.0264835.

Full text
Abstract:
With the steady increase in passenger volume of high-speed railways in China, some high-speed railway sections have faced a difficult situation. To provide more transport services, it is necessary to add as many trains as possible in a section to increase capacity. To solve this problem, a compressed multilayer space-time network model is constructed with the maximum number of trains that can be scheduled in the train timetable as the objective. The combination of the train stop plan and speed level is represented by the layer of network where the train is located, and constraints such as train selection, train safety, train overtake and cross-line trains are considered. A method based on timing-cycle iterative optimization is designed to decompose the original problem into multiple subproblems, and the solving order of the subproblems is determined by a heuristic greedy rule. Taking the Beijing-Jinan section of the Beijing-Shanghai high-speed railway as an example, the maximum number of trains was increased by 12.5% compared with the timetable before optimization. The saturated timetables provide detailed schedules, which helps decision-makers better adjust the timetable to run more trains.
APA, Harvard, Vancouver, ISO, and other styles
9

Guo, Haiyang, Yun Bai, Qianyun Hu, Huangrui Zhuang, and Xujie Feng. "Optimization on metro timetable considering train capacity and passenger demand from intercity railways." Smart and Resilient Transport 3, no. 1 (February 1, 2021): 66–77. http://dx.doi.org/10.1108/srt-06-2020-0004.

Full text
Abstract:
Purpose To evacuate passengers arriving at intercity railway stations efficiently, metros and intercity railways usually share the same station or have stations close to each other. When intercity trains arrive intensively, a great number of passengers will burst into the metro station connecting with the intercity railway station within a short period, while the number of passengers will decrease substantially when intercity trains arrive sparsely. The metro timetables with regular headway currently adopted in real-world operations cannot handle the injected passenger demand properly. Timetable optimization of metro lines connecting with intercity railway stations is essential to improve service quality. Design/methodology/approach Based on arrival times of intercity trains and the entire process for passengers transferring from railway to metro, this paper develops a mathematical model to characterize the time-varying demand of passengers arriving at the platform of a metro station connecting with an intercity railway station. Provided the time-varying passenger demand and capacity of metro trains, a timetable model to optimize train departure time of a bi-direction metro line where an intermediate station connects with an intercity railway station is proposed. The objective is to minimize waiting time of passengers at the connecting station. The proposed timetable model is solved by an adaptive large neighborhood search algorithm. Findings Real-world case studies show that the prediction accuracy of the proposed model on passenger demand at the connecting station is higher than 90%, and the timetable model can reduce waiting time of passengers at the connecting station by 28.47% which is increased by 5% approximately than the calculation results of the generic algorithm. Originality/value This paper puts forward a model to predict the number of passengers arriving at the platform of connection stations via analyzing the entire process for passengers transferring from intercity trains to metros. Also, a timetable optimization model aiming at minimizing passenger waiting time of a metro line where an intermediate station is connected to an intercity railway station is proposed.
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Jiang, Tian-tian Li, Bai-gen Cai, and Jiao Zhang. "Boundary Identification for Traction Energy Conservation Capability of Urban Rail Timetables: A Case Study of the Beijing Batong Line." Energies 13, no. 8 (April 24, 2020): 2111. http://dx.doi.org/10.3390/en13082111.

Full text
Abstract:
Energy conservation is attracting more attention to achieve a reduced lifecycle system cost level while enabling environmentally friendly characteristics. Conventional research mainly concentrates on energy-saving speed profiles, where the energy level evaluation of the timetable is usually considered separately. This paper integrates the train driving control optimization and the timetable characteristics by analyzing the achievable tractive energy conservation performance and the corresponding boundaries. A calculation method for energy efficient driving control solution is proposed based on the Bacterial Foraging Optimization (BFO) strategy, which is utilized to carry out batch processing with timetable. A boundary identification solution is proposed to detect the range of energy conservation capability by considering the relationships with average interstation speed and the passenger volume condition. A case study is presented using practical data of Beijing Metro Batong Line and two timetable schemes. The results illustrate that the proposed optimized energy efficient driving control approach is capable of saving tractive energy in comparison with the conventional traction calculation-based train operation solution. With the proposed boundary identification method, the capability space of the energy conservation profiles with respect to the energy reduction and energy saving rate is revealed. Moreover, analyses and discussions on effects from different passenger load conditions are given to both the weekday and weekend timetables. Results of this paper may assist the decision making of rail operators and engineers by enhancing the cost effectiveness and energy efficiency.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Timetable optimization"

1

Reisch, Julian [Verfasser]. "Railway Timetable Optimization / Julian Reisch." Berlin : Freie Universität Berlin, 2021. http://d-nb.info/123445159X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jeřábková, Eva. "Timetabling - příprava rozvrhu pro školu." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-198439.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

Gerchman, Marcos. "Problemas de otimização na engenharia de produção e transportes." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/142727.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

Shu, Yan. "Future aircraft networks and schedules." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41221.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
5

Horký, Aleš. "Systém pro pokročilé plánování." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2015. http://www.nusl.cz/ntk/nusl-234893.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
6

Högdahl, Johan. "A Simulation-Optimization Approach for Improved Robustness of Railway Timetables." Licentiate thesis, KTH, Transportplanering, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-263761.

Full text
Abstract:
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

APA, Harvard, Vancouver, ISO, and other styles
7

Khoshniyat, Fahimeh. "Optimization-Based Methods for Revising Train Timetables with Focus on Robustness." Licentiate thesis, Linköpings universitet, Kommunikations- och transportsystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-132920.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

Gely, Laurent. "Modélisation et optimisation de la gestion opérationnelle du trafic ferroviaire en cas d’aléas." Thesis, Bordeaux 1, 2010. http://www.theses.fr/2010BOR14177.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
9

Brethomé, Lucile. "Modélisation et optimisation d’un plan de transport ferroviaire en zone dense du point de vue des voyageurs." Thesis, Ecole centrale de Lille, 2018. http://www.theses.fr/2018ECLI0014.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
10

Xie, Siqun. "Investigations of the longer term memory, relaxation and restructure in the tabu search heuristic optimization of examination timetables." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6442.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Timetable optimization"

1

Leo, Kroon, Schoebel Anita, Wagner Dorothea 1957-, Zaroliagis Christos D. 1963-, and SpringerLink (Online service), eds. Algorithmic Methods for Railway Optimization: International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Timetable optimization"

1

Colorni, Alberto, Marco Dorigo, and Vittorio Maniezzo. "Genetic Algorithms: A New Approach to the Timetable Problem." In Combinatorial Optimization, 235–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77489-8_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Xiang, and Xin Yang. "Integrated Speed Control and Timetable Optimization." In Subway Energy-Efficient Management, 63–78. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7785-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Xiang, and Xin Yang. "Dynamic Speed Control and Timetable Optimization." In Subway Energy-Efficient Management, 79–94. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7785-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Xiang, and Xin Yang. "Stochastic Speed Control and Timetable Optimization." In Subway Energy-Efficient Management, 95–116. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7785-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Borndörfer, Ralf, Matthias Breuer, Boris Grimm, Markus Reuther, Stanley Schade, and Thomas Schlechte. "Timetable Sparsification by Rolling Stock Rotation Optimization." In Operations Research Proceedings, 723–28. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89920-6_96.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Müller-Hannemann, Matthias, and Mathias Schnee. "Efficient Timetable Information in the Presence of Delays." In Robust and Online Large-Scale Optimization, 249–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05465-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Delling, Daniel, Thomas Pajor, and Dorothea Wagner. "Engineering Time-Expanded Graphs for Faster Timetable Information." In Robust and Online Large-Scale Optimization, 182–206. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05465-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

He, Junxiang, Xiaoqing Zeng, Peiran Ying, Xinchen Xu, and Yizeng Wang. "Optimization of Subway Departure Timetable by Genetic Algorithm." In International Symposium for Intelligent Transportation and Smart City (ITASC) 2019 Proceedings, 177–85. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-7542-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kiciński, Marcin. "Periodic Timetable Nonlinear Optimization in Public Transport Network." In Lecture Notes in Networks and Systems, 59–68. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71771-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rasmussen, Rasmus V., and Michael A. Trick. "The Timetable Constrained Distance Minimization Problem." In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 167–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11757375_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Timetable optimization"

1

Gao, Lei, Guangzheng Bai, Liang Li, and Weihua Chen. "Timetable Optimization Based on Actual Timetable for Urban Rail Transit System." In 2019 12th International Conference on Intelligent Computation Technology and Automation (ICICTA). IEEE, 2019. http://dx.doi.org/10.1109/icicta49267.2019.00102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yan, Fei, and Rob M. P. Goverde. "Railway timetable optimization considering robustness and overtakings." In 2017 5th IEEE International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS). IEEE, 2017. http://dx.doi.org/10.1109/mtits.2017.8005683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Su, Shuai, Xiang Li, and Tao Tang. "A Subway Train Timetable Optimization Approach Based on Energy-Efficient Operation Strategy." In 2012 Joint Rail Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/jrc2012-74017.

Full text
Abstract:
With the rising energy prices and environment concerns, energy-efficient operation is paid more and more attention in the subway systems, which is one of the effective ways to reduce the operation cost and then improve the operation efficiency. There are many researches for energy-efficient operation on designing a reasonable timetable or optimizing the speed profile, but all of them are studied separately. To achieve a better performance on energy saving, we present an integrated algorithm for optimizing the timetable for the entire route together with the speed profiles between successive stations, which is named as integrated timetable. First, we give an analytical algorithm to get the optimal switching points for each section by using the Pontryagin maximum principle. For dealing with the variable speed limits, we calculate the reserve time, i.e., the difference between the pre-determined trip time and the minimum trip time, and then design an algorithm to distribute it among different sections with constant speed limits. Finally, we extend the algorithm to solve the integrated timetable. We also give some numerical examples to illustrate the validity of the algorithm based on the data from the Beijing YiZhuang subway line in China. It is recorded that the energy consumption for interstation trip can be reduced by 10.3% on average, and the total energy reduction for the entire trip is 14.5% by using the integrated timetable. Besides, it takes about 0.15 seconds to generate the integrated timetable, which means that the algorithm is quick enough to be used in the automatic train operation (ATO) system for real-time control.
APA, Harvard, Vancouver, ISO, and other styles
4

Abbas-Turki, A., O. Grunder, A. El Moudni, and E. Zaremba. "Sequence Optimization for Timetabling High Frequency Passenger Trains." In 2012 Joint Rail Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/jrc2012-74137.

Full text
Abstract:
Recently, Harrod has revealed that the occupancy constraints are not sufficient to timetable rail traffic. This insufficiency occurs when opposite movements of trains share the same route. In this paper, we propose a quick algorithm that considers overtaking and opposite train’s movements. This algorithm builds a train timetable from a proposed sequence of trains. It is based on an elementary model of an invariant resource sharing system. The algorithm is proposed in order to extend the genetic algorithm that calculates the sequence of trains for maximizing the frequency of passenger’s train.
APA, Harvard, Vancouver, ISO, and other styles
5

Xu, Jingqi, Haode Liu, and Jing Teng. "Optimization Model for Bus Timetable Based on APC." In Eighth International Conference of Chinese Logistics and Transportation Professionals (ICCLTP). Reston, VA: American Society of Civil Engineers, 2009. http://dx.doi.org/10.1061/40996(330)659.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Han, Yan, Xuezhao Ma, and Linfeng Guo. "Regional Bus Timetable Optimization Based on Node Importance." In 22nd COTA International Conference of Transportation Professionals. Reston, VA: American Society of Civil Engineers, 2022. http://dx.doi.org/10.1061/9780784484265.049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhi, Li. "A Common Model for Railway Train Timetable Optimization." In 2019 11th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA). IEEE, 2019. http://dx.doi.org/10.1109/icmtma.2019.00032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Jinhua, and Marc Klemenz. "Railway Timetable Optimization Using Non-Proportional Distributed Allowance Arrangement Method." In 2009 Joint Rail Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/jrc2009-63028.

Full text
Abstract:
In order to keep certain level of train punctuality and flexibility of adjustment in practical operation phase, allowance which normally is set proportionally is added to the minimum running and dwell time. This paper develops a new strategy that through changing allowance arrangement to optimize timetable quality by using non-proportional distributed method–curving train path (CTP). With Railsys® as simulation tool, results shows that CTP is quite optimal to decrease delay and delay transfer, to spare more room for train path while the travel time remains constant, and timetable quality is improved to a new balance level.
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Xin, Bin Ning, Xiang Li, Tao Tang, and Xiaomei Song. "A Subway Timetable Optimization Model for Maximizing the Utilization of Recovery Energy." In 2013 Joint Rail Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/jrc2013-2544.

Full text
Abstract:
Since the regenerative braking technique can recover considerable electricity from braking trains, it is maturely applied in subway systems. Generally speaking, except a small part of the recovery energy is used by the on-board auxiliary services, most of them is fed back into the overhead contact line. If the feedback energy cannot be absorbed by adjacent accelerating trains timely, it will be consumed by resistances. For maximizing the utilization of recovery energy, this paper proposes a timetable optimization model to coordinate the accelerating and braking processes of up trains and down trains. Firstly, we analyze the coordinating rules. Secondly, we propose an integer programming model to maximize the utilization of recovery energy with headway time and dwell time control. Furthermore, we design a genetic algorithm to solve the optimal timetable. Finally, we conduct numerical examples based on the operation data from Beijing Yizhuang subway line of China. The results illustrate that the proposed model can significantly save energy by 21.58% compared with the current timetable.
APA, Harvard, Vancouver, ISO, and other styles
10

Irene, Ho Sheau Fen, Safaai Deris, Mohd Hashim, and Siti Zaiton. "University course timetable planning using hybrid particle swarm optimization." In the first ACM/SIGEVO Summit. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1543834.1543868.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Timetable optimization"

1

Mohammadian, Abolfazl, Amir Bahador Parsa, Homa Taghipour, Amir Davatgari, and Motahare Mohammadi. Best Practice Operation of Reversible Express Lanes for the Kennedy Expressway. Illinois Center for Transportation, September 2021. http://dx.doi.org/10.36501/0197-9191/21-033.

Full text
Abstract:
Reversible lanes in Chicago’s Kennedy Expressway are an available infrastructure that can significantly improve traffic performance; however, a special focus on congestion management is required to improve their operation. This research project aims to evaluate and improve the operation of reversible lanes in the Kennedy Expressway. The Kennedy Expressway is a nearly 18-mile-long freeway in Chicago, Illinois, that connects in the southeast to northwest direction between the West Loop and O’Hare International Airport. There are two approximately 8-mile reversible lanes in the Kennedy Expressway’s median, where I-94 merges into I-90, and there are three entrance gates in each direction of this corridor. The purpose of the reversible lanes is to help the congested direction of the Kennedy Expressway increase its traffic flow and decrease the delay in the whole corridor. Currently, experts in a control location switch the direction of the reversible lanes two to three times per day by observing real-time traffic conditions captured by a traffic surveillance camera. In general, inbound gates are opened and outbound gates are closed around midnight because morning traffic is usually heavier toward the central city neighborhoods. In contrast, evening peak-hour traffic is usually heavier toward the outbound direction, so the direction of the reversible lanes is switched from inbound to outbound around noon. This study evaluates the Kennedy Expressway’s current reversing operation. Different indices are generated for the corridor to measure the reversible lanes’ performance, and a data-driven approach is selected to find the best time to start the operation. Subsequently, real-time and offline instruction for the operation of the reversible lanes is provided through employing deep learning and statistical techniques. In addition, an offline timetable is also provided through an optimization technique. Eventually, integration of the data-driven and optimization techniques results in the best practice operation of the reversible lanes.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography