IH
I.K. Hanou
Authored
1 records found
Moving Trains like Pebbles
A Feasibility Study on Tree Yards
The Train Unit Shunting Problem concerns the parking of trains outside their scheduled use on so-called shunting yards. This is an NP-hard problem, and the current algorithm used by the Netherlands Railways cannot detect whether an instance is infeasible. So, infeasible instances
...
Contributed
15 records found
Dealing with conflicting trains
Effectively avoiding and resolving conflicts during shunting
A shunting yard is used to store trains between arrival and departure. A conflict arises in a shunting yard when one train obstructs another from leaving. Resolving a conflict is done by re-allocating the trains obstructing the departing train to other tracks in the shunting yard
...
Mixed-direction train shunting with numerical planning
Approach to support train departures at any time during the shunting plan
In this paper, we discuss our novel approach to support mixed-direction shunting in the planning domain for tree-like shunting yards. We explain how we used numeric fluents to improve an existing PDDL domain to support such actions. We elaborate on the underlying conceptual model
...
Landmarks in Planning
Using landmarks as Intermediary Golas or as a Pseudo-Heuristic
Algorithmic planners occasionally waste effort and thus computing time trying to solve certain tasks, as they often lack the human ability to recognize essential paths. These essential paths, termed landmarks, are vital for optimizing planning processes. This study revisits landm
...
Re-evaluating the Full Landmark Extraction Algorithm
A Performance Analysis of FULL
Landmarks are propositions or actions that must be true at some point in every valid solution plan [16]. Using landmarks, planners can develop solutions more efficiently. Different algorithms exist to extract landmarks from a planning problem. The one used in this study is FULL [
...
Reproducing the concept of ordered landmarks in planning
The effect of ordered landmarks on plan length in forward search
A lot of research has been conducted to make the task of plan generation more efficient. One idea to do so is the use of landmarks, which are sub-goals that must be true in every solution to the problem. The approximation of landmarks has a lower complexity than solving the task
...
Learning Patterns in Train Position Data
Classifying locations by identifying station specific patterns
Solutions for the Train Unit Shunting Problem are constantly being researched and improved to be- come more efficient and match the needs of train transport in the Netherlands. For this reason, we are exploring new ways to find patterns in the train data to identify where those s
...
Learning Patterns in Train Position Data
Classifying locations by identifying station specific patterns
Solutions for the Train Unit Shunting Problem are constantly being researched and improved to be- come more efficient and match the needs of train transport in the Netherlands. For this reason, we are exploring new ways to find patterns in the train data to identify where those s
...
Detecting Patterns in Train Position Data of Trains in Shunting Yards
Analysis of Arrival Time Distributions and Delays
Shunting yards are locations next to train stations that serve as parking places for trains when they are not in operation and often contain facilities for maintenance and cleaning for passenger trains. Planning of the tasks regarding shunting trains involves routing, assignment
...
Learning Patterns in Train Position Data
Automatic Detection of Whether a Solution of the Train Unit Shunting Problem (TUSP) is a Week or a Weekend Day
When not in service, trains are parked and serviced at shunting yards. The Train Unit Shunting Problem (TUSP), an NP-hard problem, encompasses the challenge of planning movements and tasks in shunting yards. A feasible shunting plan serves as a solution to the TUSP. Current autom
...
This paper explores the application of landmark-based planning algorithms, specifically focusing on AND/OR landmark extraction methods. Drawing from classical planning principles and recent advancements, we investigate the effectiveness of landmark extraction in guiding the searc
...
Over 700 trains in the Netherlands are used daily for passenger transportation. Train operations involve tasks like parking, recombination, cleaning, and maintenance, which take place in shunting yards. The train unit shunting problem (TUSP) is a complex planning problem made mor
...
When not in use, trains are stored at shunting yards, where they may need servicing. Planning for where the rolling stock should be parked during its stay at the yard is known as the Train Unit Shunting Problem (TUSP) and it is NP-hard. Algorithmic planners can assist with this c
...
The Fast Downward planning system is currently mainly used for solving classical problems. Another alternative to Fast Downward is SymbolicPlanners, which sacrifices speed for generality and extensibility. SymbolicPlanners is missing landmark based planners and landmark extractio
...
This research aims to find patterns in the live position data of trains within shunting yards. These patterns can be converted to heuristics and applied in algorithms developed by railway operators in the Netherlands to tackle the Train Unit Shunting Problem. The usage patterns w
...
This paper analyses manually realised solutions to the Train Unit Shunting Problem (TUSP) to find patterns in train type. The parking element is most important for the TUSP. Therefore, this research specifically investigates the presence of train type patterns in parking track an
...