Train rescheduling algorithm which minimizes passengers' dissatisfaction

N/ACitations
Citations of this article
36Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Although computer systems which assist human experts in rescheduling disrupted train traffic is being practically used recently, they are not so helpful in decreasing the workload of human experts. This is because they are lacking in intelligence such as to automatically make rescheduling plans. In this paper, we propose an algorithm for automatic train rescheduling. Firstly, we propose to use passengers' dissatisfaction as a. criterion of rescheduling plans and to regard the train rescheduling problem as a constraint optimization problem in which dissatisfaction of passengers should be minimized. Then we introduce an algorithm for train rescheduling designed as a combination of PERT and meta-heuristics. We also show some experimental results of the algorithm using actual train schedule data. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Norio, T., Yoshiaki, T., Noriyuki, T., Chikara, H., & Kunimitsu, M. (2005). Train rescheduling algorithm which minimizes passengers’ dissatisfaction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3533 LNAI, pp. 829–838). Springer Verlag. https://doi.org/10.1007/11504894_113

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free