Metaheuristic GRASP with Path-Relinking to the Solution of the Graph Partitioning Problem with Capacity and Connexity Constraints.
Nádia Mendes SantosGustavo Silva SemaanLuiz Satoru OchiPublished in: IDEAL (2012)
Keyphrases
- metaheuristic
- grasp with path relinking
- graph partitioning
- path relinking
- solution quality
- optimal solution
- simulated annealing
- solution space
- tabu search
- scatter search
- search procedure
- column generation
- ant colony optimization
- optimization problems
- weighted graph
- genetic algorithm
- combinatorial optimization
- search space
- integer program
- particle swarm optimization
- image segmentation
- spectral clustering
- feasible solution
- integer programming
- mixed integer
- clustering algorithm
- exact solution
- np hard
- hyper heuristics
- test problems
- global optimization
- graph model
- max min
- scheduling problem
- constraint satisfaction
- neural network