The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems.
Méziane AïderAida-Ilham AzziMhand HifiPublished in: Knowl. Based Syst. (2023)
Keyphrases
- learning strategies
- bi objective
- benchmark problems
- simulated annealing
- learning algorithm
- dynamic programming
- minimum cost flow
- test problems
- combinatorial optimization
- active learning
- machine learning
- optimization algorithm
- computational efficiency
- np hard
- linear programming
- particle swarm optimization
- search space
- computational complexity
- shortest path problem
- differential evolution
- e learning
- efficient solutions
- decision trees
- solution quality
- objective function
- worst case