Sira M. Allende Alonso
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sira M. Allende Alonso has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Gemayqzel Bouza Allende
Universidad de La Habana
4 shared publications - Ridelio Miranda-Pérez
Facultad de Ciencias Económicas, Universidad de Cienfuegos, Cienfuegos 55100, Cuba
4 shared publications - Yasmany Fernández Fernández
Universidad Politécnica Estatal del Carchi
4 shared publications - Alfonso Ariza
E.T.S. Telecommunications Engineering, University of Malaga, 29010 Malaga, Spain
2 shared publications - Gonzalo Joya
Universidad de Málaga, Málaga, Spain
2 shared publications - Alicia Triviño-Cabrera
University of Malaga
1 shared publication
Latest Publications
- Open Access
- 18 September 2026
- Published by MDPI AG in Engineering Proceedings
- Vol. 153 (1) , 41
Neutrosophic Uncertainty Set Construction for Adaptive Robust Pre-Disaster Evacuation Planning Under Indeterminacy
Pre-disaster evacuation planning under hurricane threats faces two intertwined uncertainty sources: stochastic demand variability across storm trajectories and epistemic temporal indeterminacy in travel and service durations. Classical robust optimization addresses the latter through worst-case box sets, yet the construction of these sets—their size, shape, and coupling to the scenario-driven demand model—remains largely ad hoc. We propose a neutrosophic-informed framework for the systematic construction of uncertainty sets in adaptive robust vehicle scheduling. Each route parameter is endowed with a truth degree (confidence in nominal estimates), an indeterminacy degree (plausible but unresolvable deviations) and a falsity degree (physically excluded extremes), and these are propagated into a scenario-anchored budget set whose geometry is calibrated via neutrosophic indeterminacy measures. The adaptive robust counterpart is derived in closed form by linear-programming duality and embedded in a four-stage hierarchical metamodel for NP-hard fleet scheduling. The framework is validated on a georeferenced Caribbean network for Hurricane Matthew (Santiago de Cuba, 2016; 19 nodes, 57 arcs, 20 vehicles, up to 8196 persons). Neutrosophic calibration yields over 145 route segments, and the affine decision rules deliver makespans of 470–545 time units under fixed first-stage assignments, with the full pipeline running in under four minutes.- 18 September 2026
- Published by MDPI AG in Engineering Proceedings
- Vol. 153 (1) , 41
Open AccessNeutrosophic Uncertainty Set Construction for Adaptive Robust Pre-Disaster Evacuation Planning Under Indeterminacy
Pre-disaster evacuation planning under hurricane threats faces two intertwined uncertainty sources: stochastic demand variability across storm trajectories and epistemic temporal indeterminacy in travel and service durations. Classical robust optimization addresses the latter through worst-case box sets, yet the construction of these sets—their size, shape, and coupling to the scenario-driven demand model—remains largely ad hoc. We propose a neutrosophic-informed framework for the systematic construction of uncertainty sets in adaptive robust vehicle scheduling. Each route parameter is endowed with a truth degree (confidence in nominal estimates), an indeterminacy degree (plausible but unresolvable deviations) and a falsity degree (physically excluded extremes), and these are propagated into a scenario-anchored budget set whose geometry is calibrated via neutrosophic indeterminacy measures. The adaptive robust counterpart is derived in closed form by linear-programming duality and embedded in a four-stage hierarchical metamodel for NP-hard fleet scheduling. The framework is validated on a georeferenced Caribbean network for Hurricane Matthew (Santiago de Cuba, 2016; 19 nodes, 57 arcs, 20 vehicles, up to 8196 persons). Neutrosophic calibration yields over 145 route segments, and the affine decision rules deliver makespans of 470–545 time units under fixed first-stage assignments, with the full pipeline running in under four minutes. - Open Access
- 18 September 2026
- Published by MDPI AG in Engineering Proceedings
- Vol. 153 (1) , 7
Topological Segmentation of Structured Reticular Multicommodity Flow in NP-Complete Problems: An A Priori Family Evacuation Metamodel for Meteorological Events
Hurricane evacuation requires two decisions that the literature usually studies apart—where to send people and with which vehicles to move them—both fixed 24 to 48 h before landfall and both exposed to different kinds of uncertainty: demand is random, since it follows a storm track known only in probability, while travel times are epistemically uncertain, since they depend on road degradation that admits no reliable distribution. Existing models address one source or the other, treat evacuees as an aggregate headcount, and rarely carry the information produced by the scenario analysis into the uncertainty set used for protection. This paper proposes a hierarchical metamodel that closes those three gaps. A deterministic layer routes families of heterogeneous size as distinct integer commodities over a topologically segmented network with endogenous shelter activation; a second layer schedules a heterogeneous fleet over the extracted routes under vehicle–origin authorization, route consolidation and makespan minimization. A two-stage stochastic extension replaces nominal demand with an ensemble of storm scenarios produced by an adaptive generator, and static and adaptive robust extensions immunize the schedule against travel-time perturbations through uncertainty sets anchored to that same ensemble. The decision version is proven NP-hard, while the surrounding pipeline remains polynomial, and a hierarchical decomposition by origin preserves optimality while reducing the binary decision space by 93.5%. On a case study of Pinar del Río (Cuba) under hurricane IAN (2022), the deterministic core solves to proven optimality in under a second and the full robust cascade in about six minutes, returning diagnostics directly usable by civil-defense planners.
- 18 September 2026
- Published by MDPI AG in Engineering Proceedings
- Vol. 153 (1) , 7
Open AccessTopological Segmentation of Structured Reticular Multicommodity Flow in NP-Complete Problems: An A Priori Family Evacuation Metamodel for Meteorological Events
Hurricane evacuation requires two decisions that the literature usually studies apart—where to send people and with which vehicles to move them—both fixed 24 to 48 h before landfall and both exposed to different kinds of uncertainty: demand is random, since it follows a storm track known only in probability, while travel times are epistemically uncertain, since they depend on road degradation that admits no reliable distribution. Existing models address one source or the other, treat evacuees as an aggregate headcount, and rarely carry the information produced by the scenario analysis into the uncertainty set used for protection. This paper proposes a hierarchical metamodel that closes those three gaps. A deterministic layer routes families of heterogeneous size as distinct integer commodities over a topologically segmented network with endogenous shelter activation; a second layer schedules a heterogeneous fleet over the extracted routes under vehicle–origin authorization, route consolidation and makespan minimization. A two-stage stochastic extension replaces nominal demand with an ensemble of storm scenarios produced by an adaptive generator, and static and adaptive robust extensions immunize the schedule against travel-time perturbations through uncertainty sets anchored to that same ensemble. The decision version is proven NP-hard, while the surrounding pipeline remains polynomial, and a hierarchical decomposition by origin preserves optimality while reducing the binary decision space by 93.5%. On a case study of Pinar del Río (Cuba) under hurricane IAN (2022), the deterministic core solves to proven optimality in under a second and the full robust cascade in about six minutes, returning diagnostics directly usable by civil-defense planners.
- Open Access
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (3) , 527-542
Bridging stochastic, robust, and neutrosophic paradigms for hurricane evacuation under compound uncertainty: A six--layer methodological synthesis
Hurricane evacuation planning under uncertainty requires integrating decisions across multiple spatial and temporal scales, yet the literature addresses demand stochasticity, temporal robustness, and computational tractability largely in isolation. This paper develops a unified optimization framework organized around six progressive layers: meteorological scenario generation, deterministic and stochastic network flow planning, vehicle scheduling with origin-based decomposition, classical robust temporal protection, neutrosophic adaptive robust optimization with scenario-anchored uncertainty sets, and computational complexity characterization. An integrated critical review of 337 Scopus-indexed publications (2022–2026) identifies persistent methodological gaps that motivate each architectural layer. The framework couples two-stage stochastic programming with budget-constrained robust optimization, affine decision rules, and neutrosophic indeterminacy calibration within a single operational pipeline. Validation on a georeferenced Caribbean network demonstrates a 94% reduction in binary variables through origin-based decomposition and end-to-end execution in under four minutes, with a sensitivity analysis showing that neutrosophic budget calibration reduces the price of robustness from 24.8% to 2.8%.
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (3) , 527-542
Open AccessBridging stochastic, robust, and neutrosophic paradigms for hurricane evacuation under compound uncertainty: A six--layer methodological synthesis
Hurricane evacuation planning under uncertainty requires integrating decisions across multiple spatial and temporal scales, yet the literature addresses demand stochasticity, temporal robustness, and computational tractability largely in isolation. This paper develops a unified optimization framework organized around six progressive layers: meteorological scenario generation, deterministic and stochastic network flow planning, vehicle scheduling with origin-based decomposition, classical robust temporal protection, neutrosophic adaptive robust optimization with scenario-anchored uncertainty sets, and computational complexity characterization. An integrated critical review of 337 Scopus-indexed publications (2022–2026) identifies persistent methodological gaps that motivate each architectural layer. The framework couples two-stage stochastic programming with budget-constrained robust optimization, affine decision rules, and neutrosophic indeterminacy calibration within a single operational pipeline. Validation on a georeferenced Caribbean network demonstrates a 94% reduction in binary variables through origin-based decomposition and end-to-end execution in under four minutes, with a sensitivity analysis showing that neutrosophic budget calibration reduces the price of robustness from 24.8% to 2.8%.
- Open Access
Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions
A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncertainty is inherent in the processing of the measurements during the intervals so that they cannot be efficiently managed using crisp variables. In this paper, we face this problem by modeling the communications network as a type-V fuzzy graph, where both the nodes and the links are described with precision, but the cost of each link is modeled as a triangular fuzzy number. Different fuzzy cost allocation functions and fuzzy optimization strategies are described and applied to the search for the shortest path between two nodes. An experimental study has been conducted using two representative networks: the backbone network of Nippon Telegraph and Telephone Corporation (NTT) and the National Science Foundation’s Network (NFSNET). In these networks, our fuzzy cost functions and strategies have been compared with the well-known crisp equivalents. The optimal search strategies are based on the proposed Fuzzy Dijkstra Algorithm (FDA), which is described deeply. The simulation results demonstrate that in all cases the fuzzy alternatives surpass or equal the crisp equivalents with statistically significant values. Specifically, the so-called Strategy 8 presents the best throughput, as it significantly exceeds the performance of all those evaluated, achieving a Global Mean Delivery Rate (GMDR) close to 1.
Open AccessSearch of the Shortest Path in a Communication Network with Fuzzy Cost Functions
A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncertainty is inherent in the processing of the measurements during the intervals so that they cannot be efficiently managed using crisp variables. In this paper, we face this problem by modeling the communications network as a type-V fuzzy graph, where both the nodes and the links are described with precision, but the cost of each link is modeled as a triangular fuzzy number. Different fuzzy cost allocation functions and fuzzy optimization strategies are described and applied to the search for the shortest path between two nodes. An experimental study has been conducted using two representative networks: the backbone network of Nippon Telegraph and Telephone Corporation (NTT) and the National Science Foundation’s Network (NFSNET). In these networks, our fuzzy cost functions and strategies have been compared with the well-known crisp equivalents. The optimal search strategies are based on the proposed Fuzzy Dijkstra Algorithm (FDA), which is described deeply. The simulation results demonstrate that in all cases the fuzzy alternatives surpass or equal the crisp equivalents with statistically significant values. Specifically, the so-called Strategy 8 presents the best throughput, as it significantly exceeds the performance of all those evaluated, achieving a Global Mean Delivery Rate (GMDR) close to 1.
- 7 December 2020
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 51 (15) , 5146-5161
A multiple regression imputation method with application to sensitivity analysis under intermittent missingness
Missing data is a common problem in general applied studies, and specially in clinical trials. For implementing sensitivity analysis, several multiple imputation methods exist, like sequential imputation, which restricts to monotone missingness, and Bayesian, where the imputation and analysis models differ, entailing overestimation of variance. Also, full conditional specification provides a conditional interpretation of sensitivity parameters, requiring further calibration to get the desired marginal interpretation. We propose in this paper a multiple imputation procedure, based on a multivariate linear regression model, which keeps compatibility in sensitivity analysis under intermittent missingness, providing a marginal interpretation of the elicited parameters. Simulation studies show that the method behaves well with longitudinal data and remains robust under demanding constraints. We conclude the possibility of situations not covered by the existing methods and well suited for our proposal, which allows more efficient handling of a given multivariate linear regression structure. Its use is illustrated in a real case study, where a sensitivity analysis is accomplished.
- 7 December 2020
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 51 (15) , 5146-5161
A multiple regression imputation method with application to sensitivity analysis under intermittent missingness
Missing data is a common problem in general applied studies, and specially in clinical trials. For implementing sensitivity analysis, several multiple imputation methods exist, like sequential imputation, which restricts to monotone missingness, and Bayesian, where the imputation and analysis models differ, entailing overestimation of variance. Also, full conditional specification provides a conditional interpretation of sensitivity parameters, requiring further calibration to get the desired marginal interpretation. We propose in this paper a multiple imputation procedure, based on a multivariate linear regression model, which keeps compatibility in sensitivity analysis under intermittent missingness, providing a marginal interpretation of the elicited parameters. Simulation studies show that the method behaves well with longitudinal data and remains robust under demanding constraints. We conclude the possibility of situations not covered by the existing methods and well suited for our proposal, which allows more efficient handling of a given multivariate linear regression structure. Its use is illustrated in a real case study, where a sensitivity analysis is accomplished.
- 10 January 2015
- Published by Springer Nature in Soft Computing
- Vol. 19 (9) , 2447-2455
Peer selection in P2P wireless mesh networks: comparison of different strategies
- 10 January 2015
- Published by Springer Nature in Soft Computing
- Vol. 19 (9) , 2447-2455
Peer selection in P2P wireless mesh networks: comparison of different strategies
- Open Access
- 1 January 2013
- Published by Atlantis Press SARL
Study of the industrialization-ability of the production of mescal in Guerrero-Mexico
- 1 January 2013
- Published by Atlantis Press SARL
Open AccessStudy of the industrialization-ability of the production of mescal in Guerrero-Mexico