A Bi-Objective Constrained Robust Gate Assignment Problem: Formulation, Instances and Algorithm.
Xinye CaiWenxue SunMustafa MisirKay Chen TanXiaoping LiTao XuZhun FanPublished in: IEEE Trans. Cybern. (2021)
Keyphrases
- bi objective
- dynamic programming
- randomly generated
- np hard
- optimization algorithm
- integer linear programming formulation
- shortest path problem
- branch and bound algorithm
- mathematical model
- computationally efficient
- worst case
- simulated annealing
- optimal solution
- combinatorial optimization
- convex hull
- distributed databases
- multi objective
- knapsack problem
- evolutionary algorithm
- search space
- artificial neural networks
- set covering problem
- computational complexity