Optimization heuristics for the combinatorial auction problem

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 3, Issue , 2003, Pages 1588-1595

  Schwind, Michael ^a   Stockheim, Tim ^a   Rothlauf, Franz ^b  

^a Dept of Economics Esp Information Systems   (Germany)

^b Dept of Information Systems i Schloss ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMICS; GENETIC ALGORITHMS; SIMULATED ANNEALING;

COMBINATORIAL AUCTION; COMBINATORIAL AUCTION PROBLEMS; COMPUTATIONAL EFFORT; DISTRIBUTED INFORMATION SERVICES; META-HEURISTIC APPROACH; OPTIMIZATION HEURISTICS; REAL TIME EXECUTION; RESOURCE ALLOCATION PROCESS;

PROCESS CONTROL;

EID: 84901470276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299862     Document Type: Conference Paper

References (27)

1. J. O. Kephart, T. Hogg, and B. A. Huherman, The Ecology of Conrputation, North-Holland, Amsterdam, 1988.
2. W. E. Walsh and M. P. Wellman, "A market protocol for decentralized task allocation", in Revised and extended version of a paper presented at the Third Inrernatioiial Corference on Multiagent Sqstenis (ICMAS- 98). Paris, France, 1998, pp. 325-332.
3. D. C. Parkes, "Optimal auction design for agents with hard valuation problems", in Agent mediated Electronic Conumerce II: Towards Next Generation Agent Based Electroriic Commerce Swrenis, E Ygge A. Mouskas, C. Sierra, Ed., Berlin, 2000. AmECE, vol. 1972 of Lecture Notes in Artificial Intelligence, Springer.
4. Y. Fujishima, K. Leyton-Brown, and Y. Shoham, "Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches", in Proceedings of the International Joint Conference on Artificial Intelligence 1999 (IJCAI-99), Stockholm. Swederi, 1999.
5. S. De Vries and R. Vohra, "Combinatorial auctions: A survey", INFORMS Journal on Computing, 2001.
6. V. Chandru and M. R. Rao, "Integer programming", Tech. Rep. T.R.No. IISc-98-04, Department of Computrr Science and Automotion, Indian Institute of Science, Bangalore, India, 1998.
7. Arne Anderson, Mattias Tenhunen, and Fredrik Ygge, "Integer programming for combinatorial auction winner determination", in Proceedings of the Fourth lriternational Conference on Multi-Agent Systenis (ICMAS '00). Boston, MA, 2000, pp. 39-46 .
8. Tuomas Sandholm, "Algorithm for optimal winner determination in combinatorial auctions", Artificial Intelligence, vol. 135. no. 1-2, pp. 1-54, 2002.
9. T. Sandholm, S. Suri, A. Gilpin, and D. Levine, "CABOB: A fast optimal algorithm for combinatorial auctions". in Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-01). Seattle, WA, 2001, pp. 1102-1108.
10. H. Hoos and C. Boutilier, "Solvingcomhinatorial auctions using stochastic local search, in Proceedings at the 17th National Conference on Artificial Intelligence (IAAI), Austin, TX. AAAI, 2000, pp. 22-29.
11. J. Collins, M. Gini, and B. Mobasher, "Multi-agent negotiation using combinatorial auctions with precedence constraints", Tech. Rep. T.R.No. 02-009, University of Minnesota, Department of Computer Science and Engineering, Minneapolis, MN, 2002.
12. A. Easwaran and J. Pitt, "A brokering algorithm for cost & QoS-based winner determination in combinatorial auctions", in Intelligent Problem Solving, Methodologies and Approaches, 13th International Conference on Itidustrial and Engineering Applications of Artificial lntelligence and Expert Systenu (IEMAIE 2000). New Orleans, LU, R. Loganantharaj and G. Palm. Eds., Berlin. Germany, 2000, vol. 1821 of Lecture Notes in Coniputer Science, Springer.
13. P. C. Chu and I. E. Beasley, "A genetic algorithm for the set partitioning problem", Tech. Rep., The Management School Imperial College London, 1995.
14. D. Levine, A Parallel Genetic Algoritlmfor the Set Partitioning Problem, PhD thesis, Argonne National Lahoratory, Argonne, IL, 1994.
15. S . Kirkpatrick, C. D. Gelatt and M. P. Vecchi, "Optimization by simulated annealing", Science. vol. 220, pp. 671-680.1983.
16. N. Metropolis, A. W. Rosenhluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, 'Equation of state calculations by fast computing machines", Jounial of Chem. Phys., vol. 21. no. 6, pp. 1087-1092, 1953. .
17. E. Sundermann and I. Lemahieu, "PET image reconstruction using simulated annealing", in Proceedings of the SPIE Medical Imaging '95 (Image Processing). SPIE, 1995, pp. 378-386.
18. J. C. Bean, "Genetics and random keys for sequencing and optimization", Technical Report 92-43, Department of Industrial and Operations-Engineering, University of Michigan, Ann Arbor, 'MI, June 1992.
19. I. C. Bean, "Genetic algorithms and random keys for sequencing and optimization", URSA Journal on Computing, vol. 6, no. 2, pp. 154-160, 1994.
20. B. A. Norman and I. C. Bean. "Random keys genetic algorithm for job shop scheduling", Tech. Rep. No. 94-5, The University of Michigan, Ann Arbor, MI, 1994.
21. B. A. Norman and J. C. Bean, "Scheduling operations on parallel machines". IIE Transactions, vol. 32, no. 5, pp. 449-459.2000.
22. B. A. Norman and J. C. Bean, "Operation sequencing and tool assignment for multiple spindle CNC machines", in Proceedings of the Forth International Conference on Evolutionary Computation, Piscataway, NJ, 1997;pp. 425-430, IEEE.
23. B. A. Norman, Scheduling .Using the Random Kevs Genetic Algorithm, unpublished PhD thesis, University of Michigan, Ann Arbor, Michigan, 1995.
24. B. A. Norman and A. E. Smith, "Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout.problems", in Proceedings of the Forth International Conference on Evolutionary Computation, Piscataway, NJ, 1997. pp. 407-411, IEEE.
25. B. A. Norman, A. E. Smith, and R. A. Arapoglu, "Integrated facility design using an evolutionary approach with a subordinate network algorithm", in Parallel Probleni Solving from Nature. PPSN V, A. E. Eihen, T. Back, M. Schoenauer, and H.-P. Schwefel, Eds., Berlin, 1998, pp. 937-946, Springer-Verlag.
26. E Rothlauf, D. E. Goldberg, and A. Heinrl, "Network random keys - A tree network representation scheme for genetic and evolutionary algorithms", Evolutiotion Coniputation, vol. 10, no. 1, pp. 75-97, 2002.
27. D. E. Goldberg, Genetic algorithms in search, optimization, and machine learning, Addison-Wesley. Reading, MA, 1989.