4.5 Article

Emergency facility location under random network damage: Insights from the Istanbul case

Journal

COMPUTERS & OPERATIONS RESEARCH
Volume 62, Issue -, Pages 266-281

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2014.07.015

Keywords

Facilities planning and design; Humanitarian logistics; Disaster preparedness; Facility location; Link failures; Spatial and structural correlation

Funding

  1. Tubitak

Ask authors/readers for more resources

Damage to infrastructure, especially to highways and roads, adversely affects accessibility to disaster areas. Predicting accessibility to demand points from the supply points by a systematic model would lead to more effective emergency facility location decisions. To this effect, we model the spatial impact of the disaster on network links by random failures with dependency such that failure of a link induces failure of nearby links that are structurally more vulnerable. For each demand point, a set of alternative paths is generated from each potential supply point so that the shortest surviving path will be used for relief transportation after the disaster. The objective is to maximize the expected demand coverage within a specified distance over all possible network realizations. To overcome the computational difficulty caused by extremely large number of possible outcomes, we propose a tabu search heuristic that evaluates candidate solutions over a sample of network scenarios. The scenario generation algorithm that represents the proposed distance and vulnerability based failure model is the main contribution of our study. The tabu search algorithm is applied to Istanbul earthquake preparedness case with a detailed analysis comparing solutions found in no link failure, independent link failure, and dependent link failure cases. The results show that incorporating dependent link failures to the model improves the covered demand percentages significantly. (C) 2014 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Management

Prioritized single nurse routing and scheduling for home healthcare services

Ahmet Cinar, F. Sibel Salman, Burcin Bozkaya

Summary: The study focuses on how a nurse can prioritize patients for home visits based on factors such as last visit time and severity of condition. The goal is to maximize the total priority of visited patients and minimize traveling time. Results show that the matheuristic outperforms ALNS in large instances, although ALNS has shorter running times.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Article Computer Science, Software Engineering

The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures

Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev

ALGORITHMICA (2020)

Article Management

Optimizing onboard catering loading locations and plans for airlines

Seren Bilge Yilmaz, Eda Yucel

Summary: Airlines provide complimentary or for-purchase in-flight meals, which are ideally loaded immediately before the flight. To minimize costs, they determine catering loading sites based on flight plan and estimated consumption for each flight.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2021)

Article Operations Research & Management Science

Online routing and scheduling of search-and-rescue teams

Davood Shiri, Vahid Akbari, F. Sibel Salman

OR SPECTRUM (2020)

Article Management

Routing multiple work teams to minimize latency in post-disaster road network restoration

Meraj Ajam, Vahid Akbari, Sibel Salman

Summary: After a disaster, it is crucial to restore blocked roads to enable relief efforts. This study proposes algorithms to determine the schedule and routes of multiple work teams, with the goal of minimizing the latency of reaching critical locations. Coordination among teams is essential, and heuristic methods are developed to handle the coordination requirement. The results show the superiority of solutions obtained by incorporating coordination.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Economics

An online optimization approach to post-disaster road restoration

Vahid Akbari, Davood Shiri, F. Sibel Salman

Summary: This article studies post-disaster road restoration problem, analyzing the performance of online algorithms against offline optimal solutions using competitive ratio. An optimal online algorithm is proposed, utilizing mixed integer programming model and a novel polynomial time online algorithm, showing superior performance in experiments.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2021)

Article Management

Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics

Eda Yucel, F. Sibel Salman, Gunes Erdogan

Summary: This paper introduces a multi-period, two-dimensional vehicle loading and dispatching problem, aiming to minimize the total vehicle usage and earliness penalty costs, and provides a Mixed-Integer Linear Programming model (MILP) and an Adaptive Large Neighbourhood Search (ALNS) algorithm for solving the problem.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Management

Relief Aid Provision to En Route Refugees: Multi-Period Mobile Facility Location with Mobile Demand

O. Baturhan Bayraktar, Dilek Gunnec, F. Sibel Salman, Eda Yucel

Summary: This article introduces the multi-period facility location problem on mobile facilities for aiding refugee groups, aiming to minimize setup and travel costs while ensuring service requirement. The authors propose a mixed integer linear programming model and develop an adaptive large neighborhood search algorithm to solve large-scale instances. By testing the data from the 2018 Honduras Migration Crisis, the effectiveness of the algorithm is demonstrated.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Computer Science, Interdisciplinary Applications

Two dimensional guillotine cutting stock and scheduling problem in printing industry

Mahdi Mostajabdaveh, F. Sibel Salman, Nadia Tahmasbi

Summary: This study addresses a two-dimensional cutting stock problem combined with production scheduling in the paper printing industry. The researchers propose a nonlinear integer programming model and a genetic algorithm to solve the problem, and also design a packing routine to generate balanced printing patterns. Computational experiments on large-scale real-world data demonstrate the efficiency of the genetic algorithm.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Operations Research & Management Science

Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization

Vahid Akbari, Ihsan Sadati, F. Sibel Salman, Davood Shiri

Summary: We study a problem of home healthcare routing and scheduling, where healthcare provider teams need to visit a set of patients at their homes. The problem aims to assign patients to teams and generate routes so that each patient is visited once. By prioritizing patients based on severity or urgency, the problem minimizes patients' waiting time, considering triage levels as weights. To solve this problem, we propose an integer programming model and a metaheuristic algorithm. The models are evaluated on different instances, and the algorithm achieves optimal solutions within seconds for all instances. A case study on Covid-19 patients in Istanbul provides insights for planners through various analyses.

OR SPECTRUM (2023)

Article Business

Managing Home Health-Care Services With Dynamic Arrivals During a Public Health Emergency

Ahmet Cinar, F. Sibel Salman, Ozgur M. Araz, Mert Parcaoglu

Summary: In this article, we propose a reoptimization framework to address the dynamic problem of home healthcare during a public health emergency. The framework aims to maximize the total priority of visited patients, minimize the overtime for healthcare providers, and reduce the total routing time. By formulating a mixed-integer programming model, we periodically determine the order of patient visits on each day to ensure urgent patients are visited within the current day while postponing visits of other patients if necessary. The effectiveness of the schedule is evaluated based on metrics such as the number of postponed visits, waiting time of urgent patients, and required overtime. The proposed approach is compared with practical heuristics in a nervous service system, showcasing its efficacy during the COVID-19 pandemic.

IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT (2022)

Article Computer Science, Interdisciplinary Applications

A learning based algorithm for drone routing

Umut Ermagan, Baris Yildiz, F. Sibel Salman

Summary: This study introduces a learning-based algorithm to solve the drone routing problem, which shows promising performance in experiments.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Computer Science, Hardware & Architecture

Online optimization of first-responder routes in disaster response logistics

D. Shiri, F. S. Salman

IBM JOURNAL OF RESEARCH AND DEVELOPMENT (2020)

Article Management

Role of Analytics for Operational Risk Management in the Era of Big Data

Ozgur M. Araz, Tsan-Ming Choi, David L. Olson, F. Sibel Salman

DECISION SCIENCES (2020)

Article Management

Data Analytics for Operational Risk Management

Ozgur Merih Araz, Tsan-Ming Choi, David L. Olson, F. Sibel Salman

DECISION SCIENCES (2020)

Article Computer Science, Interdisciplinary Applications

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery

Rafael Praxedes, Teobaldo Bulhoes, Anand Subramanian, Eduardo Uchoa

Summary: The Vehicle Routing Problem with Simultaneous Pickup and Delivery is a classical optimization problem that aims to determine the least-cost routes while meeting pickup and delivery demands and vehicle capacity constraints. In this study, a unified algorithm is proposed to solve multiple variants of the problem, and extensive computational experiments are conducted to evaluate the algorithm's performance.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An asynchronous parallel benders decomposition method for stochastic network design problems

Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

Summary: Benders decomposition (BD) is a popular solution algorithm for stochastic integer programs. However, existing parallelization methods often suffer from inefficiencies. This paper proposes an asynchronous parallel BD method and demonstrates its effectiveness through numerical studies and performance enhancement strategies.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Giulia Caselli, Maxence Delorme, Manuel Iori, Carlo Alberto Magni

Summary: This study addresses a real-world scheduling problem and proposes four exact methods to solve it. The methods are evaluated through computational experiments on different types of instances and show competitive advantages on specific subsets. The study also demonstrates the generalizability of the algorithms to related scheduling problems with contiguity constraints.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu

Summary: This paper examines the problem of two-dimensional irregular multiple-size bin packing and proposes a solution that utilizes an iteratively doubling binary search algorithm to find the optimal bin combination, and further optimizes the result through an overlap minimization approach.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers

Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie

Summary: Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is crucial for safety driving and protecting the interests of drivers. This paper addresses the drop-and-pull container drayage problem with flexible assignment of work break, proposing a mixed-integer programming model and an algorithm for solving realistic-sized instances. Experimental results show the effectiveness of the proposed algorithm in handling vehicle scheduling and routing with work break assignment.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Manipulating hidden-Markov-model inferences by corrupting batch data

William N. Caballero, Jose Manuel Camacho, Tahir Ekin, Roi Naveiro

Summary: This research provides a novel probabilistic perspective on the manipulation of hidden Markov model inferences through corrupted data, highlighting the weaknesses of such models under adversarial activity and emphasizing the need for robustification techniques to ensure their security.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images

Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, H. R. Tizhoosh

Summary: This paper proposes a multi-objective evolutionary framework for compressing feature vectors using deep autoencoders. The framework achieves high classification accuracy and efficient image representation through a bi-level optimization scheme. Experimental results demonstrate the effectiveness and efficiency of the proposed framework in image processing tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White

Summary: This paper discusses instance generation methods for the multidemand multidimensional knapsack problem and introduces a primal problem instance generator (PPIG) to address feasibility issues in current instance generation methods.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with Benders decomposition method

Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao

Summary: This paper investigates the design of real-time train regulation strategies for urban rail networks to reduce train deviations and passenger waiting times. A mixed-integer nonlinear programming (MINLP) model is used and an efficient iterative optimization (IO) approach is proposed to address the complexity. The generalized Benders decomposition (GBD) technique is also incorporated. Numerical experiments show the effectiveness and computational efficiency of the proposed method.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control

Xinghai Guo, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu

Summary: This study proposes a bi-level scheduling method that utilizes unmanned surface vehicles for container transportation. By formulating mission decision and path control models, efficient container transshipment and path planning are achieved. Experimental results demonstrate the effectiveness of the proposed approach in guiding unmanned surface vehicles to complete container transshipment tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Review Computer Science, Interdisciplinary Applications

Metaheuristics for bilevel optimization: A comprehensive review

Jose-Fernando Camacho-Vallejo, Carlos Corpus, Juan G. Villegas

Summary: This study aims to review the published papers on implementing metaheuristics for solving bilevel problems and performs a bibliometric analysis to track the evolution of this topic. The study provides a detailed description of the components of the proposed metaheuristics and analyzes the common combinations of these components. Additionally, the study provides a detailed classification of how crucial bilevel aspects of the problem are handled in the metaheuristics, along with a discussion of interesting findings.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Electric vehicle-based express service network design with recharging management: A branch-and-price approach

Xudong Diao, Meng Qiu, Gangyan Xu

Summary: In this study, an optimization model for the design of an electric vehicle-based express service network is proposed, considering limited recharging resources and power management. The proposed method is validated through computational experiments on realistic instances.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks

Ramon Piedra-de-la-Cuadra, Francisco A. Ortega

Summary: This study proposes a procedure to select candidate sites optimally for ensuring energy autonomy and reinforced service coverage for electric vehicles, while considering demand and budget restrictions.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Cutting Plane Approaches for the Robust Kidney Exchange Problem

Danny Blom, Christopher Hojny, Bart Smeulders

Summary: This paper focuses on a robust variant of the kidney exchange program problem with recourse, and proposes a cutting plane method for solving the attacker-defender subproblem. The results show a significant improvement in running time compared to the state-of-the-art, and the method can solve previously unsolved instances. Additionally, a new practical policy for recourse is proposed and its tractability for small to mid-size kidney exchange programs is demonstrated.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Generating linear programming instances with controllable rank and condition number

Anqi Li, Congying Han, Tiande Guo, Bonan Li

Summary: This study proposes a general framework for designing linear programming instances based on the preset optimal solution, and validates the effectiveness of the framework through experiments.

COMPUTERS & OPERATIONS RESEARCH (2024)