An automatic seating plan algorithm
Linderstrøm-Lang Centre for Protein Science, Department of Biology, University of Copenhagen, Copenhagen, Denmark
- Published
- Accepted
- Subject Areas
- Algorithms and Analysis of Algorithms, Social Computing
- Keywords
- Table planning, Optimization
- Copyright
- © 2018 Lindorff-Larsen
- Licence
- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Preprints) and either DOI or URL of the article must be cited.
- Cite this article
- 2018. An automatic seating plan algorithm. PeerJ Preprints 6:e27420v1 https://doi.org/10.7287/peerj.preprints.27420v1
Abstract
An appropriate seating plan is an important prerequisite for any good party be it a formal wedding or an informal dinner. Yet anyone who has designed a seating plan knows that it can prove frustratingly difficult to find a solution that solves the large number of formal, physical and personal constraints associated. Here I present a flexible algorithm for automating the task. The algorithm matches guests to seats taking into account constraints provided through a dissimilarity matrix calculated, for example, using answers to questions designed to classify personality, as well as other formal or informal constraints.
Author Comment
This manuscript was written in Cambridge, 2004, and submitted as a preprint in 2018