The aim of this study is to provide a balanced distribution of air traffic controller workload (ATCW) across airspace sectors taking into account the complexity of airspace sectors and the factors affecting ATCW, both objective and perceived. Almost all the studies focusing on the airspace sectorisation problem use heuristic or metaheuristic algorithms in dynamic simulation environments instead of a mathematical modelling approach. The paper proposes a multi-objective mixed integer mathematical model for airspace sectorisation. The model is applied to the upper, en-route level of Turkish airspace. Geographical information systems (GIS) are used to advantage for airspace analysis. The multi-objective model developed in this paper is scalarised by using the conic scalarisation method. For solving the scalarised problem, the CPLEX and DICOPT solvers of GAMS software are implemented. Finally, the optimal sector boundaries of Turkish airspace are defined.

An algorithm for enumerating all nondominated vectors of multiple objectiveinteger linear programs is presented. The method tests different regionswhere candidates can be found using an auxiliary binary problem for trackingthe regions already explored. An experimental comparision with our previousefforts shows the method has relatively good time performance.


We develop a discrete-time approximation technique dealing with the time-cost trade-off problem in PERT networks. It is assumed that the activity durations are independent random variables with generalized Erlang distributions, in which the mean duration of each activity is a non-increasing function of the amount of resource allocated to it. It is also assumed that the amount of resource allocated to each activity is controllable. Then, we construct an optimal control problem with three conflicting objective functions. Solving this optimal control problem, optimally, is impossible. Therefore, a discrete-time approximation technique is applied to solve the original multi-objective optimal control problem, using goal attainment method. To show the advantages of the proposed technique, we also develop a Simulated Annealing (SA) algorithm to solve the problem, and compare the discrete-time approximation results against the SA and also the genetic algorithm results.

In the present paper a complete procedure for solvingMultiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.