Distributed search in railway scheduling problems

Engineering Applications of Artificial Intelligence

Volumn 21, Issue 5, 2008, Pages 744-755

  Abril, Montserrat ^a   Salido, Miguel A ^a   Barber, Federico ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Constraint Satisfaction Problems; Distributed CSP; Meta tree CSP structure; Train timetabling; Tree partition

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MESSAGE PASSING; ONLINE SEARCHING; RAILROAD TRANSPORTATION; SCHEDULING;

ASYNCHRONOUS SEARCH ALGORITHMS (DTS); CONSTRAINT SATISFACTION PROBLEMS (CSP); TRAIN TIMETABLING; TREE PARTITION;

PROBLEM SOLVING;

EID: 44749087413     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2008.03.008     Document Type: Article

References (15)

1. Cordeau J., Toth P., and Vigo D. A survey of optimization models for train routing and scheduling. Transportation Science 32 (1998) 380-446
2. Decher R. Constraint Processing (2003), Morgan Kaufmann, Los Altos, CA
3. Dechter R. Constraint networks (survey). Encyclopedia Artificial Intelligence (1992) 276-285
4. Dechter R., and Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34 (1987) 1-38
5. Freuder E. A sufficient condition for backtrack-free search. Journal of the ACM 29 (1982) 24-32
6. Haralick R., and Elliott G. Increasing tree efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263-314
7. Meisels A., Kaplansky E., Razgon I., and Zivan R. Comparing performance of distributed constraint processing algorithms. Proceedings of the 4th Workshop on Distributed Constraint Reasoning (2002)
8. Miller G. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences 32 (1986) 265-279
9. Salido M., and Barber F. Distributed CSPs by graph partitioning. Applied Mathematics and Computation 183 (2006) 491-498
10. Schloegel K., Karypis G., and Kumar V. Graph partitioning for high-performance scientific simulations. Sourcebook of Parallel Computing (2003) 491-541
11. Schrijver, A., Steenbeek, A., 1994. Timetable construction for railned. Technical Report, CWI, Amsterdam, The Netherlands.
12. Serafini P., and Ukovich W. A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics (1989) 550-581
13. Silva de Oliveira, E., 2001. Solving single-track railway scheduling problem using constraint programming. Ph.D. Thesis, University of Leeds, School of Computing.
14. Walker S.J., and Ryan D. Simultaneous disruption recovery of a train timetable and crew roster in real time. Computers & Operations Research (2005) 2077-2094
15. Yokoo M., and Hirayama K. Algorithms for distributed constraint satisfaction: a review. Autonomous Agents and Multi-Agent Systems 3 (2000) 185-207