Abstract
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We show how to model the problem as constraint satisfaction, with extensions which generate flexible seating plans and which maintain stability when changes occur. We describe an implemented system which provides advice to users in real time. The system is currently being evaluated in a restaurant environment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dechter, R. Constraint Processing, Morgan Kaufman, 2003.
Rossi, F., van Beek, P. and Walsh, T. (eds.), Handbook of Constraint Programming, Elsevier, (forthcoming) 2006
Gomes, C.P.; and Shmoys, D.B. “Approximations and Randomization to Boost CSP Techniques”, Annals of Operations Research, 130:117–141, 2004
Gomes, C.P.; and Selman, B. “Algorithm portfolios”, Artificial Intelligence 126(12): 43–62, 2001
Vidotto, A.; Brown, K.N.; and Beck, J.C. “Robust Constraint Solving Using Multiple Heuristics”, Proceedings of the Sixteenth Irish Conference on Artificial Intelligence & Cognitive Science (AICS’05), 203–212, 2005
Régin, J-C. “A Filtering Algorithm for Constraints of Difference in CSPs”, Proceedings AAAI-94, pp 362–367, 1994.
Verfaillie, G.; and Schiex, T. “Solution Reuse in Dynamic Constraint Satisfaction Problems”, Proceedings AAAI-94, pp307–312, 1994
Fowler, D.W.; and Brown, K.N. “Branching constraint satisfaction problems and Markov Decision Problems compared”, Annals of Operations Research, 118(1-4):85–100, 2003
Bent, R.; and Van Hentenryck, P. “Regrets Only! Online Stochastic Optimization under Time Constraints”, ProceedingsAAAI-04, 2004
Ran, Y.; Roos, N.; and van den Herik, J. “Approaches to Find a Near-minimal Change Solution for Dynamic CSPs” CPAIOR’02: Proceedings of the 4th International Workshop on Integration of AI and OR techniquesin Constraint Programming for Combinatorial Optimisation Problems, pp373–387, 2002
Petcu, A.; and Faltings, B. “Optimal solution stability in continuous-time optimization”, DCR-05:Proceedings of the 6th International Workshop on Distributed Constraint Reasoning, pp207–221, 2005
Davenport, AJ.; Gefllot, C.; and Beck, lC. “Slack-based Techniques for Robust Schedules”, Proceedings of the Sixth European Conference on Planning (ECP-200J), 2001
Hebrard, E.; Hnich, B.; and Walsh, T. “Robust Solutions for Constraint Satisfaction and Optimization”, Proceedings of the SixteenthEuropean Conference on Artificial Intelligence, ECAI-04, 2004
Arkin, E.M.; and Silverberg, E.B. “Scheduling jobs with fixed start and end times”, Discrete Applied Mathematics, 18:1–8, 1987
Korf, R. E. “Depth-first iterative deepening: an optimal admissible tree search”, Artificial Intelligence, 27:97–109, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag London Limited
About this paper
Cite this paper
Vidotto, A., Brown, K.N., Beck, J.C. (2007). Managing Restaurant Tables using Constraints. In: Ellis, R., Allen, T., Tuson, A. (eds) Applications and Innovations in Intelligent Systems XIV. SGAI 2006. Springer, London. https://doi.org/10.1007/978-1-84628-666-7_1
Download citation
DOI: https://doi.org/10.1007/978-1-84628-666-7_1
Publisher Name: Springer, London
Print ISBN: 978-1-84628-665-0
Online ISBN: 978-1-84628-666-7
eBook Packages: Computer ScienceComputer Science (R0)