By Topic

Single and multiobjective optimization of the train staff planning problem using genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Domberger, R. ; Inst. for Inf. Syst., Univ. of Appl. Sci. Northwestern Switzerland, Basel ; Frey, L. ; Hanne, T.

We consider the problem of assigning train drivers to scheduled trains services, a combinatorial optimization problem which involves various hard and soft constraints. The problem is formulated as a single and a multiobjective optimization problem. A genetic algorithm is designed for solving it. As the problem is a real-life problem, various issues of application and utilization within a railway planning suite are discussed as well.

Published in:

Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Date of Conference:

1-6 June 2008