PSO Applied to Table Allocation Problems
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.
KeywordsParticle Swarm Optimization Uniform Random Number Random Approach Generalize Cost Function Seating Arrangement
Unable to display preview. Download preview PDF.
- 1.Shmoys, D.B., Tardos, E.: An Approximation Algorithm for the Generalized Assignment Problem Mathematical Programming, vol. 32, pp. 461–474 (1993)Google Scholar
- 2.Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)Google Scholar
- 4.Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, November 1995, pp. 1942–1948 (1995)Google Scholar
- 5.Krohling, R.A., dos Santos Coelho, L.: PSO-E: Particle Swarm with Exponential Distribution. In: 2006 IEEE Transactions on Evolutionary Computation, July 2006, pp. 1428–1433 (2006)Google Scholar
- 6.Hunt, A., Thomas, D.: The Pragmatic Programmer. Addison-Wesley Professional, Indianapolis (1999)Google Scholar