The paper concentrates on modeling the data that can be described by a homogeneous or non-homogeneous Poisson process. The goal is to decide whether the intensity of the process is constant or not. In technical practice, e.g., it means to decide whether the reliability of the system remains the same or if it is improving or deteriorating. We assume two situations. First, when only the counts of...

By convention, and even more often, as an unintentional consequence of design, time distributions of latency and infectious durations in stochastic epidemic simulations are often exponential. The skewed distribtion typically leads to unrealistically short times. We examine the effects of altering the distribution latency and infectious times by comparing the key results after simulation with ex...

This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...

In this work, we investigate a multi-period Home Health Care Scheduling Problem (HHCSP) under stochastic service and travel times. We first model the deterministic problem as an integer linear programming model that incorporates real-world requirements, such as time windows, continuity of care, workload fairness, inter-visit temporal dependencies. We then extend the model to cope with uncertain...

In this paper, we introduce a variant of the orienteering problem in which travel and service times are stochastic. If a delivery commitment is made to a customer and is completed by the end of the day, a reward is received, but if a commitment is made and not completed, a penalty is incurred. This problem reflects the challenges of a company who, on a given day, may have more customers than it...

Reliable shortest path finding in stochastic networks with spatial correlated link travel times Bi Yu Chen a b , William H.K. Lam a , Agachai Sumalee a & Zhi-lin Li c a Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China b State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR Ch...

The problem of maximizing the probability of two trucks being coordinated to merge into a platoon on a highway is considered. Truck platooning is a promising technology that allows heavy vehicles to save fuel by driving with small automatically controlled intervehicle distances. In order to leverage the full potential of platooning, platoons can be formed dynamically en route by small adjustmen...