Abstract
SUMMARYThis paper explores the use of genetic algorithms (GAs) in the development of the bidding strategies used by generation companies under two different market clearing mechanisms, uniform pricing and pay‐as‐bid pricing. The bidding strategies are represented by two modifications of a classical data processing structure known as finite‐state automata. Semi‐fixed fitness function and co‐evolutionary fitness function were incorporated in our GA. A third simple representation to obtain a comparison baseline for the other two representations, showing how their behaviors compare with a “standard” solution, was also incorporated. The strategies developed by our method were adaptive, and all GA types were based on maximizing profit in a competitive bidding situation. Copyright © 2011 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
