Loading...

Development of a Covering Location Model in Congested Networks

Golchin Khiabani Azar, Negar | 2009

670 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 39429 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Shavandi, Hassan
  7. Abstract:
  8. Plants, distribution centers, and other facilities generally function for years or decades, during which time the environment in which they operate may change substantially. Costs, demands, travel times, and other inputs to classical facility location models may be highly uncertain. So when making decisions of location considering the factors that may change is beneficial. In this thesis a version of covering location model under uncertainty in a congested system is proposed. The aim is to locate m facilities to maximize the captured customer utility, having in mind that there may be up to q facilities established in future; the only information at hand about the number of the new facilities is the maximum number of facilities and the probability of each scenario. We suppose that each customer can obtain service or goods from several (rather than only one) facilities, and she chooses the facilities according the distance. The customer utility is measured as a function of the traveling distance and the mean waiting time at the facility. The problem is defined in detail and modeled as an integer programming model. Four tabu search algorithms are proposed to solve the model; it’s shown that two algorithms solve the problem in a reasonable time, but the other two need a relative unacceptable time to solve the problem without substantial change in solution accuracy. A special case of the problem where there is at most one facility may be added in the future is discussed and a repeated approach is proposed to solve this case. Results show that this approach performs quite well
  9. Keywords:
  10. Location ; Congested Network ; Experiments Design ; Tabu Search Algorithm

 Digital Object List

  • محتواي پايان نامه
  •   view

 Bookmark

No TOC