RAS Problem Solving Competition
Jump to 2012 - Movement Planner Algorithm Design for Dispatching on Multi-Track Territories
Applying Advanced Analytics to Railroad Problems for Fun and Prizes!
Purpose
The railroad operations are inherently complex/large scale and source of many challenging OR problems. This competition is designed to introduce participants to railroad problems, an exciting and challenging application area for Operations Research and Management Sciences.
Can I Publish?
Yes, you can. In fact, RAS encourages you to do so. You can reference the year specific competition URL becasue we will not change the URL. Anyone can use the RAS competition problem and provided datasets in their publication.
Also, The first prize winner’s contribution will be considered for publication in Networks. The paper still needs to go through the journal’s normal refereeing procedure; however, the paper will receive an expedited refereeing and publication process. More details about this journal can be found here.
Eligibility
This competition is intended to attract new interest in the rail operations research arena. Anyone who is new to railroad problems or new to OR is welcome to participate. Anyone interested in participating can apply before the last date and will be accepted by the Judging Panel at their discretion. At least one member of each prize winning team must be available to present the team’s approach and results at the INFORMS Annual Meeting.
RAS officers, Organizing Committee Members, Employees affiliated with Sponsors are NOT eligible to participate. The Organizing Committee members may NOT help and guide any participating team.
Editions
Information about the 2012 edition of the RAS Problem Solving Competition is available now. If you have any suggestions or ideas for future competitions, please feel free to contact Kamalesh Somani (Kamalesh_Somani@CSX.com) or Homarjun Agrahari (homarjun.agrahari@BNSF.com). All feedback is greatly appreciated.
