PSO applied to table allocation problems

  • Authors:

  • David A. Braude;Anton van Wyk

  • Affiliations:

  • ,Information Security, Modeling and Digital Sciences, CSIR, Pretoria, South Africa;School of Electrical and Information Engineering, University of the Witwatersrand, Johannesburg, South Africa

  • Venue:
  • ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Table allocation is a type of assignment problem The aim of table allocation is to assign multiple people to a single table in such a way that it minimizes a cost function While particle swarm optimization (PSO) is normally used for continuous variables it has been adapted to solve this problem Each particle represents an entire seating arrangement, and the velocity is the amount of times people swap tables during each iteration In an example application PSO shows a significant improvement in fitness compared to the initial conditions, and has a low runtime It also performs better in fitness improvement and runtime compared to choosing as many random samples as PSO generated The use of PSO allows for generalized cost functions, and is simple to implement.