[1991] Proceedings. The Seventh IEEE Conference on Artificial Intelligence Application
DOI: 10.1109/caia.1991.120901
|View full text |Cite
|
Sign up to set email alerts
|

A knowledge-based approach for railway scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 5 publications
0
9
0
Order By: Relevance
“…Train type Overtaking (Chen & Chang, 1997;Fay, 2000;Jia & Zhang, 1993;Rebreyend, 2005) (Chen & Chang, 1997;Fay, 2000Fay, , 2001Komaya & Fukuda, 1991;Rebreyend, 2005) Uncompleted distance Added trains (Chen & Chang, 1997;Fay, 2000;Jia & Zhang, 1993) (Chen & Chang, 1997;Fay, 2000Fay, , 2001Komaya & Fukuda, 1991) …”
Section: Dispatch Decision Factors Dispatch Optionsmentioning
confidence: 98%
See 3 more Smart Citations
“…Train type Overtaking (Chen & Chang, 1997;Fay, 2000;Jia & Zhang, 1993;Rebreyend, 2005) (Chen & Chang, 1997;Fay, 2000Fay, , 2001Komaya & Fukuda, 1991;Rebreyend, 2005) Uncompleted distance Added trains (Chen & Chang, 1997;Fay, 2000;Jia & Zhang, 1993) (Chen & Chang, 1997;Fay, 2000Fay, , 2001Komaya & Fukuda, 1991) …”
Section: Dispatch Decision Factors Dispatch Optionsmentioning
confidence: 98%
“…Research has emphasized the developing analytical models in supporting managerial decisionmaking (Assad, 1980). Previous studies in the literature focused mostly on the adoption of simulation (Frank, 1965;Peat, Marwick, Mitchell, 1975;Petersen & Taylor, 1982), mathematical programming (Kraay et al, 1991;Petersen, Taylor, & Martland, 1986;Sauder & Westerman, 1983), and expert system (Komaya & Fukuda, 1991) for issues related to railway traffic control. Sahin (1999) adopted a utility function of some weighted attributes for each conflict to determine dynamic train priority according to the calculated values of the dynamic priorities of trains.…”
Section: Railway Traffic Controlmentioning
confidence: 99%
See 2 more Smart Citations
“…The DCBS algorithm automatically generates a bus timetable based on a set of service frequency requirements, duty assignment constraints, operational nature of the route, and the type of buses available. Even for a single bus route, the timetabling search space is quite large and highly non-linear; a traditional constraintsatisfaction problem (CSP) algorithm will not suffice [6,9]. The DCBS algorithm solves this problem by distributing the scheduling responsible among a collection of scheduling agents.…”
Section: Introductionmentioning
confidence: 99%