Distributed search in railway scheduling problems
نویسندگان
چکیده
منابع مشابه
Distributed search in railway scheduling problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can be more easily solved. The purpose of this paper is threefold: first, we present a technique to distri...
متن کاملDistributed constraint satisfaction problems to model railway scheduling problems
Railway Scheduling is considered to be a difficult and time-consuming task. Despite real railway networks being modelled as Constraint Satisfaction Problems (CSPs), they require a huge number of variables and constraints. The general CSP is known to be NP-complete; however, distributed models may reduce the exponential complexity by dividing the problem into a set of subproblems. In this work, ...
متن کاملDomain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so 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 approp...
متن کاملA Genetic Algorithm for Railway Scheduling Problems
This work is focused on the application of evolutionary algorithms to solve very complex real-world problems. For this purpose a Genetic Algorithm is designed to solve the Train Timetabling Problem. Optimizing train timetables on a single line track is known to be NP-hard with respect to the number of conflicts in the schedule. This makes it difficult to obtain good solutions to real life probl...
متن کاملApplication of Meta-Tree-Based Distributed Search to the Railway Scheduling Problem∗
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can be more easily solved. In this work, we present a distributed model for solving large-scale CSPs. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Artificial Intelligence
سال: 2008
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2008.03.008