Creating seating plans: a practical application
This paper examines the interesting problem of designing seating plans for large events such as weddings and gala dinners where, among other things, the aim is to construct solutions where guests are sat on the same tables as friends and family, but, perhaps more importantly, are kept away from those they dislike. This problem is seen to be Open image in new window-complete from a number of different perspectives. We describe the problem model and heuristic algorithm that is used on the commercial website www.weddingseatplanner.com. We present results on the performance of this algorithm, demonstrating the factors that can influence run time and solution quality, and also present a comparison with an equivalent IP model used in conjunction with a commercial solver.
Keywordsseating plans graph colouring combinatorial optimisation metaheuristics integer programming
- Bellows M and Luc Peterson J (2012). Finding an optimal seating chart. Annals of Improbable Research, www.improbable.com/news/2012/optimal-seating-chart.pdf, Published online February 2012.
- Carroll F and Lewis R (2013). The ‘engaged’ interaction: Important considerations for the HCI design and development of a web application for solving a complex combinatorial optimization problem. World Journal of Computer Application and Technology 1(3): 75–82.Google Scholar
- Garey MR and Johnson DS (1979). Computers and Intractability—A Guide to NP-Completeness. 1st edn, W. H. Freeman and Company: San Francisco.Google Scholar
- Nielsen J (2004). The need for web design standards. Online article, http://www.nngroup.com/articles/the-need-for-web-design-standards, accessed September 2004.