Solving Symmetric and Asymmetric Traveling Salesman Problems Through Probe Machine with Local Search.
Md. Azizur RahmanJinwen MaPublished in: ICIC (1) (2019)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- satisfy the triangle inequality
- combinatorial optimization problems
- neighborhood search
- simulated annealing
- discrete optimization problems
- metaheuristic
- combinatorial problems
- optimization problems
- bayesian decision problems
- memetic algorithm
- ant colony optimization
- vehicle routing problem
- branch and bound algorithm
- genetic algorithm
- traveling salesman
- branch and bound
- aco algorithm
- search algorithm
- tabu search
- job shop scheduling problem
- quadratic assignment problem
- hamiltonian cycle
- evolutionary algorithm
- fitness function
- search heuristics
- discrete optimization
- distance function
- np complete