Name
Abstract | ||
|---|---|---|
Given buses of different types arriving at a depot during the evening, the bus parking problem consists of assigning these buses to parking slots in such a way that they can be dispatched adequately to the next morning routes without moving them between their arrivals and departures. In practice, the bus arrival times deviate stochastically from the planned schedule. In this paper, we introduce for this problem two solution approaches that produce solutions which are robust to variations in the arrival times. The first approach considers that each arrival can deviate from its planned arrival order (sooner or later) by at most k positions, where k is a predefined parameter. In the second approach, the objective aims at minimizing the expectation of a function positively correlated with the number of buses that make the planned solution infeasible because they arrive too late or too early. In both approaches, the problem is modeled as an integer linear program that can be solved by a commercial mip solver. Computational results obtained on instances derived from a real-world dataset are reported. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ejor.2006.10.004 | European Journal of Operational Research |
Keywords | Field | DocType |
Bus parking and dispatching,Stochastic arrival times,Integer programming modeling,Simulation | Integer,Mathematical optimization,Linear model,Algorithm,Integer programming,Linear programming,Depot,Solver,Mathematics,Operations management,During the evening | Journal |
Volume | Issue | ISSN |
183 | 2 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Hamdouni | 1 | 10 | 1.43 |
| François Soumis | 2 | 821 | 97.64 |
| Guy Desaulniers | 3 | 874 | 62.90 |