Domain Dependent Distributed Models for Railway Scheduling

Salidol, M. A.; Abril, M.; Barber, Federico; Ingolotti, L.; Tormos, Pilar; Lova, Antonio

doi:10.1007/978-1-84628-666-7_13

Cited by 7 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They represent the timetable scheduling, but delay optimization which considers all practical constraints altogether are not there [11]. Hence, there is a huge scope of work in this regard and with this notion, we work on delay optimization in distributed railway network while introducing a new train in railway timetable taking into account all other trains which are already in circulation.…”

Section: Scope Of the Workmentioning

confidence: 99%

“…al. [11] assumed that two connected stations have only one line connecting them. They have used a software METIS to partition the networks.…”

Section: Related Workmentioning

confidence: 99%

“…But in case of delay in high priority trains, there is always a chance that the lower priority trains get affected all the time and hence the total delay of the whole system goes on increasing. Some researchers [10], [11] have proposed meta−tree based structure to solve the railway scheduling problem as a Constraint Satisfaction Problem(CSP). Where they partitioned the whole network to construct the whole problem as number of connected sub problems.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Multi agent based railway scheduling and optimization

Dalapati

Singh

Dutta

et al. 2014

TENCON 2014 - 2014 IEEE Region 10 Conference

View full text Add to dashboard Cite

This paper proposes a multi agent based timetable scheduling algorithm for railway system which handles the in−between time delay of the newly introduced train. The delay management indeed optimizes the total journey time, hence increases the total utility of the whole railway system as well.Here we show that schedule generated by our proposed algorithm is the most optimized schedule. It is done by using the notion of DCOP(Distributed Constraint Optimization Problem), where we define some metric to analyze the system to achieve our goals. We use JADE(Java Agent DEvelopment Framework) platforms to simulate our work and test it using a small network. We also take a small case study to compare our proposed work with the existing one and the results are therefore presented.

show abstract

Section: Scope Of the Workmentioning

confidence: 99%

“…al. [11] assumed that two connected stations have only one line connecting them. They have used a software METIS to partition the networks.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Multi agent based railway scheduling and optimization

Dalapati

Singh

Dutta

et al. 2014

TENCON 2014 - 2014 IEEE Region 10 Conference

View full text Add to dashboard Cite

show abstract

“…Due to the decentralised and modular nature of these kind of problems, the algorithms to calculate the scheduling of each vehicle must be distributed. To overcome this weakness, we use the distributed model presented in Salido et al (2007), in which the problem is partitioned into subproblems that represent regions, countries, etc. Here, we use a holonic architecture (Press Release HMS 1994) to organise the entities (holons or agents (Giret and Botti 2004)) that are responsible for solving each subproblem (Versteegh et al 2010).…”

Section: Terminology and Integrated Functioning Of Gatsmentioning

confidence: 99%

A holonic simulation environment for smart transportation systems

Salido

Lorca²,

Giret

2011

International Journal of Production Research

View full text Add to dashboard Cite

Nowadays, the development of automated traffic systems has been gaining increasing attention, and a substantial amount of effort has been invested in trying to find a solution to problems associated with road transport. Among these problems are road accidents caused by human-related factors, such as tiredness, loss of control, a slow reaction time and limited field of view. Another transport-related problem is that of loss of time which may be caused by a slow driving speed due to weather conditions, road conditions, visibility, traffic congestion, etc. The general problem of automated road transportation system can be instantiated into more specific transportation domains, such as the transportation system in a city, in an airport, in a park, in a manufacturing plant. In this article, we present a holonic simulation environment for the Global Automated Transportation System in which a distributed multi-agent model is used to manage dynamic environments. The case study scenario presented in this article is related to a manufacturing plant. In this scenario, there are different transportation vehicles, such as automated guided vehicles, trucks, lift trucks and cars. These vehicles have different features that make the transportation planning a complex problem. Moreover, dynamic events are triggered to simulate anomalous situations in which a repairing process must be executed in order to maintain the transportation system into a security execution. The simulated results prove that a distributed multi-agent model for autonomous road transportation systems is a secure approach to manage critical situations and autonomous execution of different levels in the problem.

show abstract

“…The system can automate the train-operator scheduling process at SMRT, produce favourable schedules in comparison with the manual process, and handle the multiple objectives inherent in the crew scheduling system. Salido et al (2007) modelled the railway scheduling problem by means of domain-dependent distributed constraint models as they are inherently distributed and the problem complexity can be reduced by dividing the problem into a set of subproblems. Their evaluation shows that general distributed models had a better behaviour than the centralised ones.…”

Section: Heuristic Solution Techniquesmentioning

confidence: 99%

Optimising a coal rail network under capacity constraints

Liu

Kozan

2011

Flex Serv Manuf J

View full text Add to dashboard Cite

This research deals with an innovative methodology for optimising the coal train scheduling problem. Based on our previously published work, generic solution techniques are developed by utilising a ''toolbox'' of standard well-solved standard scheduling problems. According to our analysis, the coal train scheduling problem can be basically modelled a Blocking Parallel-Machine Job-Shop Scheduling (BPMJSS) problem with some minor constraints. To construct the feasible train schedules, an innovative constructive algorithm called the SLEK algorithm is proposed. To optimise the train schedule, a three-stage hybrid algorithm called the SLEK-BIH-TS algorithm is developed based on the definition of a sophisticated neighbourhood structure under the mechanism of the Best-Insertion-Heuristic (BIH) algorithm and Tabu Search (TS) metaheuristic algorithm. A case study is performed for optimising a complex real-world coal rail system in Australia. A method to calculate the lower bound of the makespan is proposed to evaluate results. The results indicate that the proposed methodology is promising to find the optimal or near-optimal feasible train timetables of a coal rail system under network and terminal capacity constraints.

show abstract

Domain Dependent Distributed Models for Railway Scheduling

Cited by 7 publications

References 7 publications

Multi agent based railway scheduling and optimization

Multi agent based railway scheduling and optimization

A holonic simulation environment for smart transportation systems

Optimising a coal rail network under capacity constraints

Contact Info

Product

Resources

About