Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search
- 60 Downloads
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 in 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.
KeywordsBicriteria Efficient solution Heuristic programming Tabu search Clustering Warehouse site selection
Unable to display preview. Download preview PDF.
- Ignizio J.P., Cavalier T.M.: Linear Programming, Prentice-Hall, Englewood Cliffs, New Jersey. 457–505 (1994)Google Scholar
- Praveena V., Prasad B.V.N.S., Prakash S.: Selection of warehouse sites for clustering ration shops to them with two objectives, Mathematics and Statistics in Engineering and Technology: Proceedings of the Seminar on Recent Trends and Advances of Mathematics and Statistics in Engineering and Technology Held at Indian School of Mines, Dhanbad During November 28–29, 1997, Narosa Publishing House, New Delhi, 174–179 (1999)Google Scholar
- Rardin R.L.: Optimization in Operations Research, Pearson Education (Singapore) Pte. Ltd., Indian Branch, New Delhi. 15–16, 670–705 (1998)Google Scholar
- Ignizio J.P.: A Heuristic Solution to Generalized Covering Problems, Ph. D. Dissertation, Virginia Polytechnic Institute, Blacksburg (1971)Google Scholar
- Ignizio J.P.: A Method to Achieve Optimum Air Defense Sensor Allocation, M.S. Thesis, University of Alabama, Alabama (1968)Google Scholar
- Ignizio J.P.: Linear programming in Single and Multiobjective Systems, Prentice-Hall, Englewood Cliffs, New Jersey 374–376, 475–483 (1982)Google Scholar
- Steuer R.E.: Multiple Criteria Optimization: Theory, Computation, and Application, Wiley, New York. 138–159 (1986)Google Scholar
- Prakash S., Gupta A.: Nondominated solutions of a site selection problem with two objectives without assignment of priorities to them, News Bull Calcutta Math Soc, 29(1–3), 3–8 (2006)Google Scholar
- Prakash S., Madhusudan A., Kunal.: Clustering offices of a company to internet service providers, Proceedings of the National Academy of Sciences, India, Section A, 77(1), 31–35 (2007). An earlier version of the paper has appeared under the title “Efficient solutions for the problem selecting internet service providers and clustering offices of a company to them with two objectives”, Proceedings of the National Conference on Frontiers in Applied and Computational Mathematics Held at Thapar Institute of Engineering and Technology, Patiala During March 04–05, 2005, Edited by H.S. Kasana, Allied publishers Private Limited, New Delhi, 441–448 (2005)Google Scholar