2008
DOI: 10.1016/j.engappai.2008.03.008
|View full text |Cite
|
Sign up to set email alerts
|

Distributed search in railway scheduling problems

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 interconnected sub-problems which can be more easily solved. The purpose of this paper is threefold: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
6
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…As a consequence, new strategies are being implemented to reduce energy consumption. Some of these efficiency strategies are focused on improving the traffic management from the point of view of traffic design [2]- [6] and regulation [7]- [12], on the optimal use of regenerative braking [13]- [15] and on eco-driving [16]- [18]. These actions can be implemented in the short term with low investments compared with other energy efficiency actions as the renewal of trains [19] or the improvement of the infrastructure.…”
mentioning
confidence: 99%
“…As a consequence, new strategies are being implemented to reduce energy consumption. Some of these efficiency strategies are focused on improving the traffic management from the point of view of traffic design [2]- [6] and regulation [7]- [12], on the optimal use of regenerative braking [13]- [15] and on eco-driving [16]- [18]. These actions can be implemented in the short term with low investments compared with other energy efficiency actions as the renewal of trains [19] or the improvement of the infrastructure.…”
mentioning
confidence: 99%
“…Abril et al. (2008) took railway scheduling problems as constraint satisfaction problems (CSPS) and designed a distributed and asynchronous search algorithm (DTS) to solve the problems [3]. Castillo et al.…”
Section: Related Workmentioning
confidence: 99%
“…Tornquist and Persson (2007) presented an optimization approach to the problem of rescheduling railway traffic in an n-tracked network when a disturbance had occurred [2]. Abril et al (2008) took railway scheduling problems as constraint satisfaction problems (CSPS) and designed a distributed and asynchronous search algorithm (DTS) to solve the problems [3]. Castillo et al (2011) studied the timetabling problem for a mixed multiple-and single-tracked railway network [4].…”
Section: Related Workmentioning
confidence: 99%
“…Eco-driving is the obtention of the speed profile with the minimum energy consumption associated. The eco-driving speed profile is calculated for a specific target running time considering the previously designed timetable [3,[5][6][7][8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%