Robust facility location with mobile customers

Download

index.pdf

Date

2011

Author

Gül, Evren

Metadata

Show full item record

Item Usage Stats

123
views

76
downloads

In this thesis, we study the dynamic facility location problem with mobile customers considering the permanent facilities. Our general aim is to locate facilities considering the movements of customers in time. The problem is studied for three objectives: P-median, P-center and MINMAX P-median. We show that dynamic facility location problem is a large instance of a static facility location problem for P-median and P-center objectives. In the problem, we represent the movements of each customer in time with a time series. Using clustering approaches, we develop a heuristic approach for the problem with P-median objective. K-means algorithm is used as a clustering algorithm and dynamic time warping is used in order to define similarities between the customer time series. Solution method is tested on several experimental settings. We obtain results, which differ at most 2% from the optimal, in small computation times. Generally, in the literature, MINMAX P-median is solved with a heuristic depending on scenarios planning (see Serra and Marianov, 1998). The heuristic finds an initial solution according to scenarios, later the initial solution is tried to be improved. We provide a bounding procedure on the solution of the problem. The bounds can be used by decision maker to judge the solution quality before proceed. The bounding procedure is also analyzed in different experimental settings.

Subject Keywords

Industrial location., Industrial engineering.

URI

http://etd.lib.metu.edu.tr/upload/12613341/index.pdf
https://hdl.handle.net/11511/20652

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Material flow cost versus congestion in dynamic distributed facility layout problem Özen, Aykut; Özdemirel, Nur Evin; Department of Industrial Engineering (2008) In this thesis, we study both dynamic and distributed facility layout problems, where the demand for product mix changes over time. We propose a new simulated annealing algorithm, SALAB, for the dynamic facility layout problem. Four variants of SALAB find the best known solution for 20 of the 48 benchmark problems from the literature, improving upon the best known solutions of 18 problems. We modify SALAB to obtain DSALAB, solving the dynamic distributed facility layout problem with the objective of minimiz...
Energy efficient coverage and connectivity problem in wireless sensor networks Baydoğan, Mustafa Gökçe; Özdemirel, Nur Evin; Department of Industrial Engineering (2008) In this thesis, we study the energy efficient coverage and connectivity problem in wireless sensor networks (WSNs). We try to locate heterogeneous sensors and route data generated to a base station under two conflicting objectives: minimization of network cost and maximization of network lifetime. We aim at satisfying connectivity and coverage requirements as well as sensor node and link capacity constraints. We propose mathematical formulations and use an exact solution approach to find Pareto optimal solu...
Optimal pricing and production decisions in reusable container systems Atamer, Büşra; Bakal, İsmail Serdar; Department of Industrial Engineering (2010) In this study, we focus on pricing and production decisions in reusable container systems with stochastic demand. We consider a producer that sells a single product to the customers in reusable containers with two supply options: (i) brand-new containers, (ii) returned containers from customers. Customers purchasing the products may return the containers to the producer to receive a deposit price. The return quantity depends on both customer demand and the deposit price determined by the producer. Hence, th...
An evaluation of the reinsepction decision policies for software code inspections Nalbant, Serkan; Köksal, Gülser; Department of Industrial Engineering (2005) This study evaluates a number of software reinspection decision policies for software code inspections with the aim of revealing their effects regarding cost, schedule and quality related objectives of a software project. Software inspection is an effective defect removal technique for software projects. After the initial inspection, a reinspection may be performed for decreasing the number of remaining defects further. Although, various reinspection decision methods are proposed in the literature, no study...
A lagrangean heuristic for the two-stage modular capacitated facility location problem Sevinç, Selim; Meral, Fatma Sedef; Department of Industrial Engineering (2008) In this study, a Lagrangean heuristic based on Lagrangean relaxation and subgradient optimization is proposed for the two-stage modular capacitated facility location problem. The objective is to minimize the cost of locating and operating plants and warehouses, plus the cost of transporting goods at both echelons to satisfy the demand of customers. The difference of our study from the two-stage capacitated facility location problem is the existence of multiple capacity levels as a candidate for each plant i...

Citation Formats

E. Gül, “Robust facility location with mobile customers,” M.S. - Master of Science, Middle East Technical University, 2011.