Single minimum method for combinatorial optimization problems and an efficient algorithm of TSP problem.
Dan XuItsuo KumazawaPublished in: ICNN (1993)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- cost function
- high accuracy
- computationally efficient
- optimization algorithm
- preprocessing
- computational cost
- detection algorithm
- ant colony optimization
- objective function
- dynamic programming
- significant improvement
- probabilistic model
- detection method
- segmentation algorithm
- knapsack problem
- np hard
- k means
- optimization problems
- recognition algorithm
- segmentation method
- traveling salesman problem
- convergence rate
- learning algorithm
- similarity measure
- simulated annealing
- clustering method
- optimal solution
- hybrid algorithm
- continuous optimization problems
- search space
- energy function
- min cost
- shortest path problem
- benchmark problems
- matching algorithm
- computational complexity
- optimization method
- search strategy
- vehicle routing problem
- linear programming
- search procedure
- genetic algorithm
- exact algorithms
- branch and bound
- multi objective
- minimum cost
- optimization model
- optimization criterion