EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
968. Optimizing paths and schedules in crowded events
Invited abstract in session WA-26: Optimization problems in scheduling, stream Combinatorial Optimization.
Wednesday, 8:30-10:00Room: 012 (building: 208)
Authors (first author is the speaker)
| 1. | Valentina Morandi
|
| Economics and Management, University of Brescia | |
| 2. | Gianfranco Guastaroba
|
| Department of Economics and Management, University of Brescia | |
| 3. | M. Grazia Speranza
|
| Dept. of Quantitative Methods, University of Brescia |
Abstract
In large events, improving visitor experiences involves a personalized planner for individual preferences. Crafting unique itineraries, it often overlooks suggestions given to others visitors. This is crucial in limited-capacity locations, as myopic decisions may lead to extended queues. We study a situation where a large number of people visit a popular venue (e.g., an art gallery, a mall, a theme park, or an exhibition) where points of interest are located (e.g., paintings, shops, attractions, or pavilions). Visitors have a maximum time available for the overall experience. The points of interest have a binding capacity and, whenever the turnout of visitors exceeds such capacity, queues occur. Given the maximum time available along with the time spent queuing, a selection of the points of interest may become necessary. Visitors usually act as autonomous decision-makers and do not take into account their interaction with other visitors. This leads to remarkable inefficiencies that could be, to a certain extent, overcome through a coordination of the paths and schedules of the different visitors. The resulting optimization problem is modeled on a time-space network as a Mixed-Integer Linear Program (MILP), where the goal is to minimize a weighted combination of the points of interest not selected and the time spent queuing. Computational results show the benefits that can be achieved by using the model proposed as a tool to support decision-making.
Keywords
- Combinatorial Optimization
- Network Flows
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers