Modeling and Solving the Train Timetabling Problem
نویسندگان
چکیده
منابع مشابه
A discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملModeling and Solving the Train Pathing Problem
In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clea...
متن کاملA simulation-based optimization approach for passenger train timetabling with periodic track maintenance and stops for praying
This paper presents two optimization methods for solving the passenger train timetabling problem to minimize the total delay time in the single track railway networks. The goal of the train timetable problem is to determine departure and arrival times to or from each station in order to prevent collisions between trains and effective utilization of resources. The two proposed methods are based ...
متن کاملTrain Scheduling Problem - Phase I: A General Simulation Modeling Framework
One of the important problems in management of railway systems is train scheduling problem. This is the problem of determining a timetable for a set of trains that do not violate infrastructure capacities and satisfies some operational constraints. In this study, a feasible timetable generator framework for stochastic simulation modeling is developed. The objective is to obtain a feasible tr...
متن کاملStrong Relaxations for the Train Timetabling Problem Using Connected Configurations
The task of the train timetabling problem or track allocation problem is to find conflict free schedules for a set of trains with predefined routes in a railway network. Especially for nonperiodic instances models based on time expanded networks are often used. Unfortunately, the linear programming relaxation of these models is often extremely weak because these models do not describe combinato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 50 شماره
صفحات -
تاریخ انتشار 2002