Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Telegram scheduling for the periodic phase of the multifunction vehicle bus
Download
index.pdf
Date
2020
Author
Güldiken, Mustafa Çağlar
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
4
views
1
downloads
Train communication network comprises different standards such as the Wire Train Bus (WTB) for the data exchange among different vehicles and the Multifunction Vehicle Bus (MVB) for the data communication within vehicles. Specifically, MVB is a highly robust real-time field bus specifically designed for control systems built into rail-vehicles. MVB supports both periodic process data and sporadic message data transfers in the form of telegrams. In order to achieve timely and efficient data exchange on MVB, the available bandwidth has to be used efficiently. Accordingly, the main focus of this thesis is the development of systematic scheduling approaches for periodic telegrams on MVB. In this respect, the thesis provides four main contributions. First, the thesis proposes an original integer linear programming (ILP) formulation for the schedule computation on MVB. Second, the thesis develops 5 basic heuristic algorithms for the fast computation of feasible MVB schedules. Third, the thesis introduces several swap operations for improving the schedules obtained from the basic heuristics. Finally, the thesis presents a comprehensive evaluation of the developed scheduling methods. This evaluation shows that, different from the proposed heuristics, the ILP formulation cannot provide solution schedules for large telegram sets with reasonable run-times. Specifically, two of the proposed heuristics and two of the developed swap operations are found most suitable as a practical solution to the MVB scheduling problem.
Subject Keywords
Railroads.
,
Keywords: Train Communication Network
,
Multifunction Vehicle Bus
,
scheduling
,
integer linear programming
,
heuristics.
URI
http://etd.lib.metu.edu.tr/upload/12625241/index.pdf
https://hdl.handle.net/11511/44938
Collections
Graduate School of Natural and Applied Sciences, Thesis