Heuristic Algorithms for the Telegram Scheduling on MVB

Abstract

Modern rail-vehicles exchange a large amount of periodic data over in-vehicle communication buses such as the multifunction vehicle bus (MVB). This paper proposes several heuristic algorithms for the schedule computation on MVB and performs a comprehensive comparison of these algorithms to optimal schedules from an integer programming (ILP) formulation. As the main outcome, the paper shows that the proposed heuristics are highly beneficial when scheduling large telegram sets, where it is not possible to compute optimal schedules.