Journal
JOURNAL OF HEURISTICS
Volume 16, Issue 4, Pages 575-591Publisher
SPRINGER
DOI: 10.1007/s10732-009-9102-x
Keywords
Graph search methods; Evolutionary algorithm; Crew scheduling
Funding
- The Millennium Scientific Institute Chile: Complex Engineering Systems
- [C-13955/18-Fundacion Andes]
- [204.097.007-1.0-UDEC]
- [II-0457-FA-FCD-FI-FC-ALFA]
Ask authors/readers for more resources
Operations management of subway systems is associated with combinatorial optimization problems (i.e. crew and train scheduling and rostering) which belong to the np-hard class of problems. Therefore, they are generally solved heuristically in real situations. This paper considers the problem of duty generation, i.e. identifying an optimal trips set that the conductors should complete in one workday. With regard to operational and labor conditions, the problem is to use the lowest possible number of conductors and minimize total idle time between trips. The problem is modeled and solved using a constructive hybrid approach, which has the advantage of visualizing a solution construction similar to the manual approach typically used. Our approach takes advantage of the benefits offered by evolutionary methods, which store a candidate solutions population in each stage, thus controlling the combinatorial explosion of possible solutions. The results thus obtained for problems similar to those that are solved manually in the Santiago Metro System were compared with two alternative approaches, based on tabu search and a greedy method. The hybrid method produced solutions with the minimum number of duties in six of the ten problems solved. However, the tabu search method provided better results in terms of idle time than either the hybrid method or the greedy method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available