Feasible modified subgradient method for solving the thermal unit commitment problem as a new approach.
Filik, Ummuhan Basaran, Kurban, Mehmet (2010)
Mathematical Problems in Engineering
Similarity:
Filik, Ummuhan Basaran, Kurban, Mehmet (2010)
Mathematical Problems in Engineering
Similarity:
Filik, Ümmühan Başaran, Kurban, Mehmet (2010)
Mathematical Problems in Engineering
Similarity:
Huseyin Balci, Jorge Valenzuela (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper describes a procedure that uses particle swarm optimization (PSO) combined with the Lagrangian Relaxation (LR) framework to solve a power-generator scheduling problem known as the unit commitment problem (UCP). The UCP consists of determining the schedule and production amount of generating units within a power system subject to operating constraints. The LR framework is applied to relax coupling constraints of the optimization problem. Thus, the UCP is separated into independent...
S., Paulraj, P., Sumathi (2010)
Mathematical Problems in Engineering
Similarity:
Yi-Chih Hsieh (2002)
The Yugoslav Journal of Operations Research
Similarity:
Luo, Xiao, Chung, Chi-Yung, Yang, Hongming, Tong, Xiaojiao (2011)
Mathematical Problems in Engineering
Similarity:
John Sylva, Alejandro Crema (2008)
RAIRO - Operations Research
Similarity:
An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.
M. Minoux, J. Y. Serreault (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Moncef Abbas, Djamal Chaabane (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.
Yeniay, Ozgur (2005)
Mathematical Problems in Engineering
Similarity: