On the integration of container availability constraints into daily drayage operations arising in France: Modelling and optimization

International audienc

The Relationship of Beef Primal Cut Composition to Overall Carcass Composition

The amount of lean, subcutaneous fat, seam fat and bone of each of the four major primal cuts (round, rib, loin and chuck) were used in combination with yield grade to predict total side composition. The makeup of each primal is highly related to total carcass composition The decision of which primal to fabricate depends on the sex of the animal and which component (lean, subcutaneous fat, seam fat or bone) is of greatest interest

Auditing Workflow Executions against Dataflow Policies

This paper presents IFAudit, an approach for the audit of data ow policies in workflow models. IFAudit encompasses three steps. First, propagation graphs are generated from workflows' log data. They represent the explicit information flows caused, e.g., by data access and message-passing, that have occurred during the execution of the workflow. Second, dataflow policies expressing security and compliance requirements are formalized in a system-independent manner as a binary relation on the workflow principals. Third, an audit algorithm analyzes the propagation graphs against the policies and delivers evidence with regard to whether the workflow complies with them. Besides presenting the corresponding algorithms, the paper discusses possible extensions to address more general types of information flws

The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods

We present a “rich” Petrol Station Replenishment Problem (PSRP) with real-life characteristics that represents the complexities involved in actual operations. The planning is optimised over multiple days and therefore, the new variant can be classified as the Multi-Period Petrol Station Replenishment Problem (MP-PSRP). A Mixed Integer Linear Programming (MILP) formulation is developed and a decomposition heuristic is proposed as a solution algorithm, which is evaluated with a case study from a real-life petrol distributor in Denmark. To determine delivery quantities, the heuristic uses the newly introduced simultaneous dry run inventory policy. A procedure is applied to improve the initial solution. A commercial solver is able to find feasible solutions only for instances with up to 20 stations and 7 days for the MILP model where optimality is guaranteed for instances up to 10 stations and 5 days. The heuristic on the other hand provides feasible solutions for the full case study of 59 stations and 14 days, within a time limit of 2 h.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Transport Engineering and LogisticsTransport and Plannin