Linearly priced timed automata for the bus schedule assignment problem

Papers dealing with optimization problems in public transportation usually follow the same methodology. The problem is modeled in a classical mathematical way, and then either solved directly using mathematical programming methods, or by the application of combinatorial heuristics. Even if this process yields an optimal solution, it might prove complicated to apply the achieved results directly in practice. In a transportation system, solutions for individual problems are only part of a more complex process, and they are often used only to aid experts in making decisions. However, the structure of the problem and the steps taken to achieve the solution are often lost in the solution process, while they might prove extremely useful to a human planner. This paper introduces a linearly priced timed automata model for the bus schedule assignment problem. With its help, the steps taken to achieve any feasible solution of the problem can be easily reconstructed, providing another tool for human experts to use in their decision planning process.