.png){kind=icon}
.png){kind=icon}
Return
Column generation based heuristic framework for the multiple-depot vehicle type scheduling problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2015.10.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The multiple-depot vehicle-type scheduling problem (MDVTSP) is an extension of the classic multiple-depot vehicle scheduling problem (MDVSP), where heterogeneous fleet is considered. Although several mathematical formulations and solution methods have been developed for the MDVSP, the MDVTSP is still relatively unexplored. Large instances of the MDVTSP (involving thousands of trips and several depots and vehicle types) are still difficult to solve in a reasonable time. We introduce a heuristic framework, combining time-space network, truncated column generation (TCG) and state space reduction, to solve large instances of the MDVTSP. Extensive testing was carried out using random generated instances, in which a peak demand distribution was defined based on real-world data from public transportation systems in Brazil. Furthermore, experiments were carried out with a real instance from a Brazilian city. The framework has been implemented in several algorithm variants, combining different developed preprocessing procedures, such as state space reduction and initial solutions for the TCG. Computational results show that all developed algorithms obtained very good performances both in quality and efficiency. The best solutions, considering simultaneously quality and efficiency, were obtained in the heuristics involving state space reduction. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Bus scheduling
Heterogeneous fleet
Column generation
Time-space network
State space reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W