Heuristics for a facility location problem with a quadratic objective function

Facility location problems are an important set of problems within the field of optimisation. These problems consider which facilities to open out of a set of possible facilities and how to assign users to the open facilities. Most of the facility location problems studied have a linear objective. In this thesis, we consider a facility location...

Resolving infeasibilities in the PESP model of the Dutch railway timetabling problem

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.