Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search

The problem of selecting upto a fixed number of sites from among a given number of potential warehouse sites for clustering a given number of ration shops to them subject to several constraints with two objectives, is considered. One of the constraints is that each ration shop should be clustered to a unique warehouse site which is selected for locating a warehouse at it; however there is no restriction on the number of ration shops to be clustered to a selected warehouse site. Another constraint is that the total cost of the warehouses to be set up should not exceed a budgetary amount. The two objectives are to minimize the total cost and duration of meeting requirements of all the ration shops from their assigned warehouses at the selected sites. A heuristic iterative algorithm incorporating tabu search is developed to find the set of efficient solutions of this problem.