A Metaheuristic Relying on Random Walk on a Graph for Binary Optimization Problems.
Takuya SatoKei OhnishiPublished in: SMC (2018)
Keyphrases
- random walk
- metaheuristic
- optimization problems
- tabu search
- evolutionary algorithm
- directed graph
- scatter search
- ant colony optimization
- simulated annealing
- combinatorial optimization
- markov chain
- vehicle routing problem
- objective function
- genetic algorithm
- cost function
- benchmark problems
- flow graph
- search space
- optimal solution
- link prediction
- iterated local search
- transition probability matrix
- transition probabilities
- particle swarm optimization
- graph laplacian
- markov random walk
- hyper graph
- greedy randomized adaptive search procedure
- traveling salesman problem
- set of benchmark instances
- nodes of a graph
- spectral graph partitioning
- graph theory
- bipartite graph
- approximation algorithms
- reinforcement learning