This work introduces an algorithm for the constrained shortest path problem in dynamic environments, such as flight dispatching. The algorithm operates on a three-dimensional graph to process horizontal and vertical optimization in one step. The performance benchmarks and memory consumption statistics are presented and show that it is highly efficient. The calculated flight routes are competetive to state-of-the-art optimizers. Moreover, a new framework for analysing flight dispatching is introduced in this thesis. With its flexibilty, modularity, and extensibility, it enables to create new algorithms for flight dispatching by focussing on the algorithmic details and not on the global environment. It is delivered with generated test data,covering different aspects of flight dispatching, that can be used for testing the algorithms.
