A novel two-archive matching-based algorithm for multi- and many-objective optimization.
Chunteng BaoLihong XuErik D. GoodmanPublished in: Inf. Sci. (2019)
Keyphrases
- matching algorithm
- learning algorithm
- computational cost
- matching process
- high accuracy
- dynamic programming
- detection algorithm
- significant improvement
- cost function
- optimal solution
- tree structure
- theoretical analysis
- computationally efficient
- times faster
- expectation maximization
- recognition algorithm
- worst case
- np hard
- similarity measure
- simulated annealing
- linear programming
- particle swarm optimization
- probabilistic model
- experimental evaluation
- k means
- search space
- computational complexity
- objective function
- knapsack problem
- metadata