Distributed search in railway scheduling problems

Authors:
Montserrat Abril;Miguel A. Salido;Federico Barber
Affiliations:
Dpto. Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain;Dpto. Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain;Dpto. Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain
Venue:
Engineering Applications of Artificial Intelligence
Year:
2008

Citing 8
Cited 6

Finding small simple cycle separators for 2-connected planar graphs

Journal of Computer and System Sciences
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
A mathematical for periodic scheduling problems

SIAM Journal on Discrete Mathematics
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
A Survey of Optimization Models for Train Routing and Scheduling

Transportation Science
Graph partitioning for high-performance scientific simulations

Sourcebook of parallel computing
Simultaneous disruption recovery of a train timetable and crew roster in real time

Computers and Operations Research

Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model

Transportation Science
Solving a periodic single-track train timetabling problem by an efficient hybrid algorithm

Engineering Applications of Artificial Intelligence
Fuzzy optimal schedule of high speed train operation to minimize energy consumption with uncertain delays and driver's behavioral response

Engineering Applications of Artificial Intelligence
A demand-responsive decision support system for coal transportation

Decision Support Systems
Mixed integer programming for minimizing the period of a cyclic railway timetable for a single track with two train types

Computers and Industrial Engineering
Multi objective particle swarm optimization algorithm for the design of efficient ATO speed profiles in metro lines

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 inter-connected sub-problems which can be more easily solved. The purpose of this paper is three-fold: first, we present a technique to distribute the constraint network by means of selection of tree structures. Thus, the CSP is represented as a meta-tree CSP structure that is used as a hierarchy of communication by our distributed algorithm. Then, a distributed and asynchronous search algorithm (DTS) is presented. DTS is committed to solving the meta-tree CSP structure in a depth-first search tree. Finally, an intra-agent search algorithm is presented. This algorithm takes into account the Nogood_message to prune the search space. We have focused our research on the railway scheduling problem which can be distributed by tree structures. We show that our distributed algorithm outperforms well-known centralized algorithms.