Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization.
Deokjae LeeHyun Oh SongKyunghyun ChoPublished in: CoRR (2024)
Keyphrases
- combinatorial optimization
- multi objective
- batch mode
- evolutionary algorithm
- simulated annealing
- metaheuristic
- traveling salesman problem
- optimization problems
- combinatorial optimization problems
- branch and bound
- multi objective optimization
- optimization algorithm
- genetic algorithm
- branch and bound algorithm
- forward selection
- combinatorial problems
- mathematical programming
- quadratic assignment problem
- objective function
- particle swarm optimization
- greedy algorithm
- random selection
- estimation of distribution algorithms
- multiobjective optimization
- search algorithm
- active learning
- exact algorithms
- training set
- nsga ii
- control policy
- path relinking
- fitness function
- multiple objectives
- search space
- optimal policy
- memetic algorithm
- conflicting objectives
- multi objective optimization problems
- feature selection
- single machine scheduling problem
- particle swarm
- search procedure
- vehicle routing problem
- ant colony optimization
- evolutionary computation