24 November 2014 in International Transactions in Operational Research
21 February 2025 in Journal of Reliable Intelligent Environments
The digital twin (DT) paradigm provides a purpose-built digital representation of a physical system. DTs are often composed by several interconnected models, which need to be specifically tailored to fit the DT purposes. The objective of this work is the development of an urban digital twin (UDT) for the city of Matera, following urban intelligence (UI) paradigm. The latter leverages the multi-disciplinary integration and optimization of the city systems and subsystems to develop purpose-driven DTs and support the decision-making process. The UDT is intended to support governance, stakeholders, and citizens, integrating morphological data for the city representation, reliable simulation tools and data-driven methods for the city state prediction (e.g., traffic, solar irradiation), optimization algorithms for planning and emergency response, sensors for vehicle and pedestrian traffic volumes and environmental monitoring (e.g., pollutant distributions), and a participatory data collection process from the citizens. A Data Lake is used to make available to the UDT modules the data produced by the morphological representation, simulations/data-driven methods, sensors, and the participatory data. The Data Lake provides a standardized approach for the aggregation and extraction of information. Finally, an Urban Sensing Engine supports the decision-making process with artificial intelligence forms of reasoning, to effectively combine the information produced by the UDT components.
4 May 2022 in Soft Computing
1 July 2022 in Transportation Science
When major disruptions occur in a rail network, the infrastructure manager and train operating companies may be forced to stop trains until the normal status is recovered. A crucial aspect is to identify, for each train, a location (a safe place) where the train can hold during the disruption, avoiding to disconnect the network and allowing a quick recovering of the plan, at restart. We give necessary and sufficient conditions for a safe place assignment to have the desired property. We then translate such conditions into constraints of a suitable binary formulation of the problem. Computational results on a set of instances provided by a class 1 U.S. railroad show how the approach can be used effectively in the real-life setting that motivates the study, by returning optimal assignments in a fraction of a second.
1 January 2020 in Transportation Science
Planning maritime surveillance activities in military operations and long-term defense planning is a huge task that is done manually today. Because maritime surveillance resources are extremely expensive, the potential cost savings of using optimization models to do such planning are large. In this paper, we developed a methodology for making maritime surveillance planning more efficient. The purpose of our tool is to find routes for the force elements involved in maritime surveillance operations, where the goal is to keep a maritime picture sufficiently updated. Our problem may be viewed as a variant of the classical periodic vehicle routing problem, but it differs from this problem in some major aspects. To cope with the specific issues of our problem, we introduce a novel time-indexed formulation, where each variable is associated with a set of contiguous time periods. We defined and implemented a branch-and-price procedure to solve this formulation to exact optimality. Moreover, to tackle instances of practical size, we defined and applied efficient and effective heuristic techniques for solving the pricing problem. We show how our approach can plan up to 72-hour realistic missions with routing ships.
1 July 2022 in Operations Research
In a railway network, a deadlock occurs when two or more trains are preventing each other from moving forward by each occupying the tracks required by the other. Deadlocks are rare but pernicious events in railroad operations, and, in most cases, they are caused by human errors and involve only two extra-long trains missing their last potential meet location. In “Easy Cases of Deadlock Detection in Train Scheduling,” V. Dal Sasso, L. Lamorgese C. Mannino, A. Tancredi, and P. Ventura prove that the identification of two-train deadlocks can be performed in polynomial time. Moreover, they also present a pseudo-polynomial but efficient oracle that allows real-time early detection and prevention of any (potential) two-train deadlock in the Union Pacific (a U.S. class 1 rail company) railroad network. A deadlock prevention module based on the work in this paper will be put in place at Union Pacific to prevent all deadlocks of this kind.