We consider a selective vehicle routing problem, in which customers belonging to di?fferent partners in a logistic coalition are served in a single logistic operation with multiple vehicles. Each partner determines a cost of non-delivery (CND) for each of its customers, and a central algorithm...

This paper applies several cost allocation methods to a real life case study of fresh produce traders, jointly organising their transportation from the auction to a joint transport platform. The allocation may differ depending on whether the costs are divided on a daily basis or aggregated over...

In this paper, a metaheuristic approach is presented to solve the Clustered Vehicle Routing Problem (CluVRP). The CluVRP, in which customers are grouped into predefi?ned clusters, can be seen as a generalisation of the classical Capacitated Vehicle Routing Problem (CVRP). When serving all these...

We present an effective scheduling heuristic for realistic production planning in a petrochemical blending plant? The considered model takes into account orders spanning a multi-product portfolio with multiple bills of materials per product, that need to be scheduled on shared production...

The basic deterministic stationary inventory problem, in which backorders are allowed, is analyzed. Instead of considering the backorder cost to be a cost per unit and per time, we also suppose the presence of a fixed backorder cost per unit. The latter generates a supplementary dependence of...