| Abstract: | In this paper a practical technique for finding improved airline routings and schedules is developed. A dynamic programming algorithm is combined with a heuristic method for assigning routes to the aircraft such that the expected total contribution to profit is maximum. Expected passenger demands and priorities are taken to be an input to the model. The model may be used to check the effect on the total system of adding or removing aircraft or of varying aircraft capacity. Although the test runs were made on data for a six city‐ten aircraft array a smaller, more simple numerical example is given to demonstrate the model logic. |
