Loading...

A Heuristic Algorithm for Dynamic Maximal Covering Location Problem with a Choice of Selecting the Number of Facilities

Chavoshi, Saeed | 2015

754 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 47514 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Kourosh, Eshghi
  7. Abstract:
  8. The Dynamic Maximal Covering Location Problem (DMCLP), is one of the classes of Facility Location Problem (FLP) with a wide raneg of applications in real-life situations. In order to solve this problem, this research presents a sufficient greedy heuristic algorithm, which is capable of solving the DMCLP in large scales of 2500 demand nodes and potential facilities of 200 in 5 periods in a negligible computation time in comparison to those with exact algorithms such as branch and cut. Furthermore, in this research DMCLP is also modified to reach reach a more realistic model. In this new model, a cost behaviour is defined according to the number of facilities located. Subsequently, the new model is granted the chance to choose the optimal amount of the number of facilities according to that cost behaviour. the propoed greedy algorithm is then extended to solve the new model. The DMCLP with a choice of Variable number of Facilities which is called DMCLP-VF later on, is a generalized form of the traditional MCLP. The proposed algorithm and the extended one ore able to solve the related model in a sensible computation time with gaps of about only 2 and 3 percent respectively, compared to exact algorithms
  9. Keywords:
  10. Heuristic Algorithm ; Facility Location Model ; Marginal Cost Function ; Maximal Covering ; Greedy Approach ; Discriptive Model ; Marginal Revenue

 Digital Object List

 Bookmark

No TOC