Planning and clarifying a sustainable approach to solve the problem of scheduling the train running in line one of the Tehran Metro in conditions of uncertainty through particle swarm optimization

Abstract

Reliability and punctuality in the traffic supervision of the metro network are amongst the key performance indicators for the evaluation of this industry's efficiency which can lead to the satisfaction of the participants. A common technique to improve the level of reliability and the performance of Metro traffic control systems is to train to receive and dispatch the position, especially in the different periods of designing train timetables, which can be out-of-the-way or lead to a stable level. Therefore, to increase the permanency level of the metro timetables, the operators of the traffic control center in the metro network consider fixed time values as Buffer times between rail events with a high probability of flaws using normal procedures in the timetables. In this respect, the first event of delay in the metro network is the possibility of its spread in all of the lines and its effect that will be realized on all of the entities and the existence of subsequent unlucky consequences that will be prevented. Adding to this, Buffer time in the train schedule in some cases may cause the capacity of the subway network reduced, which could be the basis of traffic effects for eventful lines such as line one of the Tehran Metro. However, the ability of time tables to add fixed times values as a Buffer time between two conflicting events in the metro network can be whispered that in this case, it is necessary to allocate Buffer times with sufficient accuracy and according to the traffic priorities of dispatching and receiving trains. Some important events in Metro passenger activities (such as unexpected dispatches) take place properly and prevent certain incidents. In the current study, the goal of cultivating and improving the stability of train running schedule tables by assigning optimum Buffer s in the network times has been studied utilizing innovative methods. Therefore, resources for allocation optimum time have been modeled via combinatorial optimization algorithms and particle swarm optimization methods. In this algorithm, each Buffer time according to the priority of the events and according to the technical, economic, and operational criteria is shown to one of the existing assignments of the schedule tables which findings and its effects in terms of time units (seconds). In the end, the validity of the offered model that is presented utilizing line one of the Tehran Metro is tested.