Loading...

Developing a Model for the Maximal Covering Location Problem Considering Different Facilities, Set up Costs and Transportation Modes

Hatami Gazani, Masoud | 2014

639 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 46034 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Akhavan Niaki, Taghi
  7. Abstract:
  8. Facility location decisions are critical elements in strategic planning processes for a wide range of private and public firms. High costs associated with facility location and construction make facility location or relocation projects long-term investments. One of the most popular models among facility location models is the covering problem. This is due to its application in real life, especially for service and emergency facilities. Set covering problem (SCP) and the maximal covering location problem (MCLP) are two categories of the covering models. The presented model in this study is based on the maximal covering location problemwhile considering some real¬ life constraintssuch as spatial constraint. As the covering problem is NP-Hard, for instances that exact algorithms cannot solve them within a proper time, using a meta-heuristic or heuristic algorithm is justified. Hence, ameta-heuristic(Genetic Algorithm)and a heuristicapproach are presented in this thesis to solve the problem. Comparing the results obtained using thesemethods with instances that exact method can solve, shows good performance of the proposed heuristic and meta-heuristic algorithms
  9. Keywords:
  10. Meta Heuristic Algorithm ; Genetic Algorithm ; Heuristic Algorithm ; Covering Problems ; Facility Location Model ; Maximal Covering Location Problem

 Digital Object List

 Bookmark

No TOC