Repair-Based Railway Scheduling System with Cycle Detection

Te-Wei CHIANG; Hai-Yen HAU

Repair-Based Railway Scheduling System with Cycle Detection

Te-Wei CHIANG, Hai-Yen HAU

Full Text Views

0

Cite this

Summary :

In this paper, we propose an approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly flawed schedule and searches through the space of possible repairs. The search is guided by an earliest-conflict-first heuristic that attempts to repair the earliest constraint violation while minimizing the value of objective function. Since cycles may exist among a sequence of repairs during the repair process, a cycle detection and resolution scheme is proposed to prevent infinite loops. Experimental results show that the efficiency of the repair algorithm improves significantly when cycle detection is incorporated.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.7 pp.973-979

Publication Date: 1996/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Artificial Intelligence and Cognitive Science

Cite this

Copy

Te-Wei CHIANG, Hai-Yen HAU, "Repair-Based Railway Scheduling System with Cycle Detection" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 7, pp. 973-979, July 1996, doi: .
Abstract: In this paper, we propose an approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly flawed schedule and searches through the space of possible repairs. The search is guided by an earliest-conflict-first heuristic that attempts to repair the earliest constraint violation while minimizing the value of objective function. Since cycles may exist among a sequence of repairs during the repair process, a cycle detection and resolution scheme is proposed to prevent infinite loops. Experimental results show that the efficiency of the repair algorithm improves significantly when cycle detection is incorporated.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_7_973/_p

Copy

@ARTICLE{e79-d_7_973,
author={Te-Wei CHIANG, Hai-Yen HAU, },
journal={IEICE TRANSACTIONS on Information},
title={Repair-Based Railway Scheduling System with Cycle Detection},
year={1996},
volume={E79-D},
number={7},
pages={973-979},
abstract={In this paper, we propose an approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly flawed schedule and searches through the space of possible repairs. The search is guided by an earliest-conflict-first heuristic that attempts to repair the earliest constraint violation while minimizing the value of objective function. Since cycles may exist among a sequence of repairs during the repair process, a cycle detection and resolution scheme is proposed to prevent infinite loops. Experimental results show that the efficiency of the repair algorithm improves significantly when cycle detection is incorporated.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Repair-Based Railway Scheduling System with Cycle Detection
T2 - IEICE TRANSACTIONS on Information
SP - 973
EP - 979
AU - Te-Wei CHIANG
AU - Hai-Yen HAU
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 1996
AB - In this paper, we propose an approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly flawed schedule and searches through the space of possible repairs. The search is guided by an earliest-conflict-first heuristic that attempts to repair the earliest constraint violation while minimizing the value of objective function. Since cycles may exist among a sequence of repairs during the repair process, a cycle detection and resolution scheme is proposed to prevent infinite loops. Experimental results show that the efficiency of the repair algorithm improves significantly when cycle detection is incorporated.
ER -