ΕΛ EN
Home | People | Zambirinis, Sofoclis
8
Scholarly Works
50%
OA Ratio
25%
Collaborative Ratio
Scholar

Zambirinis, Sofoclis

Researcher

Department of Electrical Engineering, Computer Engineering and Informatics

2
H-index (Scopus)
-
Scholar Citations

Scholarly Works

Research Output

Recent Publications

Ambulance Routing Optimization Problem with Patient Triage Priority

Anastasiadou, Maria N., Chrysostomou, Charalambos, Kyriacou, Efthyvoulos C., Mavrovouniotis, Michalis, Zambirinis, Sofoclis
Publishing year: 2026
Journal article
International Journal of Intelligent Transportation Systems Research, 2026
Repository
Emergency medical services (EMS) face critical challenges in efficiently allocating and routing ambulances to minimize response times, particularly in scenarios where high-risk patients must be prioritized under limited resources. This study investigates an ambulance routing problem (ARP) with patient triage priority, where the objective is to jointly assign ambulances to patients and determine their routes so as to minimize total travel time, defined as the sum of the ambulance-to-patient and patient-to-hospital travel times. A mixed-integer linear programming (MILP) model is proposed that integrates assignment and routing decisions, while capturing realistic EMS operational constraints such as patient prioritization and heterogeneous travel times. The proposed MILP is formulated as a multi-criteria optimization problem that prioritizes the transportation service of red-code patients while minimizing total travel time. To address the computational complexity of solving large-scale ARP instances, a metaheuristic based on Tabu Search (TS) is developed, incorporating a set of problem-specific local search operators. To evaluate the effectiveness of the MILP model and TS algorithm, a new set of benchmark instances is generated for the ARP with triage-based patient priority. Computational experiments demonstrate that the MILP model solves small-scale instances (up to 40 patients) optimally in less than one minute, but requires up to 32 minutes to solve large-scale instances (up t...

A toolkit for ambulance dispatch and routing optimization using AI and GIS

Mavrovouniotis M., Antoniades A., Anastasiadou M., Zambirinis S., Theodosiou T., Liapi G., Gemenaris M., Mappouras S., Constantinou R., Kyriacou E.
Publishing year: 2025
Conference paper
Proceedings of SPIE the International Society for Optical Engineering, 2025, Volume 13816
Scopus
Ambulance Response Time is one of the main key factors that affect both the incident handling outcome and the quality of service provided. SmartPLAIGO, a project funded by the Cyprus Research and Innovation Foundation (RIF), aims to optimize the handling of the Ambulance Fleet, resources allocation, and Communication Efficiency between EMS personnel, to improve the Ambulance Response. This paper focuses on one of the main objectives of SmartPLAIGO, which is to establish a comprehensive decision support Toolkit for Ambulance Dispatch and Routing. SmartPlugs processes live data such as traffic levels, the severity of incidents, and the availability of ambulances to enhance rapid decision making during dispatch operations of resources in a dynamic manner. The optimization engine is divided into two tiers: A priority-weighted mixed-integer-linear programming (MILP) that returns the optimal unit-to-patient assignments, and a sub-second tabu-search metaheuristic that maintains near-optimal quality when the number of incidents overwhelm MILP latency. These algorithms will be incorporated into the existing system AVARIS of the Cyprus Ambulance Services, to enhance it with decision support. Early simulations demonstrate promising results in four realistic scenarios, paving the way for the full development and deployment of the comprehensive solution within the Cyprus EMS.

(ω_{1},ω_{2})-temporal random hyperbolic graphs

Papadopoulos, Fragkiskos, Zambirinis, Sofoclis
Publishing year: 2024
Journal article
Physical review. E, 2024, Volume 110, Issue 2-1
Repository
We extend a recent model of temporal random hyperbolic graphs by allowing connections and disconnections to persist across network snapshots with different probabilities ω_{1} and ω_{2}. This extension, while conceptually simple, poses analytical challenges involving the Appell F_{1} series. Despite these challenges, we are able to analyze key properties of the model, which include the distributions of contact and intercontact durations, as well as the expected time-aggregated degree. The incorporation of ω_{1} and ω_{2} enables more flexible tuning of the average contact and intercontact durations, and of the average time-aggregated degree, providing a finer control for exploring the effect of temporal network dynamics on dynamical processes. Overall, our results provide new insights into the analysis of temporal networks and contribute to a more general representation of real-world scenarios.

Dynamics of random hyperbolic graphs

Flores, Marco Antonio Rodríguez, Hartle, Harrison, Papadopoulos, Fragkiskos, Zambirinis, Sofoclis
Publishing year: 2023
Presentation
International School and Conference on Network Science, 2023
Repository
Random hyperbolic graphs (RHGs) have been shown to be adequate models of real-world complex networks, as they naturally and simultaneously possess many of their common structural characteristics. However, existing work on RHGs has mainly focused on structural properties of network snapshots, i.e., of static graphs, while little is known about the dynamical properties of RHGs. In this talk, we will consider the simplest possible model of dynamic RHGs in the cold regime (network temperature T < 1) and derive its most basic dynamical properties, namely the distributions of contact and intercontact durations. These distributions decay as power laws in the model with exponents that depend only on the network temperature T and are consistent with (inter)contact distributions observed in some real systems. Interestingly, these results hold irrespective of the nodes' expected degrees, suggesting that broad (inter)contact distributions in real systems are due to node similarities, instead of popularities. We will also see that several other properties, such as weight and strength distributions, group size distributions, abundance of recurrent components, etc., are also consistent with real systems, justifying why epidemic and rumour spreading processes perform remarkably similar in real and modelled networks. Furthermore, we will discuss a recent generalization of the model that incorporates link persistence, as well as results from dynamic RHGs in the hot regime (network temperature...

Dynamics of hot random hyperbolic graphs

Papadopoulos, Fragkiskos, Zambirinis, Sofoclis
Publishing year: 2022
Journal article
Physical Review E, 2022, Volume 105, Issue 2
Repository
We derive the most basic dynamical properties of random hyperbolic graphs (the distributions of contact and intercontact durations) in the hot regime (network temperature $T > 1$). We show that for sufficiently large networks the contact distribution decays as a power law with exponent $2+T > 3$ for durations $t > T$, while for $t < T$ it exhibits exponential-like decays. This result holds irrespective of the expected degree distribution, as long as it has a finite $T^{\text{th}}$ moment. Otherwise, the contact distribution depends on the expected degree distribution and we show that if the latter is a power law with exponent $\gamma \in (2, T+1]$, then the former decays as a power law with exponent $\gamma+1 > 3$. On the other hand, the intercontact distribution exhibits power-law decays with exponent $2-T \in (0, 1)$ for $T \in (1,2)$, while for $T > 2$ it displays linear decays with a slope that depends on the observation interval. This result holds irrespective of the expected degree distribution as long as it has a finite $T^{\text{th}}$ moment if $T \in (1,2)$, or a finite second moment if $T > 2$. Otherwise, the intercontact distribution depends on the expected degree distribution and if the latter is a power law with exponent $\gamma \in (2, 3)$, then the former decays as a power law with exponent $3-\gamma \in (0,1)$. Thus, hot random hyperbolic graphs can give rise to contact and intercontact distributions that both decay as power laws. These powe...

Dynamics of cold random hyperbolic graphs with link persistence

Hartle, Harrison, Papadopoulos, Fragkiskos, Zambirinis, Sofoclis
Publishing year: 2022
Journal article
Physical Review E, 2022, Volume 106, Issue 6-1
Repository
We consider and analyze a dynamic model of random hyperbolic graphs with link persistence. In the model, both connections and disconnections can be propagated from the current to the next snapshot with probability ω∈[0,1). Otherwise, with probability 1-ω, connections are reestablished according to the random hyperbolic graphs model. We show that while the persistence probability ω affects the averages of the contact and intercontact distributions, it does not affect the tails of these distributions, which decay as power laws with exponents that do not depend on ω. We also consider examples of real temporal networks, and we show that the considered model can adequately reproduce several of their dynamical properties. Our results advance our understanding of the realistic modeling of temporal networks and of the effects of link persistence on temporal network properties.

8
Unique publications
50%
Open access (4 publications; 1 without information)
25%
With other institutions (2 publications; 2 without information)

H-Index Reports

Index type Scopus Google Scholar Web of Science
H-index 2 0 0
H5-index 1 0 0
H10-index 2 0 0

Publications per year and source

No description yet.
Faculty
Faculty of Engineering and Technology
Department
Department of Electrical Engineering, Computer Engineering and Informatics
Title
Researcher