Single facility location and relocation problem with time dependent weights and discrete planning horizon |
| |
| Authors: | Reza Zanjirani Farahani Zvi Drezner Nasrin Asgari |
| |
| Affiliation: | (1) Dept. of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran;(2) Department of ISDS, College of Business and Economics, California State University, Fullerton, CA, USA;(3) Entrepreneurship Faculty, University of Tehran, Tehran, Iran |
| |
| Abstract: | In this paper a single facility location problem with multiple relocation opportunities is investigated. The weight associated with each demand point is a known function of time. We consider either rectilinear, or squared Euclidean, or Euclidean distances. Relocations can take place at pre-determined times. The objective function is to minimize the total location and relocation costs. An algorithm which finds the optimal locations, relocation times and the total cost, for all three types of distance measurements and various weight functions, is developed. Locations are found using constant weights, and relocations times are the solution to a Dynamic Programming or Binary Integer Programming (BIP) model. The time horizon can be finite or infinite. |
| |
| Keywords: | Location Time dependent Discrete horizon Relocation |
| 本文献已被 SpringerLink 等数据库收录！ |
|
