Location Allocation Problems Under Uncertainty

Please enable javascript in your browser.

Mohammadi Vojdan, Roshanak | 2012

621 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 43391 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Akhavan Niaki, Mohammad Taghi
Abstract:
The multi-facility location-allocation problem is concerned with locating m facilities in the Euclidian plane and allocating n customers to them at minimum total cost. In this work, we focus on a probabilistic version of the problem, in which the locations of the customers and their arrivals are probabilistically distributed. We first formulate the problem as a continuous location-allocation problem. Then, we give an approximated discrete model in which facilities can be located on a set of candidate points. The proposed model has two objective functions which can be calculated only through simulation. Considering the NP-hard nature of the problem and the functions’ unique properties, we use NSGA-II and NRGA to solve the multi-objective model. On the other hand, we use genetic algorithm in order to solve the problem considering each of the objectives separately. The results are analyzed using multi-objective performance metrics
Keywords:
Uncertainty ; Genetic Algorithm ; Location-Allocation Model ; Non-Dominate Sorting Genetic Algorithm (NSGAII) Method

No TOC