EVOLVING EFFECTIVE BIDDING FUNCTIONS FOR AUCTION BASED RESOURCE ALLOCATION FRAMEWORK

Mohamed Bader-El-Den, Shaheen Fatima

Abstract

In this paper, we present an auction based resource allocation framework. This framework, called GPAuc, uses genetic programming for evolving bidding functions. We describe GPAuc in the context of the exam timetabling problem (ETTP). In the ETTP, there is a set of exams, which must be assigned to a predefined set of slots. Here, the exam time tabling system is the seller that auctions a set of slots. 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 need to find the bidders’ optimal bids. This is done using genetic programming. The effectiveness of GPAuc is demonstrated experimentally by comparing it with some existing benchmarks for exam time-tabling.

References

  1. Asmuni, H., Burke, E. K., Garibaldi, J. M., and McCollum, B. (2004). Fuzzy multiple heuristic orderings for examination timetabling. In Burke, E. K. and Trick, M. A., editors, PATAT, volume 3616 of Lecture Notes in Computer Science, pages 334-353. Springer.
  2. Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., and Qu, R. (2007). A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research, 176(1):177-192.
  3. Carter, M. W., Laporte, G., and Lee, S. Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of Operational Research Society, 47:73-83.
  4. Koza, J. R. (1992). Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge, MA, USA.
  5. Krishna, V. (2002). Auction Theory. Academic Press.
  6. Langdon, W. B. and Poli, R. (2002). Foundations of Genetic Programming. Springer-Verlag.
  7. Poli, R., Langdon, W. B., and McPhee, N. F. (2008). A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gpfield-guide.org.uk.
  8. Welsh, D. and Powell, M. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10(1):85-87.
Download


Paper Citation


in Harvard Style

Bader-El-Den M. and Fatima S. (2009). EVOLVING EFFECTIVE BIDDING FUNCTIONS FOR AUCTION BASED RESOURCE ALLOCATION FRAMEWORK . In Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009) ISBN 978-989-674-014-6, pages 310-313. DOI: 10.5220/0002324203100313


in Bibtex Style

@conference{icec09,
author={Mohamed Bader-El-Den and Shaheen Fatima},
title={EVOLVING EFFECTIVE BIDDING FUNCTIONS FOR AUCTION BASED RESOURCE ALLOCATION FRAMEWORK},
booktitle={Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)},
year={2009},
pages={310-313},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002324203100313},
isbn={978-989-674-014-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)
TI - EVOLVING EFFECTIVE BIDDING FUNCTIONS FOR AUCTION BASED RESOURCE ALLOCATION FRAMEWORK
SN - 978-989-674-014-6
AU - Bader-El-Den M.
AU - Fatima S.
PY - 2009
SP - 310
EP - 313
DO - 10.5220/0002324203100313