Showing papers by "André Langevin published in 2009"

A vehicle routing cost evaluation algorithm for the strategic analysis of radial distribution networks

Abstract: This article presents a new algorithm, based on bin packing algorithms, that determines vehicle routing costs on networks with certain geographic characteristics. Requiring very little data and computation time, the algorithm is used to test the impact of adding flexibility to a retailer’s Canadian distribution operations. It is shown that it is possible to save 5–10% of vehicle routing costs by modifying shipping schedules.

Minimising the peak load in a shared storage system based on the duration-of-stay of unit loads

Abstract: The peak load is the maximum daily processing capacity requirement in a warehouse, and is an alternative criterion for the storage location assignment problem in warehousing management. This paper addresses the problem of minimising the peak load in a storage/retrieval system with shared storage policy based on duration-of-stay of unit loads. A mixed integer programming model is presented. Two heuristics are developed to solve the problem. Their performances on different criteria are compared by computational tests.

Determining the storage location for outbound containers in a maritime terminal

Abstract: This paper addresses storage location assignment problem for outbound containers. The problem is decomposed into two stages. The amount of locations in each block, which will be assigned to the containers bounded for different ships, is determined in the first stage. The exact storage location for each container is determined in the second stage. The problem in the first stage is solved by a mixed integer programming model, while hybrid sequence stacking algorithm is applied to solve the problem in the second stage. Experimental results show that the proposed approach is effective and efficient in solving the storage location assignment problem for outbound containers.