Solving the Train Timetabling Problem by using Rapid Branching
The topic of this thesis is the implementation of rapid branching to find an integer solution for the train timetabling problem. The techniques that rapid branching are based on are presented. The important aspect of rapid branching are discussed and then the algorithm is applied to some artificial...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Optimeringslära och systemteori
2016
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-181308 |