Dynamic airspace sectorization problem using hybrid genetic algorithm
Information Systems and Technologies to Support Learning: Proceedings of EMENA …, 2019•Springer
In this paper, we are interested in a dynamic airspace sectorization problem (ASP) with
constraints. The objective is to minimize the coordination workload between adjacent
sectors and to balance the workload across the sectors. We modeled this problem in the
form of multi-objective optimization problem that can be transformed into a mono-objective
problem with dynamic weights between the objective functions. To solve the ASP problem
we used a hybrid genetic algorithm. The proposed model is illustrated by a numerical …
constraints. The objective is to minimize the coordination workload between adjacent
sectors and to balance the workload across the sectors. We modeled this problem in the
form of multi-objective optimization problem that can be transformed into a mono-objective
problem with dynamic weights between the objective functions. To solve the ASP problem
we used a hybrid genetic algorithm. The proposed model is illustrated by a numerical …
Abstract
In this paper, we are interested in a dynamic airspace sectorization problem (ASP) with constraints. The objective is to minimize the coordination workload between adjacent sectors and to balance the workload across the sectors. We modeled this problem in the form of multi-objective optimization problem that can be transformed into a mono-objective problem with dynamic weights between the objective functions. To solve the ASP problem we used a hybrid genetic algorithm. The proposed model is illustrated by a numerical example from a real life problem.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果