The airside is a principal subsystem in the intricate airport systems. This study focuses on introducing a digital twin framework for analyzing the delays and capacity of airports. This framework encompasses a diverse array of authentic features pertaining to a civil airport for a mixture of both landing and departing flights. Being a decision support for the management of international airports, all sizes and weight categories of aircraft are considered permissible, each with their own unique service time and speed requirements in accordance with the global aviation regulations. The proposed discrete event simulation digital twin provides a real-time demonstration of the system performance with the possibility of predicting the future outcomes of managerial decisions. Additionally, this twin is equipped with an advanced and realistic 3D visualization that facilitates a more comprehensive understanding of the ongoing operations. To assess its efficiency in practice, the framework was implemented at an international airport. The statistical tests revealed the superior similarity between the proposed twin and the real system. Using this twin, we further optimized the studied system by analyzing its projected future performance under a set of scenarios. This resulted in a nearly 30% upgrade in the capacity of this airport while decreasing the expected delays by over 18% annually.
This study focuses on effectively designing reliable systems. Such systems are capable of withstanding failure events by applying multiple realistic workarounds. These workarounds include allocating redundancy, component reliability, and backup strategy that are considered concurrently as decision variables. In this novel view, the strategy and reliability of components are determined freely and independently to achieve optimality. The research problem is implemented in a general case to audit the capabilities of the proposed approach in realistic situations. This case deploys an Erlang time-to-failure probability density function together with incomplete switching. With its improved reliability and resource functions, the proposed model challenges the existing presumption regarding the superiority of the cold-standby approach in the mentioned field and provides a realistic trade-off between different redundancy strategies. This practical view reflects on reliability, cost, weight, and volume of the switch, simultaneously. The findings revealed that the proposed joint reliability-redundancy allocation problem, with an added freedom of strategy choice, outperforms the pure cold-standby counterpart. Owing to the NP-hard nature of the problem, a simplified particle swarm optimization algorithm is suggested and utilized as a solution method. The performance of the novel view is assessed using multiple benchmark instances including some typical problems from the literature. Our numerical analysis demonstrates the superiority of this approach with our maximum possible index reaching up to %96 compared to the existing results in the past works. Furthermore, the selected solution algorithm is compared with a differential evolution algorithm. We show that this simplified particle swarm optimization algorithm performs considerably better in all tested scenarios.
In recent years, little work has been done over the joint reliability-redundancy allocation and in all of that, exponential failure and repairs are assumed. In this paper we focus on investigating the reliability-redundancy allocation where the repair failure distributes are non- exponential. When failure/repair times follow a distribution other than exponential, analytical methods become too complicated or even useless. In these cases simulation methods like Mote Carlo and discrete event simulations are typically preferred, but they usually take relatively long time to estimate the availability of the system. This weakness gets more important when we want to use them in optimization algorithms. Here we offer a new discrete event computer simulation package which can estimate availability values in a reasonable time. Then we combine the mentioned simulation method with genetic algorithm to obtain optimal designs. These methods are illustrated with their application using some numerical examples.