Many combinatorial problems can be modelled as constraint satisfaction problems (CSPs). Solving a general CSP is known to be NP-complete; 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, the authors model the railway scheduling problem by means of domain dependent distributed constraint models and they 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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Domain dependent distributed models for railway scheduling


    Weitere Titelangaben:

    Bereichsabhängige verteilte Modelle für Eisenbahnfahrpläne


    Beteiligte:
    Salido, M.A. (Autor:in) / Abril, M. (Autor:in) / Barber, F. (Autor:in) / Ingolotti, L. (Autor:in) / Tormos, P. (Autor:in) / Lova, A. (Autor:in)


    Erscheinungsdatum :

    2007


    Format / Umfang :

    14 Seiten, 8 Bilder, 1 Tabelle, 12 Quellen



    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    Distributed constraint satisfaction problems to model railway scheduling problems

    Tormos, P. / Abril, M. / Salido, M. A. et al. | British Library Conference Proceedings | 2006


    Scheduling Models for Short-Term Railway Traffic Optimisation

    Mascis, A. / Pacciarelli, D. / Pranzo, M. | British Library Conference Proceedings | 2008