Citation
An MILP-approach to the optimization of event-bus schedules: a scheduling application in the tourism sector. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 137-145, 2011.
Paper
Abstract
This paper deals with “The Enchanted Journey”, which is a daily event tour booked by Indian tourists. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and for shopping. Each day, up to five busses operate the tour. For operational reasons, however, two or more busses cannot stay at the same location simultaneously. Further operative constraints include time windows for activities and precedence constraints between activities. The planning problem consists in computing a feasible schedule for each bus. We implement a two step hierarchical approach. In the first step, we minimize the total waiting time, and in the second step, we minimize the total travel time of all busses.We present a formulation of this problem as a mixed-integer linear program, and we report on computational results obtained from the Gurobi solver.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-137-145-P, author = {G. Brandinu and N. Trautmann},
title = {An MILP-approach to the optimization of event-bus schedules: a scheduling application in the tourism sector},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {137--145},
note = {Paper},
abstract = {This paper deals with “The Enchanted Journey”, which is a daily event tour booked by Indian tourists. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and for shopping. Each day, up to five busses operate the tour. For operational reasons, however, two or more busses cannot stay at the same location simultaneously. Further operative constraints include time windows for activities and precedence constraints between activities. The planning problem consists in computing a feasible schedule for each bus. We implement a two step hierarchical approach. In the first step, we minimize the total waiting time, and in the second step, we minimize the total travel time of all busses.We present a formulation of this problem as a mixed-integer linear program, and we report on computational results obtained from the Gurobi solver.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-137-145-P.pdf} }