×

Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks. (English) Zbl 0921.90068

Summary: The integrated fixed interval timetable of a railway network guarantees none waiting times for passengers changing trains. For a periodically served network such a timetable only exists, if and only if the running times of the trains are feasible with a group equation system. If the running times are infeasible with this equation system, there will remain a certain amount of waiting time. A modification of the running times can be achieved by reforming the actual state of certain track segments. We discuss the cost-benefit between the investigation for reforming track states and the quality of the resulting timetable measured by the remaining waiting times. This leads to a complicated bi-criteria optimization problem.We generate sub-optimal solutions by a hybrid genetic algorithm including fuzzy logic.

MSC:

90B06 Transportation, logistics and supply chain management
90B90 Case-oriented studies in operations research
90B50 Management decision making, including multiple objectives
68T05 Learning and adaptive systems in artificial intelligence

Software:

PESPLib
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bandemer, H.; Gottwald, S., Einfuehrung in Fuzzy-Methoden (1993), Akademie Verlag: Akademie Verlag Berlin
[2] Deutsche Bundesbahn, Pilotprojekt Integraler Taktfahrplan Südwestraum Teilraum Reinland-Pfalz (1993), Deutsche Bundesbahn
[3] Davis, L., Handbook of Genetic Algorithms (1990), New York
[4] Delgade, M.; Kacprzyk, J.; Verdegay, J. L.; Vila, M. A., Fuzzy Optimization- Recent Advances (1994), Physica-Verlag
[5] Garey; Johnson, Computers and intractability (1979) · Zbl 0411.68039
[6] Göbertshahn, R., Der integrale Taktfahrplan, Die Deutsche Bahn, 5, 93, 357-362 (1993)
[7] Göbertshahn, R., Der integrale Taktfahrplan-Fundament der neuen Nahverkehrsstrategie von Deutscher Bundesbahn und Deutscher Reichsbahn, Die Deutsche Bahn, 5, 93, 357-362 (1993)
[8] Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley · Zbl 0721.68056
[9] Holland, J., Adaptation in Natural and Artificial Systems (1975), Michigan Press
[10] Lee, M. A.; Takagi, H., Dynamic control of genetic algorithms using fuzzy logic techniques, (International Conference of Genetic Algorithms (1993)), 76-83
[11] Lichtenegger, M., Der integrierte Taktfahrplan, Eisenbahntechnische Rundschau, 171-175 (1991)
[12] Kreuzer, P., Bussiek, M.R., and Zimmermann, U.T., “Optimal lines for railway systems”, European J. of Operational Research; Kreuzer, P., Bussiek, M.R., and Zimmermann, U.T., “Optimal lines for railway systems”, European J. of Operational Research
[13] Nachtigall, K., Cutting Planes for a Polyhedron Associated with a Periodic Network, DLR Interner Bericht, IB 112-96/17 (1996) · Zbl 0856.90118
[14] Nachtigall, K., “Periodic network optimization with different arc frequencies”, Discrete Applied Mathematics; Nachtigall, K., “Periodic network optimization with different arc frequencies”, Discrete Applied Mathematics · Zbl 0856.90118
[15] Nachtigall, K.; Voget, S., A genetic algorithm approach to railway synchronization, Computers and Operations Research, 23, 5, 453-463 (1996) · Zbl 0847.90098
[16] Nemhauser, G. L.; Wolsey, L. A., Integer and Combinatorial Optimization (1972), J. Wiley and Sons: J. Wiley and Sons New York · Zbl 0469.90052
[17] Nissen, V., Evolutionäre Algorithmen (1994), DUV · Zbl 0900.68353
[18] Rockafellar, R. T., Network flows and monotropic optimization (1984), John Wiley: John Wiley New York · Zbl 0596.90055
[19] Schulz, A., Der Allgäu-Schwaben-Takt, Die Deutsche Bahn, 5, 363-370 (1993)
[20] Serafini, P.; Ukovich, W., A mathematical model for periodic scheduling problems, SIAM J. Discrete Math., 2, 4, 550-581 (1989) · Zbl 0676.90030
[21] Voget, S., Aspekte genetischer Optimierungsalgorithmen: mathematische Modellierung und Einsatz in der Fahrplanerstellung, (Ph.D. Thesis (1995), Universitaet Hildesheim)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.