ubahn
Solver for the Rapid Transit Challenge problem
This program computes an optimal solution to the Rapid Transit Challenge - Class B, where the transportation network is given in a specific XML-format. A detailed description of the algorithm as well as the proof of correctness can be found in:
Welz, Wolfgang A. "Robot Tour Planning with High Determination Costs - Routing under Uncertainty." (2014). http://dx.doi.org/10.14279/depositonce-4300
Requirements
- IBM CPLEX and Concert
- LEDA
- Apache Xerces
- Boost (C++ Libraries)