The Weber problem with surprise surplus

Abstract

In the classical Weber problem the quantities to be transported from the supply and demand point are known. In this paper a problem is considered in which the total available supply exceeds the total demand. In such situation the optimal selection of points of supply, together with supplied quantities, depends uponthesite of the facility. Several heuristics and a branch and bound algorithm for solving this problem are proposed and computational experience is presented.