This paper studies a Maritime Inventory Routing Problem with Time Windows (MIRPTW) for deliveries with uncertain disruptions. We consider disruptions that increase travel times between ports and ultimately affect the deliveries in one or more time windows. The objective is to find flexible solutions that can withstand unplanned disruptions. We propose a Lagrangian heuristic algorithm of obtaini...

This paper analyzes the results of two case studies in applying the Rialto/NT scheduler to real Windows 2000 applications. The first study is of a soft modem—a modem whose signal processing work is performed on the host CPU, rather than on a dedicated signal processing chip. The second is of an audio player application. Both of these are frequently used real-time applications—ones running on sy...

In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows (CVRPsTW). The Tabu Search algorithms are of two kinds: Two of them are parallel with respect to functional decomposition and one approach is a collaborative multisearch TS. The implementation builds upon a framework called Di...

This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to minimize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogeneous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation aff...

One problem with performing soft real-time computations on general-purpose operating systems is that these OSs may spend significant amounts of time in the kernel instead of performing work on behalf of the application that is nominally scheduled: the OS effectively steals time from the running application. Stolen time can be a significant obstacle to predictable program execution on real-time ...

This paper presents a column generation-based heuristics for the Vehicle Routing and scheduling Problem with Soft Time Windows (VRPSTW). The subproblem has been solved using a modified stochastic push forward insertion heuristics that incorporates the early and late arrival penalties. The useful dual information (shadow prices) from the column generation master problem guides the heuristic subp...

This paper studies a vehicle routing problem with soft time windows and stochastic travel times. A model is developed that considers both transportation costs (total distance traveled, number of vehicles used and drivers’ total expected overtime) and service costs (early and late arrivals). We propose a Tabu Search method to solve this model. An initialization algorithm is developed to construc...

One problem with pelforming soft real-time computations on general-purpose operating systems is that these OSs may spend signiJicant amounts of time in the kernel instead ofpelforming work on behalf of the application that is nominally scheduled: the OS effectively steals time from the running application. Stolen time can be a significant obstacle -to predictable program execution on real-time ...