Follow the perturbed approximate leader for solving semi-bandit combinatorial optimization.
Feidiao YangWei ChenJialin ZhangXiaoming SunPublished in: Frontiers Comput. Sci. (2021)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- branch and bound
- branch and bound algorithm
- optimization problems
- combinatorial problems
- mathematical programming
- graph theory
- memetic algorithm
- vehicle routing problem
- quadratic assignment problem
- random sampling
- genetic algorithm
- combinatorial search
- estimation of distribution algorithms
- exact algorithms
- path relinking
- evolutionary algorithm