Abstract
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NPcomplete; so that closure and heuristic search are usually used. However, many problems are inherently distributed and the problem complexity can be reduced by dividing the problem into a set of subproblems. Nevertheless, general distributed techniques are not always appropriate to distribute real life problems. In this work, we model the railway scheduling problem by means of domain dependent distributed constraint models and we show that these models maintained better behaviors than general distributed models based on graph partitioning. The evaluation is focussed on the railway scheduling problem, where domain dependent models carry out a problem distribution by means of trains and contiguous set of stations.
This work has been partially supported by the research projects TIN2004-06354-C02-01 (Min. de Educacin y Ciencia, Spain-FEDER), FOM-70022/T05 (Min. de Fomento, Spain) and by the Future and Emerging Technologies Unit of EC (1ST priority — 6th FP), under contract no. FP6-021235-2 (project ARRIVAL).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Cordeau, P. Toth, and D. Vigo, ‘A survey of optimization models for train routing and scheduling’, Transportation Science, 32, 380–446, (1998).
R. Dechter and J. Pearl, ‘Network-based heuristics for constraint satisfaction problems’, Artificial Intelligence, 34, 1–38, (1988).
B. Hendrickson and R.W. Leland, ‘A multi-level algorithm for partitioning graphs’, in Supercomputing, (1995).
G. Karypis and V. Kumar, ‘Using METIS and parMETIS’, (1995).
G. Karypis and V. Kumar, ‘A parallel algorithm for multilevel graph partitioning and sparse matrix ordering’, Journal of Parallel and Distributed Computing, 71–95, (1998).
M.A. Salido, A. Giret, and F. Barber, ‘Distributing Constraints by Sampling in Non-Binary CSPs’, Distributed Constraint Problem Solving and Reasoning in Multi-agent Systems. Frontiers in Artificial Intelligence and Applications, 112, 77–91, (2004).
A. Schrijver and A. Steenbeek, ‘Timetable construction for railned’, Technical Report, CWI, Amsterdam, The Netherlands, (1994).
P. Serafini and W. Ukovich, ‘A mathematical model for periodic scheduling problems’, SIAM Journal on Discrete Mathematics, 55–581, (1989).
E. Silva de Oliveira, ‘Solving single-track railway scheduling problem using constraint programming’, Phd Thesis. Univ. of Leeds, School of Computing, (2001).
C. Walker, J. Snowdon, and D. Ryan, ‘Simultaneous disruption recovery of a train timetable and crew roster in real time’, Comput. Opere Res, 2077–2094, (2005).
M. Wooldridge and R. Jennings, ‘Agent theories, arquitectures, and lenguajes: a survey’, Intelligent Agents, 1–22, (1995).
M. Yokoo and K. Hirayama, ‘Algorithms for distributed constraint satisfaction: A review’, Autonomous Agents and Multi-Agent Systems, 3, 185–207, (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag London Limited
About this paper
Cite this paper
Salidol, M.A., Abril, M., Barber, F., Ingolotti, L., Tormos, P., Lova, A. (2007). Domain Dependent Distributed Models for Railway Scheduling. In: Ellis, R., Allen, T., Tuson, A. (eds) Applications and Innovations in Intelligent Systems XIV. SGAI 2006. Springer, London. https://doi.org/10.1007/978-1-84628-666-7_13
Download citation
DOI: https://doi.org/10.1007/978-1-84628-666-7_13
Publisher Name: Springer, London
Print ISBN: 978-1-84628-665-0
Online ISBN: 978-1-84628-666-7
eBook Packages: Computer ScienceComputer Science (R0)