Print Email Facebook Twitter Resolving infeasibilities in the PESP model of the Dutch railway timetabling problem Title Resolving infeasibilities in the PESP model of the Dutch railway timetabling problem Author Polinder, G.J. Contributor Aardal, K.I. (mentor) Kroon, L.G. (mentor) Molinaro, M. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Applied mathematics Programme Optimisation Date 2015-08-26 Abstract Many times the railway timetabling problem is infeasible. This means a set of constraints can not be satisfied at the same time. It is hard to solve this by hand. This thesis proposed two algorithm to resolve the infeasibilities and to come up with a timetable. It serves as an extention to the CADANS solver. Subject CADANSMIPPESPTimetablingRailwaysOptimisation To reference this document use: http://resolver.tudelft.nl/uuid:ed4c1256-700c-4e04-8da0-d8cb3fa74b8b Part of collection Student theses Document type master thesis Rights (c) 2015 Polinder, G.J. Files PDF MSc_report_Gert-Jaap_Polinder.pdf 4.3 MB Close viewer /islandora/object/uuid:ed4c1256-700c-4e04-8da0-d8cb3fa74b8b/datastream/OBJ/view