Scatter Search -- Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem -- A Scatter Search Heuristic for the Fixed-Charge Capacitated Network Design Problem -- Tabu Search -- Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems --...

This paper addresses an important combination of three-dimensional loading and vehicle routing, known as the Three-Dimensional Loading Capacitated Vehicle Routing Problem. The problem calls for the combined optimization of the loading of freight into vehicles and the routing of vehicles along a...

We develop technology to plan delivery routes for the supply of blood products to hospitals by a blood bank. The technology produces low cost, robust plans that hedge against the natural uncertainty associated with blood product usage at hospitals. The technology relies on sampling-based...

The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem (VRP) to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon...

Purpose – The purpose of this paper is to present an operations research (OR) model for planning water distribution tours in disaster relief. Especially in situations after a disaster occurrence, characterized by instability and the immediate need of help, high‐quality decisions have to be...

In this paper, we consider a steel coil storage and distribution problem for a steel producing company. The company has several warehouses, and relocations of steel coils to different warehouses before they are dispatched are inevitable. These relocations are driven by a lack of capacity or the...