A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

This paper deals with “The Enchanted Journey,” which is a daily event tour booked by Bollywood-film fans. 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 shopping. Each day, up to five buses operate the tour. For operational reasons, however, two or more buses cannot stay at the same location simultaneously. Further operative constraints include time windows for all activities and precedence constraints between some activities. The planning problem is how to compute a feasible schedule for each bus. We implement a two-step hierarchical approach. In the first step, we minimize the total waiting time; in the second step, we minimize the total travel time of all buses. We present a basic formulation of this problem as a mixed-integer linear program. We enhance this basic formulation by symmetry-breaking constraints, which reduces the search space without loss of generality. We report on computational results obtained with the Gurobi Solver. Our numerical results show that all relevant problem instances can be solved using the basic formulation within reasonable CPU time, and that the symmetry-breaking constraints reduce that CPU time considerably.

Scheduling in service systems: an application in the event-tourism industry

This paper deals with an event-bus tour booked by Bollywood film fans. During the tour, the participants visit selected locations of famous Bollywood films at various sites in Switzerland. Moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour; for organizational reasons, two or more buses cannot stay at the same location simultaneously. The planning problem is how to compute a feasible schedule for each bus such that the total waiting time (primary objective) and the total travel time (secondary objective) are minimized. We formulate this problem as a mixed-integer linear program, and we report on computational results obtained with the Gurobi solver.

Light stops, blind spots, and isospin violation in the MSSM

In the framework of the MSSM, we examine several simplified models where only a few superpartners are light. This allows us to study WIMP-nucleus scattering in terms of a handful of MSSM parameters and thereby scrutinize their impact on dark matter direct-detection experiments. Focusing on spin-independent WIMP-nucleon scattering, we derive simplified, analytic expressions for the Wilson coefficients associated with Higgs and squark exchange. We utilize these results to study the complementarity of constraints due to direct-detection, flavor, and collider experiments. We also identify parameter configurations that produce (almost) vanishing cross sections. In the proximity of these so-called blind spots, we find that the amount of isospin violation may be much larger than typically expected in the MSSM. This feature is a generic property of parameter regions where cross sections are suppressed, and highlights the importance of a careful analysis of the nucleon matrix elements and the associated hadronic uncertainties. This becomes especially relevant once the increased sensitivity of future direct-detection experiments corners the MSSM into these regions of parameter space.