Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
The dynamic p-median problem with mobile facilities
Date
2019-09-01
Author
Guden, Huseyin
Süral, Haldun
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
11
views
0
downloads
Cite This
Being motivated by real life applications in construction management, we consider the dynamic p-median problem and its extension with mobile facilities. The number of facilities changes over a planning horizon where one or more facilities can be opened, relocated, or closed in any period. The problem is to determine (i) facility locations, (ii) opening/closing times of facilities, (iii) routes of mobile facilities, and (iv) demand allocations to open facilities such that the total cost is minimized. We present a mixed integer programming formulation of the dynamic p-median problem using discretization of distances to control the locational decision variables. We develop a branch and price algorithm and constructive heuristics to solve the problem. Extensive computational results of the solution method are provided on a set of test problem instances.
Subject Keywords
General Engineering
,
General Computer Science
URI
https://hdl.handle.net/11511/34441
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
DOI
https://doi.org/10.1016/j.cie.2019.06.024
Collections
Department of Industrial Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Guden and H. Süral, “The dynamic p-median problem with mobile facilities,”
COMPUTERS & INDUSTRIAL ENGINEERING
, vol. 135, pp. 615–627, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34441.