A heuristic to generate initial feasible solutions for the Unit Commitment problem.
Yi SunAlbert Y. S. LamVictor O. K. LiPublished in: IJCNN (2014)
Keyphrases
- feasible solution
- unit commitment
- lagrangian relaxation
- tabu search
- mixed integer programming
- linear programming
- optimal solution
- solution quality
- mixed integer
- objective function
- mixed integer program
- mathematical model
- power generation
- linear programming relaxation
- convex hull
- infeasible solutions
- electricity markets
- electric power
- integer solution
- column generation
- integer programming
- linear program
- metaheuristic
- simulated annealing
- search algorithm
- branch and bound algorithm
- branch and bound
- optimization problems
- dynamic programming
- lower bound