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...

The real-time traffic control of railway networks authorizes movements of the trains and imposes safety constraints. The paper deals with the real time traffic control focusing on deadlock prevention problem. Colored Petri nets are used to model the dynamics of the railway network system: places represent tracks and stations, tokens are trains. The prevention policy is expressed by a set of lin...

Water quality monitoring network design has historically tended to use experience, intuition and subjective judgement in locating monitoring stations. Better design procedures to optimize monitoring systems need to simultaneously identify significant planning objectives and consider a number of social, economic and environmental constraints. The consideration of multiple objectives may require ...

9 To provide stable and high data rate wireless access for passengers in the train, it is necessary to 10 properly deploy base stations along the railway. We consider this issue from the perspective of service, 11 which is defined as the integral of the time-varying instantaneous channel capacity. With large-scale 12 fading assumption, it will be shown that the total service of each base statio...

Passenger flow modeling and station dwelling time estimation are significant elements for railway mass transit planning, but system operators usually have limited information to model the passenger flow. In this paper, an artificial-intelligence technique known as fuzzy logic is applied for the estimation of the elements of the origin-destination matrix and the dwelling time of stations in a ra...

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...