1. LOGO Facility Location and Relocation

2. Company name www.themegallery.com Contents  1. Introduction  2. Literature review  3. A decomposition approach for facility location and relocation problem with uncertain number of future facilities

3. Company name www.themegallery.com Introduction  Definition ： Decide the location of facilities by scientific methods and make it be connected with the operation system of company to realize the purpose.

4. Company name www.themegallery.com Introduction  Outside influencing factor  Politics  Economic  Infrastructure  Competitor  Other

5. Company name www.themegallery.com Introduction  Inside influencing factor  Strategy  Product  Cost&Budget

6. Company name www.themegallery.com Introduction  The classification of location-allication model  three-dimensional  two-dimensional  One-dimensional  discrete

7. Company name www.themegallery.com Introduction  The classification of location-allication model  One facility  Many facilities

8. Company name www.themegallery.com Introduction  Objective  Minisum  Minimax  Maximin

9. Company name www.themegallery.com Introduction  Distance  Euclidean distance  Broken line distance

10. Company name www.themegallery.com Literature Review  p-Median problems a well known facility location probleman first introduced by Weber in the 1900’s  Allocation a set of soucres to some demand point for minimizing cost.  Strategic facility location: A review(Susan Hesse Owen *, Mark S. Daskin,1998)

11. Company name www.themegallery.com Literature Review  In A communication network, such as a telephone interconnection system, there is usually a switching center S. All traffic flows (messages) within the network must arrive at the center S before they are processed and then sent to their proper destination. (S. L. Hakimit,1963)

12. Company name www.themegallery.com Literature Review  In a communication networkN, such as a tele-phone interconnection system, there are usually a number of switching centers Si, S2, ***, S,. All traffic flows (messages) within the network must arrive at one of the switching centers and then be processed and sent to their proper destination. (S. L. Hakimit,1963)

13. Company name www.themegallery.com Literature Review  The stochastic extensions of the p- median problem were also introduced in literature (Berman and Krass, 2002). Zvi Drezner

14. Company name www.themegallery.com Literature Review  We are interested in finding the best location for p new facilities when some existing facilities are already located in the area.  (Zvi Drezner,1995)

15. Company name www.themegallery.com Literature Review  In this paper we investigate the situation when the number of facilities in the future is uncertain. We need to locate p facilities at the present time and will have to locate up to q additional facilities in the future.

16. Company name www.themegallery.com Literature Review  The probability that r facilities will be located in the future is given for every 0 <= r <=q.It is assumed that when new facilities are located in the future, they are located at sites which are optimal given the location of the original p facilities.  (Oded Berman, Zvi Drezner,2008)

17. Company name www.themegallery.com Literature Review  In this paper, we study a budget constrained location problem in which we simultaneously consider opening some new facilities and closing some existing facilities.  (Qian Wang, Rajan Batta;, Joyendu Bhadury, Christopher M. Rump,2003)

18. Company name www.themegallery.com Literature Review  A fuzzy multi-objective model with constraints on budget and the maximum number of relocations per period was constructed to solve the problem. Supply chain point of view of the problem was also studied in the literature.  (Melo and Saldanha da Gama, 2005)

19. Company name www.themegallery.com Literature  A decomposition approach for facility location and relocation problem with uncertain number of future facilities  Ayse Durukan Sonmez, Gino J. Lim,2012

20. Company name www.themegallery.com Literature  In order to overcome the limitations of the existing literature, we propose a solution approach that can determine the initial locations and future relocation of facilities where demand is subject to change and the number of future facilities is uncertain. Our aim is to minimize the initial and expected future weighted distances without exceeding the given budget for opening and closing facilities.

21. Company name www.themegallery.com Facility Location and Relocation Problem – Deterministic (FLRPD)

22. Company name www.themegallery.com Facility Location and Relocation Problem – Uncertainty (FLRP-U).

23. Company name www.themegallery.com Facility Location and Relocation Problem – Uncertainty (FLRP-U).

24. Company name www.themegallery.com Literature FLRP-D is NP-hard. (Wang et al., 2003). FLRP-U is NP-hard.

25. Company name www.themegallery.com Solution Algorithm

26. Company name www.themegallery.com Solution Algorithm

27. Company name www.themegallery.com FLRP-U vs. FLRP-D

28. Company name www.themegallery.com FLRP-U vs. FLRP-D

29. Company name www.themegallery.com FLRP-U vs. FLRP-D

30. Company name www.themegallery.com FLRP-U vs. FLRP-D The FLRP-U was tested on 20 randomly generated networks with 250 nodes in each network. Percent difference of the objective function values are calculated by subtracting average objective function values of FLRP-U from FLRP-D and dividing by FLRP-U for all scenarios and budget values.

31. Company name www.themegallery.com FLRP-U vs. FLRP-D

32. Company name www.themegallery.com FLRP-U vs. FLRP-D

33. Company name www.themegallery.com FLRP-U vs. FLRP-D

34. Company name www.themegallery.com FLRP-U vs. FLRP-D

35. Company name www.themegallery.com FLRP-U vs. FLRP-D

36. Company name www.themegallery.com FLRP-U vs. FLRP-D

37. Company name www.themegallery.com FLRP-U vs. FLRP-D

38. Company name www.themegallery.com Decomposition algorithm for FLRP-U

39. Company name www.themegallery.com Decomposition algorithm for FLRP-U

40. Company name www.themegallery.com Decomposition algorithm for FLRP-U

41. Company name www.themegallery.com Conclusion  In this paper, we introduced the facility location problem that considers future demand changes as well as uncertain number of future facilities which we named FLRP-U.

42. LOGO www.themegallery.com