NRNarayan Rangaraj

Narayan Rangaraj

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Narayan Rangaraj has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Heuristic for Railway Crew Scheduling With Connectivity of Schedules

    by Akshat Bansal, Kezhe Perumpadappu Anoop, Narayan Rangaraj

    This paper addresses the crew scheduling for long-distance passenger train services. A heuristic with bin packing features is developed to generate repeatable crew schedules that satisfy the operational and crew allocation rules. By ensuring the connectivity of crew duties that can be repeated over periodic train schedules, a better estimate of the crew requirement in a region is also obtained. Further, the heuristic ensures a fair division of the total workload and creates long duty cycles, which also makes the process of cyclic rostering easier. The paper also presents an exact approach for crew scheduling using a combination of constraint programming and set covering formulations. The exact approach is not computationally viable for practical scale problem instances, but the heuristic generates good quality solutions (often very close to optimal) even on large data sets. We illustrate the approach on data from the Mumbai Division in Indian Railways and the computational results show that there is potential to reduce the total number of crew duties in the region by around 12%. The heuristic approach provides an efficient way to generate improved crew schedules every time there is a change in the train timetable.


  • Development of a railway junction simulator for evaluation of control strategies and capacity utilization optimization

    by Sudhanshu Shekhar, Abhishek Singh, Madhu N. Belur, Narayan Rangaraj

    This paper focuses on the development of a Python based tool for analysis and simulation of mixed rail traffic at a railway junction. The tool is helpful for evaluating various open-loop and feedback based strategies for an optimum junction utilization. The tool is implemented in Python using graph theory for finding shortest paths between various source-destination pairs. What signifies a railway junction, as opposed to a railway section is the possibility and the need to allow multiple simultaneous movements within the junction area. The tool applies network (edge and node) based approach for designing the line infrastructure of a railway junction. Source and destination are represented as nodes and every path from a source to a destination through a junction consists of a set of permissible combination of edges and nodes. This tool can be used for simulating scheduled passenger trains through all the allowed paths, and then selecting the best path for traversing through the junction. Further, lower priority trains are scheduled without affecting the edge/node occupancies trains of higher priorities. The best freight paths are identified and a more accurate estimate of the time required for freight trains to pass through the junction is obtained using this tool. In this way, one is able to quantify and then optimize the capacity/utilization of railway junction. In a larger scenario, the tool is useful for identifying bottlenecks in a given infrastructure. As examples, a detailed analysis of Allahabad junction and Kanpur junction of Indian Railways is presented using the tool.