Mathematical Solutions for Solving Periodic Railway Transportation | Zendy

Miguel Á. Salido | Zendy; Federico Barber | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Mathematical Solutions for Solving Periodic Railway Transportation

Author(s) -

Miguel Á. Salido,

Federico Barber

Publication year - 2009

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2009/728916

Subject(s) - heuristics , scheduling (production processes) , mathematical optimization , computer science , job shop scheduling , operations research , engineering , mathematics , computer network , routing (electronic design automation)

Train scheduling has been a significant issue in the railway industry. Overthe last few years, numerous approaches and tools have been developed tocompute railway scheduling. In this paper, we present a set of heuristicsfor a constraint-based train scheduling tool, which is a project in collaborationwith the National Network of Spanish Railways (RENFE), Spain.We formulate train scheduling as constraint optimization problems. Threeheuristics are developed to speed up and direct the search toward suboptimalsolutions in periodic train scheduling problems. The feasibility ofour problem-oriented heuristics is confirmed with experimentation usingreal-life data. The results show that these techniques enable MIP solverssuch as LINGO and ILOG Concert Technology (CPLEX) to terminateearlier with good solutions

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research