Abstract
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 
-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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Note that the k-partition problem is also variously known as the load balancing problem, the equal piles problem, or the multiprocessor scheduling problem.
For example, using the problem shown in Figure 2, V={v 2,v 3,…,v 9} and E′={{v 2,v 4}, {v 3,v 5}, {v 4,v 8}}.
Specifically, TABUCOL is executed for 20n iterations, using a tabu tenure t proportional to the current cost (t=0.6f 1+r, where r is randomly selected from the set {1,2,…,9}), as recommended by Galinier and Hao (1999).
That is, all vertices and colours involved in the move are marked as tabu in T. For speed’s sake, in our application a fixed-size tabu tenure of 10 is used along with an iteration limit of 10n.
That is, the graph G′ used in Stages 1 and 2 would comprise edge set E′={{u,v}∈E: w uv ⩾c}.
References
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.
Brelaz D (1979). New methods to color the vertices of a graph. Communication of the ACM 22(4): 251–256.
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.
Galinier P and Hao J-K (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4): 379–397.
Garey MR and Johnson DS (1979). Computers and Intractability—A Guide to NP-Completeness. 1st edn, W. H. Freeman and Company: San Francisco.
Hertz A and de Werra D (1987). Using tabu search techniques for graph coloring. Computing 39(4): 345–351.
Lewis R, Thompson J, Mumford C and Gillard J (2012). A wide-ranging computational comparison of high-performance graph colouring algorithms. Computers and Operations Research 39(9): 1933–1950.
Malaguti E, Monaci M and Toth P (2008). A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing 20(2): 302–316.
Méndez-Díaz I and Zabala P (2008). A cutting plane algorithm for graph coloring. Discrete Applied Mathematics 156(2): 159–179.
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.
Valenzuela CM (2001). A study of permutation operators for minimum span frequency assignment using an order based representation. Journal of Heuristics 7(1): 5–21.
Acknowledgements
The authors would like to thank the anonymous referee whose comments and suggestions helped to improve this manuscript.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lewis, R., Carroll, F. Creating seating plans: a practical application. J Oper Res Soc 67, 1353–1362 (2016). https://doi.org/10.1057/jors.2016.34
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2016.34