Selin Özpeynirci
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Selin Özpeynirci has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Özgür Özpeynirci
Department of Logistics Management, Izmir University of Economics, Izmir, Turkey
6 shared publications - Burak Gökgür
Sabancı Business School Sabancı University İstanbul Türkiye
4 shared publications - Vincent Mousseau
MICS, CentraleSupélec, Université Paris-Saclay, Gif-sur-Yvette, France
4 shared publications - Arya Sevgen Misic
Izmir Ekonomi Universitesi
1 shared publication - Arya Sevgen Misiç
İzmir University of Economics
1 shared publication Asli Gül Buğdaci
Industrial Engineering Department , Middle East Technical University , Ankara , Turkey
1 shared publication
Latest Publications
- Open Access
- 27 October 2026
- Published by Elsevier in SSRN Electronic Journal
A Multi-Warehouse Multi-Tour Drone Routing Model for Post-Disaster Relief Distribution:Metaheuristics and a Case Study of İstanbul
Post-disaster humanitarian logistics operations frequently face severe gridlocks in metropolitan environments due to extensive road network damage and debris accumulation. Under such operational paralysis, Unmanned Aerial Vehicles (UAVs) provide a resilient alternative for last-mile emergency relief distribution. This study addresses a synchronized, multi-warehouse, multi-UAV, multi-tour vehicle routing problem tailored to urban post-disaster logistics. This involves capacity-constrained drones performing multiple consecutive delivery tours subject to mandatory warehouse battery-exchange and reloading turnaround times. To prioritize critical emergency demands, we formulate a Mixed-Integer Linear Programming (MILP) model that minimizes the total priority-weighted arrival time, explicitly incorporating urgency scores derived from fault-line proximity. Given the combinatorial NP-hardness of the underlying problem, we develop a multi-stage metaheuristic architecture consisting of a constraint-aware Greedy Randomized Adaptive Search Procedure (GRASP) to generate executable seed topologies. This approach is complemented with two advanced search engines: a population-based Lamarckian Hybrid Genetic Algorithm (HGA) embedding memetic local-search overwrites, and a single-trajectory Dynamic Hybrid Neighborhood Search (HNS) featuring cataclysmic disruption mechanics to escape deep local optima. The proposed methodologies are rigorously calibrated via Taguchi Design of Experiments and evaluated on benchmark instances alongside a realistic large-scale earthquake case study of İstanbul comprising 6 depots and 171 assembly areas. Computational experiments demonstrate that both custom heuristics match CPLEX global optimal baselines on small instances, and, on medium and large problem instances, systematically outperform the state-of-the-art commercial solver Hexaly with HNS securing 68.7% of the best-known solutions. Furthermore, managerial analyses reveal critical operational thresholds in drone fleet sizing and underscore the vital role of dynamic inter-depot fleet relocation in post-disaster response.
- 27 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Multi-Warehouse Multi-Tour Drone Routing Model for Post-Disaster Relief Distribution:Metaheuristics and a Case Study of İstanbul
Post-disaster humanitarian logistics operations frequently face severe gridlocks in metropolitan environments due to extensive road network damage and debris accumulation. Under such operational paralysis, Unmanned Aerial Vehicles (UAVs) provide a resilient alternative for last-mile emergency relief distribution. This study addresses a synchronized, multi-warehouse, multi-UAV, multi-tour vehicle routing problem tailored to urban post-disaster logistics. This involves capacity-constrained drones performing multiple consecutive delivery tours subject to mandatory warehouse battery-exchange and reloading turnaround times. To prioritize critical emergency demands, we formulate a Mixed-Integer Linear Programming (MILP) model that minimizes the total priority-weighted arrival time, explicitly incorporating urgency scores derived from fault-line proximity. Given the combinatorial NP-hardness of the underlying problem, we develop a multi-stage metaheuristic architecture consisting of a constraint-aware Greedy Randomized Adaptive Search Procedure (GRASP) to generate executable seed topologies. This approach is complemented with two advanced search engines: a population-based Lamarckian Hybrid Genetic Algorithm (HGA) embedding memetic local-search overwrites, and a single-trajectory Dynamic Hybrid Neighborhood Search (HNS) featuring cataclysmic disruption mechanics to escape deep local optima. The proposed methodologies are rigorously calibrated via Taguchi Design of Experiments and evaluated on benchmark instances alongside a realistic large-scale earthquake case study of İstanbul comprising 6 depots and 171 assembly areas. Computational experiments demonstrate that both custom heuristics match CPLEX global optimal baselines on small instances, and, on medium and large problem instances, systematically outperform the state-of-the-art commercial solver Hexaly with HNS securing 68.7% of the best-known solutions. Furthermore, managerial analyses reveal critical operational thresholds in drone fleet sizing and underscore the vital role of dynamic inter-depot fleet relocation in post-disaster response.
- 6 October 2026
- Published by Springer Nature
- p. 601-613
Use of Unmanned Aerial Vehicles for Post-disaster Response
- 6 October 2026
- Published by Springer Nature
- p. 601-613
Use of Unmanned Aerial Vehicles for Post-disaster Response
- 7 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 300
Cooperative scheduling and subcontracting strategies for products with yield decay: A mixed-integer programming approach
- 7 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 300
Cooperative scheduling and subcontracting strategies for products with yield decay: A mixed-integer programming approach
- 6 June 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 169
Multi-objective shipment consolidation and dispatching problem
- 6 June 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 169
Multi-objective shipment consolidation and dispatching problem
- 25 August 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 160
Multiple traveling salesperson problem with drones: General variable neighborhood search approach
- 25 August 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 160
Multiple traveling salesperson problem with drones: General variable neighborhood search approach
- 7 April 2022
- Published by Springer Nature in 4OR
- Vol. 21 (1) , 125-149
A decomposition based minimax regret approach for inverse multiple criteria sorting problem
- 7 April 2022
- Published by Springer Nature in 4OR
- Vol. 21 (1) , 125-149
A decomposition based minimax regret approach for inverse multiple criteria sorting problem
- 1 March 2022
- Published by Gazi University Journal of Science in Gazi University Journal of Science
- Vol. 35 (1) , 113-130
Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems
This study addresses the problem of minimizing tool switching instants in automated manufacturing systems. There exist a single machine and a group of jobs to be processed on it. Each job requires a set of tools, and due to limited tool magazine capacity, and because it is not possible to load all available tools on the machine, tools must be switched. The ultimate goal, in this framework, is to minimize the total number of tool switching instants. We provide a mathematical programming model and two constraint programming models for the problem. Because the problem is proven to be NP-hard, we develop two heuristic approaches, and compare their performance with methods described in the literature. Our analysis indicates that our constraint programming models perform relatively well in solution quality and execution time in small-sized problem instances. The performance of our greedy approach shows potential, reaching the optimal solution in 82.5% of instances. We also statistically demonstrate that the search algorithm enhances the quality of the solution obtained by the greedy heuristic, particularly in large sets. Hence, the solution approach, i.e., the greedy heuristic and the search algorithm proposed in this study is able to quickly reach near-optimal solutions, showing that the method is appropriate for manufacturing settings requiring sudden adjustments.
- 1 March 2022
- Published by Gazi University Journal of Science in Gazi University Journal of Science
- Vol. 35 (1) , 113-130
Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems
This study addresses the problem of minimizing tool switching instants in automated manufacturing systems. There exist a single machine and a group of jobs to be processed on it. Each job requires a set of tools, and due to limited tool magazine capacity, and because it is not possible to load all available tools on the machine, tools must be switched. The ultimate goal, in this framework, is to minimize the total number of tool switching instants. We provide a mathematical programming model and two constraint programming models for the problem. Because the problem is proven to be NP-hard, we develop two heuristic approaches, and compare their performance with methods described in the literature. Our analysis indicates that our constraint programming models perform relatively well in solution quality and execution time in small-sized problem instances. The performance of our greedy approach shows potential, reaching the optimal solution in 82.5% of instances. We also statistically demonstrate that the search algorithm enhances the quality of the solution obtained by the greedy heuristic, particularly in large sets. Hence, the solution approach, i.e., the greedy heuristic and the search algorithm proposed in this study is able to quickly reach near-optimal solutions, showing that the method is appropriate for manufacturing settings requiring sudden adjustments.
- 30 May 2021
- Published by Springer Nature in OR Spectrum
- Vol. 43 (4) , 983-1005
An interactive algorithm for resource allocation with balance concerns
- 30 May 2021
- Published by Springer Nature in OR Spectrum
- Vol. 43 (4) , 983-1005
An interactive algorithm for resource allocation with balance concerns
- 5 January 2018
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 56 (16) , 5541-5557
Parallel machine scheduling with tool loading: a constraint programming approach
This paper presents constraint programming models that aim to solve scheduling and tool assignment problems in parallel machine environments. There are a number of jobs to be processed on parallel machines. Each job requires a set of tools, but limited number of tools are available in the system due to economic restrictions. The problem is to assign the jobs and the required tools to machines and to determine the schedule so that the makespan is minimised. Three constraint programming models are developed and compared with existing methods described in the literature.
- 5 January 2018
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 56 (16) , 5541-5557
Parallel machine scheduling with tool loading: a constraint programming approach
This paper presents constraint programming models that aim to solve scheduling and tool assignment problems in parallel machine environments. There are a number of jobs to be processed on parallel machines. Each job requires a set of tools, but limited number of tools are available in the system due to economic restrictions. The problem is to assign the jobs and the required tools to machines and to determine the schedule so that the makespan is minimised. Three constraint programming models are developed and compared with existing methods described in the literature.
- 10 February 2017
- Published by Springer Nature in Annals of Operations Research
- Vol. 267 (1-2) , 379-412
Inverse multiple criteria sorting problem
- 10 February 2017
- Published by Springer Nature in Annals of Operations Research
- Vol. 267 (1-2) , 379-412
Inverse multiple criteria sorting problem