Academic literature on the topic 'Timetable allocation'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Timetable allocation.'
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 allocation"
1
Palmqvist, Carl-William, Nils O. E. Olsson, and Lena Winslott Hiselius. "The Planners’ Perspective on Train Timetable Errors in Sweden." Journal of Advanced Transportation 2018 (2018): 1–17. http://dx.doi.org/10.1155/2018/8502819.
Full textAbstract:
Timetables are important for train punctuality. However, relatively little attention has been paid to the people who plan the timetables: the research has instead been more centred on how to improve timetables through simulation, optimisation, and data analysis techniques. In this study, we present an overview of the state of practice and the state of the art in timetable planning by studying the research literature and railway management documents from several European countries. We have also conducted interviews with timetable planners in Southern Sweden, focusing on how timetable planning relates to punctuality problems. An important backdrop for this is a large project currently underway at the Swedish Transport Administration, modernizing the timetable planning tools and processes. This study is intended to help establish a baseline for the future evaluation of this modernization by documenting the current process and issues, as well as some of the research that has influenced the development and specifications of the new tools and processes. Based on the interviews, we found that errors in timetables commonly lead to infeasible timetables, which necessitate intervention by traffic control, and to delays occurring, increasing, and spreading. We found that the timetable planners struggle to create a timetable and that they have neither the time nor the tools required to ensure that the timetable maintains a high quality and level of robustness. The errors we identified are (a) crossing train paths at stations, (b) wrong track allocation of trains at stations, especially for long trains, (c) insufficient dwell and meet times at stations, and (d) insufficient headways leading to delays spreading. We have identified eleven reasons for these errors and found three themes among these reasons: (1) “missing tools and support,” (2) “role conflict,” and (3) “single-loop learning.” As the new tools and processes are rolled out, the situation is expected to improve with regard to the first of these themes. The second theme of role conflict occurs when planners must strive to meet the demands of the train operating companies, while they must also be unbiased and create a timetable that has a high overall quality. While this role conflict will remain in the future, the new tools can perhaps help address the third theme by elevating the planners from first- to double-loop learning and thereby allowing them to focus on quality control and on finding better rules and heuristics. Over time, this will lead to improved timetable robustness and train punctuality.
2
Široký, Jaromír, Petr Nachtigall, Jozef Gašparík, and Jiří Čáp. "Calculation Model of Railway Capacity Price in the Czech Republic." Promet - Traffic&Transportation 33, no. 1 (January 31, 2021): 91–102. http://dx.doi.org/10.7307/ptt.v33i1.3544.
Full textAbstract:
This paper presents a pricing model of railway infrastructure capacity allocation functioning as a regulatory measure while fulfilling the regulatory requirements on railway infrastructure capacity allocation. The prices of railway infrastructure capacity allocation will be modelled with regard to all economically justifiable costs of railway infrastructure capacity allocation. The structure of model has been developed as a set of calculation sheets in Microsoft Excel. The recommended prices for railway capacity have been found by simulation of a set of variants and the recommendation is done for different operational conditions in an individual way. It analyses different products offered by the railway infrastructure capacity allocator both in the annual working timetable mode, and in the individual ad hoc mode. The aim of the proposed model is to motivate not only railway undertakings, but also the railway infrastructure capacity allocator to submit requests for railway infrastructure capacity in the annual working timetable mode rather than in the individual ad hoc mode. The total price is then verified to the cost of railway infrastructure capacity allocation. This process then ensures the regulation of the demand of railway undertakings on the given route and can influence the decision about the use of the product offered.
3
Alghamdi, H., T. Alsubait, H. Alhakami, and A. Baz. "A Review of Optimization Algorithms for University Timetable Scheduling." Engineering, Technology & Applied Science Research 10, no. 6 (December 20, 2020): 6410–17. http://dx.doi.org/10.48084/etasr.3832.
Full textAbstract:
The university course timetabling problem looks for the best schedule, to satisfy given criteria as a set of given resources, which may contain lecturers, groups of students, classrooms, or laboratories. Developing a timetable is a fundamental requirement for the healthy functioning of all educational and administrative parts of an academic institution. However, factors such as the availability of hours, the number of subjects, and the allocation of teachers make the timetable problem very complex. This study intends to review several optimization algorithms that could be applied as possible solutions for the university student course timetable problem. The reviewed algorithms take into account the demands of institutional constraints for course timetable management.
4
Meng, Lingyun, Malik Muneeb Abid, Xinguo Jiang, Afaq Khattak, and Muhammad Babar Khan. "Increasing Robustness by Reallocating the Margins in the Timetable." Journal of Advanced Transportation 2019 (July 28, 2019): 1–15. http://dx.doi.org/10.1155/2019/1382394.
Full textAbstract:
It is a common practice to improve the punctuality of a railway service by the addition of time margins during the planning process of a timetable. Due to the capacity constraints of the railway network, a limited amount of time margins can be inserted. The paper presents a model and heuristic technique to find the better position for the limited amount of time margins (headway buffers and running time supplements) in a train timetable. The aim of reallocating the time margins is to adjust an existing timetable to minimize the sum of train delays at the event of the operational disturbances. The model consists of two basic parts. Firstly, the paper treats the train timetable as a Directed Arc Graph (DAG) with the aggregation concept and proposes a heuristic technique known as Critical Time Margins Allocation (CTMA), which is based on the critical path method (CPM), to reallocate the time margins. Secondly, the paper evaluates the original and modified timetable under different disturbed situations. The case study is developed on a hypothetical small railway network and a practical timetable of single-line train timetable for the track segment of Rawalpindi to Lalamusa, Pakistan. The results show that the timetable modified with the CTMA reduces the total delay time by an average of 3.25% for the small railway network and 5.18% for the large dataset. It suggests that adding the time supplements to the proper positions in a timetable can reduce the delay propagation and increase the robustness of the timetable.
5
Dr. V.Vinodhini, A.Subashini, and S.Sathesh Kumar. "Auto-Time Table Automation Tool using Genetic Algorithm." International Journal of Engineering and Management Research 11, no. 2 (April 30, 2021): 122–25. http://dx.doi.org/10.31033/ijemr.11.2.18.
Full textAbstract:
Time Table Computerization Tool is utilized for all educational pitch. The process includes two client features, the institution head and staff individuals. Institution head has all the rights to control and change the given information. All office accessible in the institution will be kept up through division's module. Administrator can pick any staff individual from the necessary office and can allocateto a prescribed class. During allocation the procedure followed with respective subjects in the institution for first, second, third, final year and so. Staff must be browsed with the necessary division. Administrator picks relating staff for their respective subjects and ration them. After staff dispersal, their time table will be shaped by the administrator which can be perceived by the staff individuals. Staff will have separate login framework, where they can login and can perceive their time tables. For other years same criteria will be followed in order to distribute the subjects among staff evenly. The Auto timetable schedule feature automates class, exam, and course forecast process for students, teachers, and different classrooms by taking into consideration all the possible. Furthermore, the timetable software integrates user-centric and simple-to-use tools to for educators to view, organize, and generate master and individual timetables for each teacher/ class/grade, develop personalized timetables, create and pin to-do lists, schedule substitute replacements for absent staff, manage and organize events on calendar, and much more on smartphone, tablet and computer devices.
6
El-Dhshan, Abdalla, Hegazy Zaher, and Naglaa Ragaa. "An Intelligent Technique for Solving Timetable Problem." Journal of University of Shanghai for Science and Technology 23, no. 05 (May 7, 2021): 1–11. http://dx.doi.org/10.51201/jusst/21/04251.
Full textAbstract:
Timetabling problem is complex combinatorial resources allocation problems. There are two hard and soft constraints to be satisfied. The timetable is feasible if all hard constraints are satisfied. Besides, satisfying more of the soft constraints produces a high-quality timetable. Crow Search Algorithm (CSA) as an intelligence technique presents for solving timetable problem. CSA like all meta-heuristic optimization techniques is a nature-inspire of intelligent behavior of crows. The proposed CSA tested using the well-known benchmark of hard timetabling datasets (hdtt). Taguchi’s method used to tune the best parameter combinations for the factors and levels. The tuned parameters of CSA are applied on datasets in separate experiment. The results show that the proposed CSA is superior to generate solutions in reasonable CPU time when compared with other literature techniques.
7
Zhang, Qin, Xiaoning Zhu, Li Wang, and Shuai Wang. "Simultaneous Optimization of Train Timetabling and Platforming Problems for High-Speed Multiline Railway Network." Journal of Advanced Transportation 2021 (March 17, 2021): 1–16. http://dx.doi.org/10.1155/2021/6679008.
Full textAbstract:
The optimization problems of train timetabling and platforming are two crucial problems in high-speed railway operation; these problems are typically considered sequentially and independently. With the construction of high-speed railways, an increasing number of interactions between trains on multiple lines have led to resource assignment difficulties at hub stations. To coordinate station resources for multiline train timetables, this study fully considered the resources of track segments, station throat areas, and platforms to design a three-part space-time (TPST) framework from a mesoscopic perspective to generate a train timetable and station track assignment simultaneously. A 0-1 integer programming model is proposed, whose objective is to minimize the total weighted train running costs. The construction of a set of incompatible vertexes and links facilitates the expression of difficult constraints. Finally, example results verify the validity and practicability of our proposed method, which can generate conflict-free train timetables with a station track allocation plan for multiple railway lines at the same time.
8
Stojadinović, Nikola, Branislav Bošković, and Mirjana Bugarinović. "BRIDGING THE GAP BETWEEN INFRASTRUCTURE CAPACITY ALLOCATION AND MARKET-ORIENTED RAILWAY: AN ALGORITHMIC APPROACH." Transport 34, no. 6 (September 10, 2019): 708–21. http://dx.doi.org/10.3846/transport.2019.11035.
Full textAbstract:
The European Commission initiated the process of liberalization and introducing competition in the European railway sector more than twenty-five years ago. Despite the liberalization of the railway sector, train paths are currently administratively allocated in all EU countries using the train service priority criterion, which may not treat all train operators equally. This is especially evident in those network sections where demand exceeds the available capacity. In these situations, economic theory suggests the implementation of a market-based mechanism for allocation of capacity, such as auctions. However, due to its incompatibilities with priority criteria in the process of the capacity allocation, it is necessary to develop a new procedure to support the implementation of an auction. In this paper, the proposed algorithm fills the technological gap between train timetable design and train operator requests. The new algorithm for decentralized capacity allocation is the result of a multidimensional approach, which encompasses setting new relations between train operators and the infrastructure manager, train timetable drafting and resolving the conflicting request. In addition, the algorithm provides a feasible solution ensuring equal treatment of train operators and efficient allocation, in order to foster the development of the competition in the European rail market.
9
Ariessanti, Hani Dewi, Dwi Sloria Suharti, and Ary Budi Warsito. "OPTIMASI PENJADWALAN PERKULIAHAN MENGGUNAKAN METODEAUTO GENERATE TIMETABLE DENGAN ARRAY." CCIT Journal 11, no. 2 (August 18, 2018): 257–66. http://dx.doi.org/10.33050/ccit.v11i2.593.
Full textAbstract:
Scheduling is one of the many problems that has been done in research for many years. Problems preparing the schedule in college are about college scheduling. The timing process should be done for each semester, which is a tiring and time-consuming task. The overall allocation of events in timeslots and spaces is done by the course scheduling process by considering the list of hard constraints and soft constraints, so there is no conflict created in allocating the schedule. Therefore, it is necessary to create a lecture scheduling application that is able to facilitate and overcome the problems in organizing the lecture schedule. The proposed scheduling system design proposed in this study is to optimize the schedule of lectures using the Auto Generate Timetable method with arrays to find the best candidates for college scheduling with the aim of minimizing the conflict and optimizing the scheduling schedule. This method is based on the process of lecturing process that has been conducted in college. Every curriculum, space, day / time, is needed to arrange the schedule of students and lecturers as part of the scheduling variable that is the solution candidate. Then the process of adjusting to constraints has been made with various parameters. The research method is to collect the data, analysis, design, coding, testing and up to the maintenance phase by using the Waterfall System Development Lifecycle method. The waterfall model provides a life-cycle approach to the development of software systems in sequential or sequential form. So with the existence of this application, it is hoped that the arrangement of lectures will not find problems as a constraint in arranging the lecture schedule
10
Lee, Chang-Hun, Seong-Il Shin, and Si-Gon Kim. "Railway Timetable Considering Optimal Path Finding Method in Rail Network (Focused on Revenue Allocation)." Journal of the Korean society for railway 18, no. 2 (April 30, 2015): 149–56. http://dx.doi.org/10.7782/jksr.2015.18.2.149.
Full textDissertations / Theses on the topic "Timetable allocation"
1
Mauragis, Rasa Emilija, and n/a. "Arts education access in high school scheduling." University of Canberra. Education, 1993. http://erl.canberra.edu.au./public/adt-AUC20060907.102648.
Full textAbstract:
The purpose of this study was to investigate the implementation of curriculum policy
regarding eight key learning areas in ACT government high schools with particular
analysis concerning the Arts.
The study sought to identify the discrepance between school curriculum policy and
timetable allocation to the mandated curriculum areas.
Analysis of time allocation to learning areas as defined by the timetable allocation of
time was considered to be an appropriate method of examining curriculum practice in
ACT government high schools. Fifteen ACT government high school timetables were
analysed in conjunction with school curriculum documentation. Mandatory time
requirements for the eight key learning areas was identified. Timetable structures were
analysed in terms of allocation of time to key learning areas, pastoral care, assemblies,
activities and electives. Formulae were developed in order to make comparisons
between schools possible.
Results indicated that disparities existed between time allocation to key learning areas
within key learning areas and mandatory time (i.e. minimum guaranteed access time)
requirements for key learning areas.
2
Rönnberg, Linda. "Tid för reformering : Försöksverksamheten med slopad timplan i grundskolan." Doctoral thesis, Umeå universitet, Statsvetenskap, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-1082.
Full textAbstract:
In 1999, the Swedish Parliament decided to launch an experiment to test the idea of replacing, at the compulsory educational level, the national time schedule with localized control of schedules. This was in keeping with strategies of deregulation, decentralisation and increased local autonomy that had dominated Swedish education policy, particularly since the 1990s. The aim of the thesis is to describe and analyse the initiation, decision, implementation and consequences of this experiment The analytical framework combines several different approaches and theories from the literature on public policy and policy analysis. The framework encompasses four dimensions, which cover the experiment’s origins, local application in the classroom setting and consequences. On the empirical level, findings are based on interviews with 32 municipal school directors, and head teachers, teachers and pupils in three schools participating in the experiment, as well as written sources from schools, municipalities, and the national level. The thesis shows that the policy problem the experiment was intended to resolve was represented in an inconsistent manner: On the one hand, the experiment was perceived as a driving force for change; on the other hand, it was seen as legitimising a change that had already taken place. Furthermore, the experiment was formulated in vague terms, which accorded far-reaching discretionary space to the schools. The program’s causal theory expressed by the policy makers was complex, containing a multifaceted chain of presumptions on a range of activities and processes through which the experiment ultimately would lead to improved opportunities for pupils to reach the educational objectives. Empirically, this prediction proved to be invalid as student achievement did not increase. The degree of implementation at the local level varied according to the comprehension, capability and willingness of those involved to carry out the experiment. The courses of action taken by the schools frequently could have been undertaken within the existing legislative framework, as they mostly concerned new ways of working and organising staff and pupils. An assessment of the objectives attained showed that, even if elements of developmental work corresponding to the direction stated in the policy documents were observed, the experiment did not emerge as the primary explanatory factor for this result Thus, the net impact of the experiment can be questioned. If judged against the criterion of adaptiveness, the results are more successful than if the experiment is assessed according to goal-attainment and the validity of the program theory. The experiment was found to integrate, alter and accommodate itself readily to local needs. The thesis illustrates the complexity of formulating and implementing policy in a decentralised context and points to important aspects in the historical background of the programme, which often tend to be overlooked when policy is analysed and discussed. At the same time, the study sheds light on the significant role played by street-level implementation actors in the educational context.
3
Wangmaeteekul, Pennee. "Using distributed agents to create university course timetables addressing essential & desirable constraints and fair allocation of resources." Thesis, Durham University, 2011. http://etheses.dur.ac.uk/3602/.
Full textAbstract:
In this study, the University Course Timetabling Problem (UCTP) has been investigated. This is a form of Constraint Satisfaction Problem (CSP) and belongs to the NP-complete class. The nature of a such problem is highly descriptive, a solution therefore involves combining many aspects of the problem. Although various timetabling algorithms have been continuously developed for nearly half a century, a gap still exists between the theoretical and practical aspects of university timetabling. This research is aimed to narrow the gap. We created an agent-based model for solving the university course timetabling problem, where this model not only considers a set of essential constraints upon the teaching activities, but also a set of desirable constraints that correspond to real-world needs. The model also seeks to provide fair allocation of resources. The capabilities of agents are harnessed for the activities of decision making, collaboration, coordination and negotiation by embedding them within the protocol designs. The resulting set of university course timetables involve the participation of every element in the system, with each agent taking responsibility for organising of its own course timetable, cooperating together to resolve problems. There are two types of agents in the model; these are Year-Programme Agent and Rooms Agent. In this study, we have used four different principles for organising the interaction between the agents: First-In-First-Out & Sequential (FIFOSeq), First-In-First-Out & Interleaved (FIFOInt), Round-Robin & Sequential (RRSeq) and Round-Robin & Interleaved (RRInt). The problem formulation and data instances of the third track of the Second International Timetabling Competition (ITC-2007) have been used as benchmarks for validating these implemented timetables. The validated results not only compare the four principles with each other; but also compare them with other timetabling techniques used for ITC-2007. The four different principles were able to successfully schedule all lectures in different periods, with no instances of two lectures occupying the same room at the same time. The lectures belonging to the same curriculum or taught by the same teacher do not conflict. Every lecture has been assigned a teacher before scheduling. The capacity of every assigned room is greater than, or equal to, the number of students in that course. The lectures of each course have been spread across the minimum number of working days with more than 98 percent success, and for more than 75 percent of the lectures under the same curriculum, it has been possible to avoid isolated deliveries. We conclude that the RRInt principle gives the most consistent likelihood of ensuring that each YPA in the system gets the best and fairest chance to obtain its resources.
Books on the topic "Timetable allocation"
1
Authority, Civil Aviation. Slot allocation: A proposal for Europe's airports. London: Civil Aviation Authority, 1995.
Find full textBook chapters on the topic "Timetable allocation"
1
Shiina, Takayuki, Susumu Morito, and Jun Imaizumi. "Optimization of Railway Timetable by Allocation of Extra Time Supplements." In Operations Research Proceedings, 173–80. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-42902-1_23.
Full text
2
Niu, Yong-tao, and Ling-yun Meng. "Optimizing Slack Time Allocation in Train Timetable: A Two-Stage Stochastic Recourse Model." In Proceedings of the 2013 International Conference on Electrical and Information Technologies for Rail Transportation (EITRT2013)-Volume I, 245–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-53778-3_23.
Full textConference papers on the topic "Timetable allocation"
1
Preinfalk, Oskar, and Helmut A. Mayer. "Automatic construction of drama school timetables based on a generic evolutionary framework for allocation and scheduling problems." In the 2004 ACM symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/967900.968103.
Full text