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

208
views

0
downloads

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

Suggestions

OpenMETU
Core

AN INTERACTIVE APPROACH FOR A DUAL CONSTRAINT JOB SHOP SCHEDULING PROBLEM KONDAKCI, S; GUPTA, RM (Elsevier BV, 1991-01-01) Until recently, heuristic dispatching rules were the only practical means to solve the job shop scheduling problem. Currently, a promising direction in job shop scheduling is interactive scheduling. In this study an interactive scheduling approach is developed for a dual-constraint dynamic job shop production environment. The approach is used by a number of subjects in an experiment. The performance of the subjects is compared with that of dispatching rules based on tardiness and other measures relevant...
Meta-Modeling of Complexity-Uncertainty-Performance Triad in Construction Projects Dikmen Toker, İrem; Erol, Huseyin; Birgönül, Mustafa Talat (Informa UK Limited, 2020-07-01) Although conceptualized in various ways within the project management literature, complexity is usually identified as one of the drivers of uncertainty, which may result in deviations from the expected project performance in the construction industry. Effective strategies to manage risk and complexity can only be formulated by understanding the complexity-uncertainty-performance triad in construction projects and modeling the non-linear interactions between these factors. In this study, a meta-modeling appr...
A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01) This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...
Single machine scheduling with maximum earliness and number tardy Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01) In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...
On-demand conversation customization for services in large smart environments Elgedawy, I. (IBM, 2011-01-01) Services in large smart environments, as defined in this paper, are "aware" of their users' contexts and goals and are able to automatically interact with one another in order to achieve these goals. Unfortunately, interactions between services (i.e., service conversations) are not necessarily compatible, as services could have different interfaces (i.e., signature incompatibilities), as well as different logic for message ordering (i.e., protocol incompatibilities). Such conversation incompatibilities crea...

Citation Formats

H. Guden and H. Süral, “The dynamic p-median problem with mobile facilities,” COMPUTERS & INDUSTRIAL ENGINEERING, pp. 615–627, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34441.