Generalized Simulated Annealing with Sequentially Modified Cost Function for Combinatorial optimization Problems.
Jiayin ChenHendra I. NurdinPublished in: ANZCC (2019)
Keyphrases
- combinatorial optimization problems
- simulated annealing
- metaheuristic
- cost function
- combinatorial optimization
- optimization problems
- global minimum
- discrete optimization
- tabu search
- ant colony optimization
- genetic algorithm
- optimization methods
- evolutionary algorithm
- simulated annealing algorithm
- knapsack problem
- job shop scheduling problem
- optimization method
- shortest path problem
- vehicle routing problem
- continuous optimization problems
- traveling salesman problem
- job shop scheduling
- benchmark problems
- genetic algorithm ga
- objective function
- global optimum
- hill climbing
- exact algorithms
- solution quality
- hybrid algorithm
- search methods
- quadratic assignment problem
- continuous optimization
- min cost
- branch and bound
- aco algorithms
- memetic algorithm
- branch and bound algorithm
- heuristic search
- multi objective
- optimization criterion
- interval data
- search algorithm
- minmax regret