This paper addresses the Two-level Storage Location Assignment Problem (TSLAP) for two level low-level picker-to-part warehouses. The first level consists of a forward area from which all picking is done. The second level consists of a reserve storage area, from which the forward area is...

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing <p> Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived <p> from precedence constraints in the Asymmetric Traveling Salesman Problem with Time <p> Windows and to k-path cuts for...</p></p></p>

We present a Dantzig-Wolfe procedure for the ship scheduling problem with flexible cargo sizes. This problem is similar to the well-known pickup and delivery problem with time windows, but the cargo sizes are defined by intervals instead of by fixed values. The flexible cargo sizes have...

This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage...