A genetic algorithm approach to periodic railway synchronization

Computers and Operations Research

Volumn 23, Issue 5, 1996, Pages 453-463

  Nachtigall, Karl ^a   Voget, Stefan ^a  

^a UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; RAILROAD ROLLING STOCK; RAILROAD TRANSPORTATION; SCHEDULING;

PERIODIC NETWORK OPTIMIZATION PROBLEM; PERIODIC RAILWAY SYNCHRONIZATION; TIMETABLES;

GENETIC ALGORITHMS;

EID: 0030143150     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00032-1     Document Type: Article

References (16)

1. P. Brucker, R. Burkard and J. Hurink, Cyclic schedules for r irregularly occurring events. J. Comput. Appl. Math. 30, 173-189 (1990).
2. P. Brucker and J. Hurink, A railway scheduling problem. Z. Opns Res. A223-A227 (1986).
3. R. E. Burkard, Optimal schedules for periodically recurring events. Discrete Appl. Math. 15, 167-180 (1986).
4. L. Davis, Handbook of Genetic Algorithms. Van Nostrand Rheinold, New York (1990).
5. W. Domschke, Schedule synchronization for public transit networks. OR Spektrum, 17-24 (1989).
6. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Boston (1989).
7. J. Grefenstette, Incorporating problem specific knowledge into genetic algorithms. In Genetic Algorithms and Simulated Annealing (Edited by L. Davis) pp. 42-60 (1987).
8. J. Holland, Adaptation in Natural and Artificial Systems. Michigan Press (1975).
9. P. Jog, J. Suh and D. van Gucht, The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. Proceedings of the Third International Conference on Genetic Algorithms, pp. 110-115 (1989).
10. H. Mühlenbein, M. Gorges-Schleuter and O. Krämer, Evolution algorithms in combinatorial optimization. Parallel Comput. 7, 65-85 (1988).
11. K. Nachtigall, Exact solution methods for periodic programs. Hildesheimer Informatik-Berichte 14/93 (1993).
12. K. Nachtigall, Periodic network optimization with different arc frequencies. Discrete Appl. Math. In press.
13. P. Serafini and W. Ukovich. A mathematical model for periodic scheduling problems. SIAM J. Discrete Math. 2, 550-581 (1989).
14. N. Ulder, E. Pesch, P. van Laarhoven, H. Bandelt and E. Aarts, Genetic local search algorithms for the traveling salesman problems. In Parallel problem solving from nature. (Edited by H. Schwefel and R. Männer), pp. 109-116. Springer, Berlin (1991).
15. 3(n, d). Discrete Appl. Math. 71-87 (1993).
16. W. Weigand, The man-machine dialogue and timetable planning. Rail Int. 8-25 (1983).