Skip to main content

2017 | OriginalPaper | Buchkapitel

A Discrete Particle Swarm Algorithm for Combinatorial Auctions

verfasst von : Fu-Shiung Hsieh

Erschienen in: Advances in Swarm Intelligence

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Although combinatorial auctions make trading goods between buyers and sellers more conveniently, the winner determination problem (WDP) in combinatorial auctions poses a challenge due to computation complexity. In this paper, we consider combinatorial auction problem with transaction costs, supply constraints and non-negative surplus constraints. We formulate the WDP of combinatorial auction problem as an integer programming problem formulation. To deal with computational complexity of the WDP for combinatorial auctions, we propose an algorithm for finding solutions based on discrete PSO (DPSO) approach. The effectiveness of the proposed algorithm is also demonstrated by several numerical examples.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Pekeč, A., Rothkopf, M.H.: Combinatorial auction design. Manag. Sci. 49, 1485–1503 (2003)CrossRefMATH Pekeč, A., Rothkopf, M.H.: Combinatorial auction design. Manag. Sci. 49, 1485–1503 (2003)CrossRefMATH
3.
Zurück zum Zitat Rothkopf, M., Pekeč, A., Harstad, R.: Computationally manageable combinational auctions. Manag. Sci. 44, 1131–1147 (1998)CrossRefMATH Rothkopf, M., Pekeč, A., Harstad, R.: Computationally manageable combinational auctions. Manag. Sci. 44, 1131–1147 (1998)CrossRefMATH
4.
Zurück zum Zitat Xia, M., Stallaert, J., Whinston, A.B.: Solving the combinatorial double auction problem. Eur. J. Oper. Res. 164, 239–251 (2005)CrossRefMATH Xia, M., Stallaert, J., Whinston, A.B.: Solving the combinatorial double auction problem. Eur. J. Oper. Res. 164, 239–251 (2005)CrossRefMATH
5.
Zurück zum Zitat Vemuganti, R.R.: Applications of set covering, set packing and set partitioning models: a survey. In: Du, D.-Z. (ed.) Handbook of Combinatorial Optimization, vol. 1, pp. 573–746. Kluwer Academic Publishers, Dordrecht (1998)CrossRef Vemuganti, R.R.: Applications of set covering, set packing and set partitioning models: a survey. In: Du, D.-Z. (ed.) Handbook of Combinatorial Optimization, vol. 1, pp. 573–746. Kluwer Academic Publishers, Dordrecht (1998)CrossRef
6.
7.
Zurück zum Zitat Hsieh, F.S.: Combinatorial reverse auction based on revelation of Lagrangian multipliers. Decis. Support Syst. 48, 323–330 (2010)CrossRef Hsieh, F.S.: Combinatorial reverse auction based on revelation of Lagrangian multipliers. Decis. Support Syst. 48, 323–330 (2010)CrossRef
8.
Zurück zum Zitat Jones, J.L., Koehler, G.J.: Combinatorial auctions using rule-based bids. Decis. Support Syst. 34, 59–74 (2002)CrossRef Jones, J.L., Koehler, G.J.: Combinatorial auctions using rule-based bids. Decis. Support Syst. 34, 59–74 (2002)CrossRef
9.
Zurück zum Zitat Hsieh, F.S., Lin, J.B.: Assessing the benefits of group-buying based combinatorial reverse auctions. Electron. Commer. Res. Appl. 11, 407–419 (2012)CrossRef Hsieh, F.S., Lin, J.B.: Assessing the benefits of group-buying based combinatorial reverse auctions. Electron. Commer. Res. Appl. 11, 407–419 (2012)CrossRef
10.
Zurück zum Zitat Hsieh, F.S., Lin, J.B.: Virtual enterprises partner selection based on re-verse auction. Int. J. Adv. Manuf. Technol. 62, 847–859 (2012)CrossRef Hsieh, F.S., Lin, J.B.: Virtual enterprises partner selection based on re-verse auction. Int. J. Adv. Manuf. Technol. 62, 847–859 (2012)CrossRef
11.
Zurück zum Zitat Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995) Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)
12.
Zurück zum Zitat El-Galland, A.I., El-Hawary, M.E., Sallam, A.A.: Swarming of intelligent particles for solving the nonlinear constrained optimization problem. Eng. Intell. Syst. Electr. Eng. Commun. 9, 155–163 (2001) El-Galland, A.I., El-Hawary, M.E., Sallam, A.A.: Swarming of intelligent particles for solving the nonlinear constrained optimization problem. Eng. Intell. Syst. Electr. Eng. Commun. 9, 155–163 (2001)
13.
Zurück zum Zitat Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics: Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108 (1997) Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics: Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108 (1997)
14.
Zurück zum Zitat Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, 311–338 (2000)CrossRefMATH Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, 311–338 (2000)CrossRefMATH
15.
Zurück zum Zitat Hsieh, F.S., Liao, C.S.: Schemes to reward winners in combinatorial double auctions based on optimization of surplus. Electron. Commer. Res. Appl. 14(6), 405–417 (2015)CrossRef Hsieh, F.S., Liao, C.S.: Schemes to reward winners in combinatorial double auctions based on optimization of surplus. Electron. Commer. Res. Appl. 14(6), 405–417 (2015)CrossRef
Metadaten
Titel
A Discrete Particle Swarm Algorithm for Combinatorial Auctions
verfasst von
Fu-Shiung Hsieh
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-61824-1_22

Premium Partner