Ľudmila Jánošíková

Abstract

This paper presents a tabu search procedure for the allocation problem. The problem considered deals with a set of customers and a set of depots with capacity constraints. The assignment of customers to depots has to be established in order to satisfy the whole customer demand from exactly one depot, while minimizing the transportation cost. The proposed tabu search approach is used as a postoptimization algorithm, which improves the solution found by a specialized heuristics.