Initial Populations with a Few Heuristic Solutions Significantly Improve Evolutionary Multi-Objective Combinatorial Optimization.
Cheng GongYang NanLie Meng PangHisao IshibuchiQingfu ZhangPublished in: SSCI (2023)
Keyphrases
- combinatorial optimization
- evolutionary multi objective
- optimization algorithm
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- branch and bound
- simulated annealing
- branch and bound algorithm
- optimization problems
- mathematical programming
- combinatorial problems
- multi objective genetic algorithm
- hard combinatorial optimization problems
- genetic algorithm
- multi objective
- job shop scheduling problem
- combinatorial search
- max flow min cut
- differential evolution
- optimization method
- submodular functions
- search algorithm