Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem.
Oliver G. CzibulaHanyu GuYakov ZinderPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- lagrangian relaxation
- metaheuristic
- feasible solution
- tabu search
- optimal solution
- branch and bound algorithm
- integer programming
- combinatorial optimization
- simulated annealing
- lower bound
- column generation
- optimization problems
- ant colony optimization
- linear programming
- search space
- scatter search
- np hard
- lower and upper bounds
- total weighted tardiness
- genetic algorithm
- path relinking
- dynamic programming
- combinatorial optimization problems
- branch and bound
- mixed integer programming
- particle swarm optimization
- vehicle routing problem
- evolutionary algorithm
- shortest path
- memetic algorithm
- mixed integer program
- objective function
- mixed integer
- single machine scheduling problem
- valid inequalities
- search procedure
- harmony search
- linear program
- traveling salesman problem
- neural network
- benchmark instances
- special case
- job shop scheduling problem
- multi objective
- knapsack problem
- upper bound