Download pdf
Disney visitor problem: Integer optimization using enumeration method and set covering problem
- 1 Shanghai Yangpu Bilingual School
- 2 Suzhou Foreign Language School
* Author to whom correspondence should be addressed.
Abstract
For Disneyland visitors, a well-designed route is often necessary to experience the maximum number of preferred entertainment facilities within a limited time. To construct the best way that optimizes visitors’ satisfaction, a survey is first conducted to estimate the attraction value of each facility, followed by the collection of data that record the traveling time among each facility and the waiting line time. Using collected data and listed constraints, a possible route is listed as an example. To solve the problem, a model is constructed based on integer linear programming. The original, incomplete, and modified formulations are listed in the last part of this paper.
Keywords
Integer Linear Programming, Optimization, Disney Visitor Problem.
[1]. Traveling salesperson problem https://en.wikipedia.org/wiki/Travelling_salesman_problem
[2]. Some Simple Applications of the Travelling Salesman Problem J. K. Lenstra A. H. G. Rinnooy Kan Pages 717-733 | Published online: 19 Dec 2017 https://doi.org/10.1057/jors.1975.151
[3]. Knapsack problem https://en.wikipedia.org/wiki/Knapsack_problem
[4]. The nonlinear knapsack problem – algorithms and applications Kurt M Bretthauer a, Bala Shetty Received 6 June 2000, Accepted 26 April 2001, Available online 13 January 2011. https://doi.org/10.1016/S0377-2217(01)00179-5
[5]. The expectation-maximization algorithm T.K.Moon Published in: IEEE Signal Processing Magazine (Volume: 13, Issue: 6, November 1996) Page(s): 47 - 60 Date of Publication: November 1996
Cite this article
Lin,L.;Aika,K. (2023). Disney visitor problem: Integer optimization using enumeration method and set covering problem. Theoretical and Natural Science,11,29-35.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 2023 International Conference on Mathematical Physics and Computational Simulation
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).