Learn More
Given a distribution center and a set of sales-points with their demand rates, the objective of the inventory routing problem (IRP) is to determine a distribution plan that minimizes fleet operating and average total distribution and inventory holding costs without causing a stock-out at any of the sales-points during a given planning horizon. We propose a(More)
Flow reasoning has been successfully used in CP for more than a decade. It was originally introduced by Régin in the well-known Alldifferent and Global Cardinality Constraint (GCC) available in most of the CP solvers. The BinPacking constraint was introduced by Shaw and mainly uses an independent knapsack reasoning in each bin to filter the possible bins(More)
This paper considers the combination of berth and crane allocation problems in container terminals. We propose a novel approach based on constraint programming able to model many realistic operational constraints. The costs for berth allocation, crane allocation, time windows, breaks and transition times during gang movements are optimized simultaneously.(More)
We model the behavior of the demand distribution and lead-time distribution separately and determine the value of demand during lead time by discrete-event simulation. A new methodology determines the optimal inbound-resupply strategy when suppliers ship goods to receivers. An evolutionary metaheuristic uses discrete-event simulation to calculate safety(More)