Developing GA-based hybrid approaches for a real-world mixed-integer scheduling problem

Tools

Dahal, K. and Galloway, S.J. and Aldridge, C. (2003) Developing GA-based hybrid approaches for a real-world mixed-integer scheduling problem. In: Congress on Evolutionary Computation (CEC), 2003-12-08 - 2003-12-12. (https://doi.org/10.1109/CEC.2003.1299904)

Full text not available in this repository.Request a copy

Abstract

Many real-world scheduling problems are suited to a mixed-integer formulation. The solution of these problems involves the determination of integer and continuous variables at each time interval of the scheduling period. The solution procedure requires simultaneous consideration of these two types of variables. In recent years researchers have focused much attention on developing new hybrid approaches using modern heuristic and traditional exact methods. This paper proposes the development of a variety of hybrid approaches that combines heuristics and mathematical programming within a genetic algorithm (GA) framework for a real-world mixed integer scheduling problem, namely the generation scheduling (GS) problem in electrical power systems. The problem is to define on/off decisions and generation levels for each generator in a power system for each scheduling interval. This paper investigates how the optimum or near optimum solution for the GS problem may be quickly identified. The results obtained are promising and show that the hybrid approach offers an effective alternative for solving the GS problems within a realistic timeframe.

ORCID iDs

Dahal, K., Galloway, S.J. ORCID logoORCID: https://orcid.org/0000-0003-1978-993X and Aldridge, C.;
CORE (COnnecting REpositories)