Lewis, Rhyd ![]() |
Preview |
PDF
- Accepted Post-Print Version
Download (1MB) | Preview |
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 https://static-content.springer.com/image/art%3A10.1057%2Fjors.2016.34/MediaObjects/41274_2016_77_IEq1_HTML.gif-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.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Mathematics |
Subjects: | Q Science > QA Mathematics |
Uncontrolled Keywords: | seating plans; graph colouring; combinatorial optimisation; metaheuristics; integer programming |
Additional Information: | PDF uploaded in accordance with publisher's policies at http://www.sherpa.ac.uk/romeo/issn/0160-5682/ (accessed 28.4.16). |
Publisher: | Palgrave Macmillan |
ISSN: | 0160-5682 |
Date of First Compliant Deposit: | 28 April 2016 |
Date of Acceptance: | 23 March 2016 |
Last Modified: | 08 Jan 2025 12:45 |
URI: | https://orca.cardiff.ac.uk/id/eprint/90131 |
Citation Data
Cited 18 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |