Comparing data-driven meta-heuristics for the bi-objective Component Repairing Problem.
Claudia DiamantiniAlex MircoliOrnella PisacaneDomenico PotenaPublished in: DASC/PiCom/CBDCom/CyberSciTech (2022)
Keyphrases
- bi objective
- metaheuristic
- ant colony optimization
- data driven
- optimization problems
- multi objective
- simulated annealing
- hybrid algorithms
- tabu search
- genetic algorithm
- swarm intelligence
- combinatorial optimization problems
- search space
- optimal solution
- particle swarm optimization
- multi objective optimization
- traveling salesman problem
- search methods
- efficient solutions
- combinatorial optimization
- nature inspired
- knapsack problem
- path relinking
- scatter search
- network design
- vehicle routing problem
- shortest path problem
- combinatorial problems
- variable neighborhood search
- hybrid algorithm
- multiple objectives
- portfolio optimization
- benchmark instances
- nsga ii
- solution quality
- routing problem
- cost function
- specific problems
- benchmark problems
- search algorithm