Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization.
Gintaras PalubeckisArunas TomkeviciusArmantas OstreikaPublished in: Appl. Math. Comput. (2019)
Keyphrases
- bipartite graph
- variable neighborhood search
- simulated annealing
- metaheuristic
- tabu search
- neighborhood search
- search procedure
- maximum matching
- path relinking
- vehicle routing problem
- benchmark instances
- evolutionary algorithm
- genetic algorithm
- scatter search
- solution space
- heuristic methods
- link prediction
- combinatorial optimization
- solution quality
- hybrid algorithm
- feasible solution
- ant colony optimization
- memetic algorithm
- maximum cardinality
- job shop scheduling problem
- graph model
- benchmark problems
- objective function
- hill climbing
- genetic algorithm ga
- routing problem
- traveling salesman problem
- edge weights
- max sat
- hybrid method
- scheduling problem
- supervised learning
- semi supervised
- search algorithm