3,167 Hits in 3.3 sec

Automatic Timetabling Using Artificial Immune System [chapter]

Yulan He, Siu Cheung Hui, Edmund Ming-Kit Lai
2005 Lecture Notes in Computer Science  
However, until now, university timetabling is still largely done by hand, because a typical university setting requires numerous customized complicated constraints that are difficult to model or automate  ...  Empirical study on course timetabling for the School of Computer Engineering (SCE), Nanyang Technological University (NTU), Singapore as well as the benchmark dataset provided by the Metaheuristic Network  ...  as well as the university course timetabling problem provided by the Metaheuristics Network.  ... 
doi:10.1007/11496199_8 fatcat:dkjohvukaret3lvm37o5ma7kji

Hybrid cyclicity: Combining the benefits of cyclic and non-cyclic timetables

Tomáš Robenek, Shadi Sharif Azadeh, Yousef Maknoon, Michel Bierlaire
2017 Transportation Research Part C: Emerging Technologies  
The performance of each of the considered timetables is assessed on the real network of Israeli Railways.  ...  We propose a new type of timetable that would combine both the regularity of the cyclic timetables and the flexibility of the non-cyclic ones.  ...  The basic PESP formulation considers one universal cycle, known a priori, for the whole railway network.  ... 
doi:10.1016/j.trc.2016.12.015 fatcat:jp7kclnmife73ln2vn73h5ifii

Capacity-Oriented Train Scheduling of High-Speed Railway Considering the Operation and Maintenance of Rolling Stock

Wenliang Zhou, Sha Li, Jing Kang, Yu Huang
2022 Mathematics  
We then proposed an integer planning model with rolling stock maintenance and the OD service frequency constraints to maximize the number of running arcs in rail sections.  ...  After decomposing this model by introducing some Lagrangian multipliers to relax its hard constraints, we proposed a Lagrangian relaxation-based decomposition algorithm, including two path search sub-algorithms  ...  Constraint (4) ensures the flow balance at every node in the network.  ... 
doi:10.3390/math10101639 fatcat:2blztd42uzbfhciraugqzxpymq

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem [chapter]

Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca M. Gambardella, Joshua Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luis Paquete, Thomas Stützle
2003 Lecture Notes in Computer Science  
The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem.  ...  The results show that no metaheuristic is best on all the timetabling instances considered.  ...  This work was supported by the Metaheuristics Network, a Research Training Network funded by the Improving Human Potential programme of the CEC, grant HPRN-CT-1999-00106.  ... 
doi:10.1007/978-3-540-45157-0_22 fatcat:2jkg5bocufd4fbqomtw2hddhty

The application of Coarse-Grained Parallel Genetic Algorithm with Hadoop in University Intelligent Course-Timetabling System

Liping Wu
2015 International Journal of Emerging Technologies in Learning (iJET)  
The university course-timetabling problem is a NP-C problem.  ...  It can improve the quality and speed of solving effectively, and have a broad application prospect in solving the problem of university course-timetabling problem.  ...  With the development of campus network and office automation, the university educational administrators realize that the con-struction of computer intelligent course-timetabling system is imperative [  ... 
doi:10.3991/ijet.v10i8.5206 fatcat:e4ay5cneqnfmddqpmd43agf34a

Data Analysis to Study Sub-threshold Delays Incurred by Tyne and Wear Metro Trains

Daniel Screen, James Parkinson, Christopher Shilton, Aleksandrs Rjabovs, Marin Marinov
2020 Urban Rail Transit  
The metro system has a number of infrastructure constraints including single-line sections, junctions and level crossings, all of which have to be taken account of when constructing the timetable, in order  ...  The purpose of the analysis is to identify regularly occurring issues which are due to the timetable, in order to recommend changes. Two different data sets were used.  ...  All these network constraints mean that the effects of a small delay to a train can multiply.  ... 
doi:10.1007/s40864-020-00125-4 fatcat:ah2nnnbmirgexhggfqh55uiztq

A column generation approach for the timetabling problem of Greek high schools

K Papoutsis, C Valouxis, E Housos
2003 Journal of the Operational Research Society  
Every class section has its own permanent room, thus there are no room constraints for this timetabling problem.  ...  Complete university modular timetabling using constraint logic programming. In: Burke E and Ross P (eds). Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153.  ... 
doi:10.1057/palgrave.jors.2601495 fatcat:ky3g5rundfhn7nbgm5wjwar26e

Fairness in academic course timetabling

Moritz Mühlenthaler, Rolf Wanka
2014 Annals of Operations Research  
The central idea is that undesirable arrangements in the course timetable, i.e., violations of soft constraints, should be distributed in a fair way among the individuals.  ...  We consider the problem of creating fair course timetables in the setting of a university.  ...  When creating course timetables for a university, however, it may be desirable to pick a timetable from a number of solutions with varying tradeoffs between fairness and total penalty.  ... 
doi:10.1007/s10479-014-1553-2 fatcat:mlcbqik5ffdsdlgnuieo3d5tku

Train Timetabling on double track and multiple station capacity railway with useful upper and lower bounds

Afshin Oroojlooy Jadid, Kourosh Eshghi
2017 Scientia Iranica. International Journal of Science and Technology  
In this paper, the timetabling problem of a multiple-tracked railway network is discussed.  ...  In the end, we are grateful to the authors for providing us with all the related cited papers that motivated us to the every end of the project.  ...  In this algorithm, complex constraints are relaxed from the set of constraints and are added to the objective function with a penalty multiplier.  ... 
doi:10.24200/sci.2017.4396 fatcat:big7x5r5nbce7d5dyu6yfq3m5q

Passenger centric train timetabling problem

Tomáš Robenek, Yousef Maknoon, Shadi Sharif Azadeh, Jianghang Chen, Michel Bierlaire
2016 Transportation Research Part B: Methodological  
The problem is modeled as a Mixed Integer Linear Programming (MILP) problem with an objective of maximizing the train operating company's profit while maintaining ε level of passenger satisfaction.  ...  We consider both types of timetable(s): cyclic and non-cyclic.  ...  The city with the second highest probability is Renens, because it is the closest station to one of the biggest universities in Switzerland and from the network diagram (Figure 3 ), we can see at the  ... 
doi:10.1016/j.trb.2016.04.003 fatcat:hdefgbrlarckzb5wg6awvrjsea

An Energy-Efficient Timetable Optimization Approach in a Bi-DirectionUrban Rail Transit Line: A Mixed-Integer Linear Programming Model

Huanhuan Lv, Yuzhao Zhang, Kang Huang, Xiaotong Yu, Jianjun Wu
2019 Energies  
The results show that the designed timetable could achieve about a 35% energy reduction compared with the maximum energy consumption and a 6.6% cost saving compared with the maximum system cost.  ...  In this paper, the timetable is optimized with respect to the system cost of urban rail transit, which pays more attention to energy consumption.  ...  Acknowledgments: Thanks to Honghong Zhou, Schoool of Language and Communication, Beijing jiaotong University, for providing the help in editing and grammar.  ... 
doi:10.3390/en12142686 fatcat:r3tvemclv5blhivqks7asvsvw4

Train timetable design under elastic passenger demand

Tomáš Robenek, Shadi Sharif Azadeh, Yousef Maknoon, Matthieu de Lapparent, Michel Bierlaire
2018 Transportation Research Part B: Methodological  
Subsequently, we integrate the train timetabling problem with a ticket pricing problem.  ...  We solve the elastic passenger centric train timetabling problem for various types of timetables using a simulated annealing heuristic on a case study of Israeli Railways.  ...  At first, we present the demand representations used in the train timetabling problems (Section 2.1) and continue with the various demand forecasting techniques used in the railway context (Section 2.2  ... 
doi:10.1016/j.trb.2018.03.002 fatcat:5oaqwrbdf5ctvkeuohvlolgusu

A Generic Object-Oriented Constraint-Based Model for University Course Timetabling [chapter]

Kyriakos Zervoudakis, Panagiotis Stamatopoulos
2001 Lecture Notes in Computer Science  
The construction of course timetables for academic institutions is a very difficult problem with a lot of constraints that have to be respected and a huge search space to be explored, even if the size  ...  However, there exists a set of entities and constraints among them which are common to every possible instantiation of the timetabling problem.  ...  Object-Oriented Modeling The model for the university course timetabling problem we present in this section aims to be as generic as possible.  ... 
doi:10.1007/3-540-44629-x_3 fatcat:o4kjs5qkybcyrb5lobzvhrbmny

Genetic based discrete particle swarm optimization for Elderly Day Care Center timetabling

M.Y. Lin, K.S. Chin, K.L. Tsui, T.C. Wong
2016 Computers & Operations Research  
These constraints are categorized into two: hard constraints, which must be fulfilled strictly, and soft constraints, which may be violated but with a penalty.  ...  Abstract The timetabling problem of local Elderly Day Care Centers (EDCCs) is formulated into a weighted maximum constraint satisfaction problem (Max-CSP) in this study.  ...  network D Set of finite domains for the variables in a constraint network C Set of constraints over the subset of variables in a constraint network K Total number of timeslots n Total number of events  ... 
doi:10.1016/j.cor.2015.07.010 fatcat:75xtdlk345alzjwmfryv3evz7e

Improving Efficiency in Congested Traffic Networks: Pareto-Improving Reservations through Agent-Based Timetabling

Luetian Sun, Rui Song
2022 Sustainability  
The proposed reservation and end-to-end timetabling problem is formulated as a multicommodity flow optimization problem in a discretized space–time network.  ...  We use a modified dynamic programming method for the reservation strategy on the space–time network and further adopt the alternative direction method of multiplier (ADMM) based on prime and dual theory  ...  The first author wants to thank a number of scholars in this field, especially Shiwei He at Beijing Jiaotong University.  ... 
doi:10.3390/su14042211 fatcat:yqc5kkuvgvf6jpvlyyqtk4yr5a
« Previous Showing results 1 — 15 out of 3,167 results