Priority Based Train Scheduling Method Using ACO in Indian Railway Perspective

Railway scheduling system using repair-based approach

In this paper, we propose an approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly flawed schedule and searches through the space of possible repairs. Based on the observation that the decision of the track assignments of trains would influence thepe$onnance of the resulting schedule, we divide the scheduling process into two levels. In ...

Scheduling Scientific Workflow Based Application Using ACO in Public Cloud

Scientific workflows comprising of many computational tasks including data dependency may require multiple and heterogeneous amount of computing resources during runtime. Scheduling such workflows with the objective of achieving minimal makespan and cost and maximal resource usage is a challenge in any computing environment. The researchers aim at developing novel algorithm to schedule scientif...

Intelligent Train Scheduling on a High-Loaded Railway Network

We present an interactive application to assist planners in adding new trains on a complex railway network. It includes many trains with different characteristics, whose timetables cannot be modified because they are already in circulation. The application builds the timetable for new trains linking the available time slots to trains to be scheduled. A very flexible interface allows the user to...

Optimal Trajectory Planning and Train Scheduling for Railway Systems

A Buffer Scheduling Method Based on Message Priority in DTNs

Routing protocols in DTNs usually utilize multiple message copies to guarantee the message delivery, in order to overcome unpredictable node mobility and easily-interrupted connections. A store-carry-and-forward paradigm was also proposed to further improve the message delivery. However, excessive message copies lead to the shortage of buffer and bandwidth. The spray and Wait routing protocol h...