In a large railway passenger traffic network, a given set of trips or service blocks are to be serviced by equipment consisting of several groups of locomotives/carriages. The allowed groups per service block are predefined as patterns or multisets of locomotives and carriages. A given type of locomotive/carriage may occur with varying numbers in several groups. We search for a cost-minimal ass...

This paper discusses optimization of freight train locomotive rescheduling under a disrupted situation in the daily operations in Japan. In the light of the current framework of dispatching processes that passenger railway operators modify the entire timetables, the adjusted timetable is distributed to a freight train operator. We solve the locomotive rescheduling problem for the given adjusted...

The Cargo Express service of Swiss Federal Railways (SBB Cargo) offers fast overnight transportation of goods between selected train stations in Switzerland and is operated as a hub-andspoke system with two hubs. We present three different models for planning the operation of this service as a whole. All models capture the underlying optimization problem with a high level of detail: Traffic rou...

data visualization is the process of transforming data, information, and knowledge into visual form, making use of humans’ natural visual capabilities which reveals relationships in data sets that are not evident from the raw data, by using mathematical techniques to reduce the number of dimensions in the data set while preserving the relevant inherent properties. in this paper, we formulated d...

time-delays are important components of many dynamical systems that describe coupling or interconnection between dynamics, propagation or transport phenomena, and heredity and competition in population dynamics. the stabilization with time delay in observation or control represents difficult mathematical challenges in the control of distributed parameter systems. it is well-known that the stabi...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...