A tabu search producer for allocation problem

A tabu search producer for allocation problem

0.00 Avg rating0 Votes
Article ID: iaor2001552
Country: Slovakia
Volume: 4
Issue: 4
Start Page Number: 305
End Page Number: 312
Publication Date: Jan 1996
Journal: Central European Journal of Operations Research
Authors:
Keywords: tabu search
Abstract:

This paper presents a tabu search producer 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 minimising the transportation cost. The proposed tabu search approach is used as a postoptimalization algorithm, which improves the solution found by a specialized heuristics.

Reviews

Required fields are marked *. Your email address will not be published.