Co-evolutionary hyper-heuristic method for auction based scheduling

S. Fatima, Mohamed Bader

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

Abstract

In this paper, we present a co-evolutionary hyper-heuristic method for solving a sequential auction based resource allocation problem. The method combines genetic programming (GP) for evolving agent's bidding functions for the individual auctions with genetic algorithms (GAs) for evolving an optimal ordering for auctions. The framework is evaluated in the context of the exam timetabling problem (ETTP). In this problem, there is a set of exams, which have to be assigned to a predefined set of slots. Here, the exam time tabling system is the seller that sells a set of slots in a series of auctions. There is one auction for each slot. The exams are viewed as the bidding agents in need of slots. The problem is then to find a schedule (i.e., a slot for each exam) such that the total cost of conducting the exams as per the schedule is minimised. In order to arrive at such a schedule, we find the bidders optimal bids for an auction using GP. We combine this with a GA that finds an optimal ordering for conducting the auctions. The effectiveness of this co-evolutionary method is demonstrated experimentally by comparing it with some existing benchmarks for exam timetabling.
Original languageEnglish
Title of host publicationEvolutionary Computation (CEC), 2010 IEEE Congress on
Place of PublicationPiscataway
PublisherIEEE
Pages1-8
Number of pages8
ISBN (Print)9781424469093
Publication statusPublished - Jul 2010
EventIEEE Congress on Evolutionary Computation (CEC 2010) - Barcelona Spain
Duration: 1 Jul 2010 → …

Conference

ConferenceIEEE Congress on Evolutionary Computation (CEC 2010)
Period1/07/10 → …

Keywords

  • Genetic Programming
  • Timetabling

Fingerprint

Dive into the research topics of 'Co-evolutionary hyper-heuristic method for auction based scheduling'. Together they form a unique fingerprint.

Cite this