With greater availability of real-time information systems, algorithms are needed to support commercial fleet operators in their decisions to assign vehicles and drivers to loads in a dynamic environment. We present a rolling horizon framework for the dynamic assignment and sequencing of trucks to jobs consisting of picking up and delivering full truckloads when requests for Submitted for prese...

This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost by determining the time period for opening, closing, or retaining an existing facility in a given location. To solve this challenging NP-hard problem, this paper develops a unique hybrid solution algorithm that combines a rolling horizon algorithm with an ac...

The Virtual Factory is a job shop scheduling tool that was developed at NC State. It has been found to provide nearoptimal solutions to industrial-sized problems in seconds. Recently, the Virtual Factory was expanded to include interfactory transportation operations which enabled the detailed scheduling of entire multi-factory manufacturing supply chains. Separately, a rolling horizon procedure...

Observation task planning is a key issue and the first step in development of automated Satellite Laser Ranging (SLR) systems. Aiming at problem dynamic change cloud cover during SLR operation, this paper proposes an autonomous mission algorithm for based on Rolling Horizon Optimization (RHO) framework. A hybrid event- cycle-driven replanning mechanism adopted, four functional modules, rolling,...

Traditional inventory routing problems ignore the time consumption in transportation. In this paper, an problem with air–land transportation and route-dependent lead times is studied. The model based on rolling horizon framework which can serve as a “here-and-now” approximation for multi-period problems. A planning crossing strategy proposed to consider effect of single-period decision long-ter...

In this paper, production planning and scheduling problems are addressed through a hierarchical framework. The planning problem aggregates orders in the planning period and considers uncertainty utilizing a multi-stage stochastic programming formulation where three stages are considered with increasing level of uncertainty. The planning model includes material balances and time horizon constrai...

We consider the quasi-de Sitter geometry of the inflationary universe. We calculate the energy flux of the slowly rolling background scalar field through the quasi-de Sitter apparent horizon and set it equal to the change of the entropy (1/4 of the area) multiplied by the temperature, dE = TdS. Remarkably, this thermodynamic law reproduces the Friedmann equation for the rolling scalar field. Th...

To the best of our knowledge, research in the Dynamic Plant Layout Problem (DPLP) assumes that the planning horizon is fixed and that material flows are known with certainty. But in practice, many companies use rolling planning horizons. Further, they have to deal with the effect of uncertainty in material flow forecasts. This paper investigates the performance of algorithms under fixed and rol...

This paper describes a method for constrained state estimation based on receding horizon optimization. The case here studied corresponds to an optimization horizon of size two and a constraint horizon of size one. It is shown that, in this case, a simple closed-form solution can be obtained. The resulting estimator is called a Rolling Horizon Estimator with Constraint Horizon One. It is shown t...

In this paper we model production problems where yields are stochastic, demands are substitutable, and several items are jointly produced. We have formulated this problem as a profit maximizing convex program, and have studied two solution procedures. The first method solves finite horizon stochastic programs on a rolling horizon basis. We have developed a decomposition algorithm for solving th...