Journal of the Operational Research Society

, Volume 67, Issue 11, pp 1353–1362 | Cite as

Creating seating plans: a practical application

  • Rhyd Lewis
  • Fiona Carroll
General Paper

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 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.

Keywords

seating plans graph colouring combinatorial optimisation metaheuristics integer programming 

References

  1. 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.
  2. Brelaz D (1979). New methods to color the vertices of a graph. Communication of the ACM 22(4): 251–256.CrossRefGoogle Scholar
  3. 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
  4. Galinier P and Hao J-K (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4): 379–397.CrossRefGoogle Scholar
  5. 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
  6. Hertz A and de Werra D (1987). Using tabu search techniques for graph coloring. Computing 39(4): 345–351.CrossRefGoogle Scholar
  7. 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.CrossRefGoogle Scholar
  8. Malaguti E, Monaci M and Toth P (2008). A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing 20(2): 302–316.CrossRefGoogle Scholar
  9. Méndez-Díaz I and Zabala P (2008). A cutting plane algorithm for graph coloring. Discrete Applied Mathematics 156(2): 159–179.CrossRefGoogle Scholar
  10. 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.
  11. 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.CrossRefGoogle Scholar

Copyright information

© The Operational Research Society 2016

Authors and Affiliations

  • Rhyd Lewis
    • 1
  • Fiona Carroll
    • 2
  1. 1.Cardiff UniversityCardiffUnited Kingdom
  2. 2.University of South WalesPontypriddUnited Kingdom

Personalised recommendations