Experiments on Neighborhood Combination Strategies for Bi-objective Unconstrained Binary Quadratic Programming Problem.
Li-Yuan XueRong-Qiang ZengWei AnQing-Xian WangMingsheng ShangPublished in: PAAP (2017)
Keyphrases
- bi objective
- multi objective
- efficient solutions
- set covering problem
- network design
- multiple objectives
- multi objective optimization
- shortest path problem
- ant colony optimization
- knapsack problem
- computationally efficient
- nsga ii
- particle swarm optimization
- neural network
- simulated annealing
- multi objective evolutionary algorithms
- genetic algorithm