This page has only limited features, please log in for full access.

Unclaimed
Lorenzo Castelli
Dipartimento di Ingegneria e Architettura, Universita degli Studi di Trieste, 34127 Trieste, Italy

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 09 August 2021 in Sustainability
Reads 0
Downloads 0

An environmentally and economically sustainable air traffic management system must rely on fast models to assess and compare various alternatives and decisions at the different flight planning levels. Due to the numerous interactions between flights, mathematical models to manage the traffic can be computationally time-consuming when considering a large number of flights to be optimised at the same time. Focusing on demand–capacity imbalances, this paper proposes an approach that permits to quickly obtain an approximate but acceptable solution of this problem. The approach consists in partitioning flights into subgroups that influence each other only weakly, solving the problem independently in each subgroup, and then aggregating the solutions. The core of the approach is a method to build a network representing the interactions among flights, and several options for the definition of an interaction are tested. The network is then partitioned with existing community detection algorithms. The results show that applying a strategic flight planning optimisation algorithm on each subgroup independently reduces significantly the computational time with respect to its application on the entire European air traffic network, at the cost of few and small violations of sector capacity constraints, much smaller than those actually observed on the day of operations.

ACS Style

Silvia Zaoli; Giovanni Scaini; Lorenzo Castelli. Community Detection for Air Traffic Networks and Its Application in Strategic Flight Planning. Sustainability 2021, 13, 8924 .

AMA Style

Silvia Zaoli, Giovanni Scaini, Lorenzo Castelli. Community Detection for Air Traffic Networks and Its Application in Strategic Flight Planning. Sustainability. 2021; 13 (16):8924.

Chicago/Turabian Style

Silvia Zaoli; Giovanni Scaini; Lorenzo Castelli. 2021. "Community Detection for Air Traffic Networks and Its Application in Strategic Flight Planning." Sustainability 13, no. 16: 8924.

Journal article
Published: 04 March 2021 in Transportation Research Part C: Emerging Technologies
Reads 0
Downloads 0

The development of trajectory-based operations and the rolling network operations plan in European air traffic management network implies a move towards more collaborative, strategic flight planning. This opens up the possibility for inclusion of additional information in the collaborative decision-making process. With that in mind, we define the indicator for the economic risk of network elements (e.g., sectors or airports) as the expected costs that the elements impose on airspace users due to Air Traffic Flow Management (ATFM) regulations. The definition of the indicator is based on the analysis of historical ATFM regulations data, that provides an indication of the risk of accruing delay. This risk of delay is translated into a monetary risk for the airspace users, creating the new metric of the economic risk of a given airspace element. We then use some machine learning techniques to find the parameters leading to this economic risk. The metric is accompanied by an indication of the accuracy of the delay–cost prediction model. Lastly, the economic risk is transformed into a qualitative economic severity classification. The economic risks and consequently economic severity can be estimated for different temporal horizons and time periods providing an indicator which can be used by Air Navigation Service Providers to identify areas which might need the implementation of strategic measures (e.g., resectorisation or capacity provision change), and by Airspace Users to consider operation of routes which use specific airspace regions.

ACS Style

Luis Delgado; Gérald Gurtner; Tatjana Bolić; Lorenzo Castelli. Estimating economic severity of Air Traffic Flow Management regulations. Transportation Research Part C: Emerging Technologies 2021, 125, 103054 .

AMA Style

Luis Delgado, Gérald Gurtner, Tatjana Bolić, Lorenzo Castelli. Estimating economic severity of Air Traffic Flow Management regulations. Transportation Research Part C: Emerging Technologies. 2021; 125 ():103054.

Chicago/Turabian Style

Luis Delgado; Gérald Gurtner; Tatjana Bolić; Lorenzo Castelli. 2021. "Estimating economic severity of Air Traffic Flow Management regulations." Transportation Research Part C: Emerging Technologies 125, no. : 103054.

Journal article
Published: 01 March 2017 in Transportation Research Part E: Logistics and Transportation Review
Reads 0
Downloads 0

In this paper, we propose SOSTA, an integer linear programming model for optimisation of the airport slot allocation process on the European scale. The main contribution of SOSTA is the simultaneous allocation of slots at all Europan airports, while applying the existing regulation and practices. Additionally, SOSTA considers aircraft rotations through the turnaround time constraints, which is another novel contribution. In an experimental analysis based on real data, we show the benefits of the simultaneous allocation, and the flexibility and capabilities of SOSTA, along with the extremely good computational performance

ACS Style

Paola Pellegrini; Tatjana Bolic; Lorenzo Castelli; Raffaele Pesenti. SOSTA: An effective model for the Simultaneous Optimisation of airport SloT Allocation. Transportation Research Part E: Logistics and Transportation Review 2017, 99, 34 -53.

AMA Style

Paola Pellegrini, Tatjana Bolic, Lorenzo Castelli, Raffaele Pesenti. SOSTA: An effective model for the Simultaneous Optimisation of airport SloT Allocation. Transportation Research Part E: Logistics and Transportation Review. 2017; 99 ():34-53.

Chicago/Turabian Style

Paola Pellegrini; Tatjana Bolic; Lorenzo Castelli; Raffaele Pesenti. 2017. "SOSTA: An effective model for the Simultaneous Optimisation of airport SloT Allocation." Transportation Research Part E: Logistics and Transportation Review 99, no. : 34-53.

Journal article
Published: 01 February 2017 in Transportation Research Part E: Logistics and Transportation Review
Reads 0
Downloads 0

This paper presents an integer programming model for strategic redistribution of flights so as to respect nominal sector capacities, in short computation times for large-scale instances. The main contribution lies in the combination of tackling large-scale strategic flight planning using hard capacity constraints, while considering the whole network (i.e., both airports and sectors). Real historic data for network and traffic description are used for our test instance. Strategic and tactical impact assessments show that early flight planning can lead to the reduction of delays and their costs, showing potential for actual implementation

ACS Style

Tatjana Bolić; Lorenzo Castelli; Luca Corolli; Desirée Rigonat. Reducing ATFM delays through strategic flight planning. Transportation Research Part E: Logistics and Transportation Review 2017, 98, 42 -59.

AMA Style

Tatjana Bolić, Lorenzo Castelli, Luca Corolli, Desirée Rigonat. Reducing ATFM delays through strategic flight planning. Transportation Research Part E: Logistics and Transportation Review. 2017; 98 ():42-59.

Chicago/Turabian Style

Tatjana Bolić; Lorenzo Castelli; Luca Corolli; Desirée Rigonat. 2017. "Reducing ATFM delays through strategic flight planning." Transportation Research Part E: Logistics and Transportation Review 98, no. : 42-59.

Article
Published: 19 September 2016 in Networks
Reads 0
Downloads 0

In the so-called network pricing problem an authority owns some arcs of the network and tolls them, while users travel between their origin and destination choosing their minimum cost path. In this article, we consider a unit toll scheme, and in particular the cases where the authority is imposing either the same toll on all of its arcs, or a toll proportional to a given parameter particular to each arc (for instance a per kilometer toll). We show that if tolls are all equal then the complexity of the problem is polynomial, whereas in case of proportional tolls it is pseudo-polynomial, proposing ad-hoc solution algorithms and relating these problems to the parametric shortest path problem. We then address a robust approach using an interval representation to take into consideration uncertainty on parameters. We show how to modify the algorithms for the deterministic case to solve the robust counterparts, maintaining their complexity class. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 83–93 2017

ACS Style

Lorenzo Castelli; Martine Labbé; Alessia Violin. Network pricing problem with unit toll. Networks 2016, 69, 83 -93.

AMA Style

Lorenzo Castelli, Martine Labbé, Alessia Violin. Network pricing problem with unit toll. Networks. 2016; 69 (1):83-93.

Chicago/Turabian Style

Lorenzo Castelli; Martine Labbé; Alessia Violin. 2016. "Network pricing problem with unit toll." Networks 69, no. 1: 83-93.

Journal article
Published: 01 September 2016 in Journal of Air Transport Management
Reads 0
Downloads 0
ACS Style

Dirk Schaefer; Lorenzo Castelli; Andrew Cook. Long-term and Innovative Research in ATM. Journal of Air Transport Management 2016, 56, 1 -2.

AMA Style

Dirk Schaefer, Lorenzo Castelli, Andrew Cook. Long-term and Innovative Research in ATM. Journal of Air Transport Management. 2016; 56 ():1-2.

Chicago/Turabian Style

Dirk Schaefer; Lorenzo Castelli; Andrew Cook. 2016. "Long-term and Innovative Research in ATM." Journal of Air Transport Management 56, no. : 1-2.

Journal article
Published: 30 June 2015 in Sensors
Reads 0
Downloads 0

Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called “anchor” nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network.

ACS Style

Bigomokero Antoine Bagula; Lorenzo Castelli; Marco Zennaro. On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model. Sensors 2015, 15, 15443 -15467.

AMA Style

Bigomokero Antoine Bagula, Lorenzo Castelli, Marco Zennaro. On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model. Sensors. 2015; 15 (7):15443-15467.

Chicago/Turabian Style

Bigomokero Antoine Bagula; Lorenzo Castelli; Marco Zennaro. 2015. "On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model." Sensors 15, no. 7: 15443-15467.

Book chapter
Published: 21 February 2014 in Advances in Intelligent Systems and Computing
Reads 0
Downloads 0

In the present work we propose two bid-price based heuristic approaches to tackle a stochastic price-oriented demand of air cargo transportation. We assume fares are non-decreasing over time: the earlier the booking, the cheaper the fare. We consider a single-leg flight without overbooking practices or no-show customers. The proposed framework is suited for air cargo carriers providing a unique product to all its price-oriented customers. The business sustainability relies on a significant reduction in fares that would outperform other benefits, an earlier time of delivery above all. Nevertheless, our modelling framework may be easily extended to other modes of cargo transportation, such as maritime, where a given shipment receives the same service regardless the paid fare, which, in turn, only depends on the time the booking request is made.

ACS Style

Lorenzo Castelli; Raffaele Pesenti; Desirée Rigonat. Bid-Price Heuristics for Unrestricted Fare Structures in Cargo Revenue Management. Advances in Intelligent Systems and Computing 2014, 262, 195 -207.

AMA Style

Lorenzo Castelli, Raffaele Pesenti, Desirée Rigonat. Bid-Price Heuristics for Unrestricted Fare Structures in Cargo Revenue Management. Advances in Intelligent Systems and Computing. 2014; 262 ():195-207.

Chicago/Turabian Style

Lorenzo Castelli; Raffaele Pesenti; Desirée Rigonat. 2014. "Bid-Price Heuristics for Unrestricted Fare Structures in Cargo Revenue Management." Advances in Intelligent Systems and Computing 262, no. : 195-207.

Book chapter
Published: 01 February 2014 in International Series in Operations Research & Management Science
Reads 0
Downloads 0

In the last two decades, complex and detailed DEA models that consider the internal structure of DMUs have been proposed by several authors. This chapter describes the mathematical formulations, along with their main variants, extensions and applications, of three large and popular model families: network (with special emphasis on multi-stage), shared flow (also known as multi-component or multi-activity), and multi-level models. Each family is a different generalization of the same elementary internal structure. This review extends and updates the classification presented in Castelli et al. (Ann Oper Res 173(1):207–235, 2010).

ACS Style

Lorenzo Castelli; Raffaele Pesenti. Network, Shared Flow and Multi-level DEA Models: A Critical Review. International Series in Operations Research & Management Science 2014, 329 -376.

AMA Style

Lorenzo Castelli, Raffaele Pesenti. Network, Shared Flow and Multi-level DEA Models: A Critical Review. International Series in Operations Research & Management Science. 2014; ():329-376.

Chicago/Turabian Style

Lorenzo Castelli; Raffaele Pesenti. 2014. "Network, Shared Flow and Multi-level DEA Models: A Critical Review." International Series in Operations Research & Management Science , no. : 329-376.

Journal article
Published: 02 January 2013 in Journal of Aerospace Operations
Reads 0
Downloads 0
ACS Style

Lorenzo Castelli; Dirk Schaefer. Special issue: Selected papers from the SESAR Innovation Days 2011. Journal of Aerospace Operations 2013, 2, 1 -2.

AMA Style

Lorenzo Castelli, Dirk Schaefer. Special issue: Selected papers from the SESAR Innovation Days 2011. Journal of Aerospace Operations. 2013; 2 (1-2):1-2.

Chicago/Turabian Style

Lorenzo Castelli; Dirk Schaefer. 2013. "Special issue: Selected papers from the SESAR Innovation Days 2011." Journal of Aerospace Operations 2, no. 1-2: 1-2.

Journal article
Published: 01 September 2012 in Transportation Research Part E: Logistics and Transportation Review
Reads 0
Downloads 0

We propose a formalization of secondary trading of airport slots as a single market. This market is managed through an individual rational and budget balanced combinatorial exchange mechanism. We also quantify the possible advantage of our mechanism with respect to the current practice. To this aim, we solve instances that simulate a portion of European air traffic. We show that en-route sector capacities should be accounted for in the early stage of flight planning. Furthermore, we observe that at the end of the secondary trading the impact of preexisting rights on slots does not statistically affect airlines’ costs

ACS Style

Paola Pellegrini; Lorenzo Castelli; Raffaele Pesenti. Secondary trading of airport slots as a combinatorial exchange. Transportation Research Part E: Logistics and Transportation Review 2012, 48, 1009 -1022.

AMA Style

Paola Pellegrini, Lorenzo Castelli, Raffaele Pesenti. Secondary trading of airport slots as a combinatorial exchange. Transportation Research Part E: Logistics and Transportation Review. 2012; 48 (5):1009-1022.

Chicago/Turabian Style

Paola Pellegrini; Lorenzo Castelli; Raffaele Pesenti. 2012. "Secondary trading of airport slots as a combinatorial exchange." Transportation Research Part E: Logistics and Transportation Review 48, no. 5: 1009-1022.

Journal article
Published: 07 June 2012 in Transportation Research Part C: Emerging Technologies
Reads 0
Downloads 0

In Europe, all Air Navigation Service Providers (ANSPs) finance their activities by charging airlines to use their airspace. These ‘en route charges’ usually account for a significant fraction of the cost of a flight, and they can therefore influence the route choice: airlines may decide to fly longer routes to avoid countries with higher charges. Then ANSPs’ traffic and revenue do depend on the charge they impose on their own airspace. It follows that if ANSPs look for the maximization of their revenues, they must choose an optimal charge to impose on their airspace. We show that this optimal charge can be identified through a Network Pricing Problem formulation in the form of Bilevel Programming where the leader (i.e. the ANSP) owns a set of arcs (the airways in its national airspace) and charges the commodities (i.e. the flights) passing through them. As the en route charges are proportional to a Unit Rate value fixed by the ANSP, by exploiting the structure of the problem we propose an exact algorithm to compute the optimal Unit Rate and apply it to a case study.

ACS Style

Lorenzo Castelli; Martine Labbé; Alessia Violin. A Network Pricing Formulation for the revenue maximization of European Air Navigation Service Providers. Transportation Research Part C: Emerging Technologies 2012, 33, 214 -226.

AMA Style

Lorenzo Castelli, Martine Labbé, Alessia Violin. A Network Pricing Formulation for the revenue maximization of European Air Navigation Service Providers. Transportation Research Part C: Emerging Technologies. 2012; 33 ():214-226.

Chicago/Turabian Style

Lorenzo Castelli; Martine Labbé; Alessia Violin. 2012. "A Network Pricing Formulation for the revenue maximization of European Air Navigation Service Providers." Transportation Research Part C: Emerging Technologies 33, no. : 214-226.

Journal article
Published: 01 January 2012 in International Journal of Revenue Management
Reads 0
Downloads 0

One of the main principles of the current airport slot allocation mechanism in Europe is based on the existence of historical (also called grandfather) rights granted to airlines for using such slots. Through an experimental analysis, we quantitatively show that the system disutility (i.e. the sum of the costs of the individual airlines due to the imbalance between demand and capacity at airports) is higher when grandfather rights (GFRs) are present. Moreover, we consider the interdependence of slots at different airports and we introduce the possibility to fairly redistribute such costs among airlines through monetary compensations. Our results suggest that it is possible to remove GFRs without significantly penalising airlines which own them.

ACS Style

Lorenzo Castelli; Paola Pellegrini; Raffaele Pesenti. Airport slot allocation in Europe: economic efficiency and fairness. International Journal of Revenue Management 2012, 6, 28 .

AMA Style

Lorenzo Castelli, Paola Pellegrini, Raffaele Pesenti. Airport slot allocation in Europe: economic efficiency and fairness. International Journal of Revenue Management. 2012; 6 (1/2):28.

Chicago/Turabian Style

Lorenzo Castelli; Paola Pellegrini; Raffaele Pesenti. 2012. "Airport slot allocation in Europe: economic efficiency and fairness." International Journal of Revenue Management 6, no. 1/2: 28.

Journal article
Published: 15 November 2011 in Journal of Aerospace Operations
Reads 0
Downloads 0

Air Traffic Flow Management delays are often caused by multiple capacity constrained air traffic resources. In this context, we propose an individual rational and weakly budget balanced market-based negotiation mechanism between flights and the network manager. This mechanism allows flights to pay for reducing their delays or get compensations if they accept an increased delay, with respect to the delay allocated under a First-Planned-First-Served policy. Specifically, we introduce a Lagrangian-based primal distributed heuristic that enables flights to determine the market price of the airspace resources composing their business trajectories. Some computational experience based on a real case instance is reported

ACS Style

Lorenzo Castelli; Raffaele Pesenti; Andrea Ranieri. Short-term allocation of Time Windows to flights through a distributed market-based mechanism. Journal of Aerospace Operations 2011, 1, 29 -40.

AMA Style

Lorenzo Castelli, Raffaele Pesenti, Andrea Ranieri. Short-term allocation of Time Windows to flights through a distributed market-based mechanism. Journal of Aerospace Operations. 2011; 1 (1-2):29-40.

Chicago/Turabian Style

Lorenzo Castelli; Raffaele Pesenti; Andrea Ranieri. 2011. "Short-term allocation of Time Windows to flights through a distributed market-based mechanism." Journal of Aerospace Operations 1, no. 1-2: 29-40.

Journal article
Published: 28 August 2008 in Annals of Operations Research
Reads 0
Downloads 0

We classify the contributions of DEA literature assessing Decision Making Units (DMUs) whose internal structure is known. Starting from an elementary framework, we define the main research areas as shared flow, multilevel and network models, depending on the assumptions they are subject to. For each model category, the principal mathematical formulations are introduced along with their main variants, extensions and applications. We also discuss the results of aggregating efficiency measures and of considering DMUs as submitted to a central authority that imposes constraints or targets on them. A common feature among the several models is that the efficiency evaluation of the DMU depends on the efficiency values of its subunits thereby increasing the discrimination power of DEA methodology with respect to the black box approach.

ACS Style

Lorenzo Castelli; Raffaele Pesenti; Walter Ukovich. A classification of DEA models when the internal structure of the Decision Making Units is considered. Annals of Operations Research 2008, 173, 207 -235.

AMA Style

Lorenzo Castelli, Raffaele Pesenti, Walter Ukovich. A classification of DEA models when the internal structure of the Decision Making Units is considered. Annals of Operations Research. 2008; 173 (1):207-235.

Chicago/Turabian Style

Lorenzo Castelli; Raffaele Pesenti; Walter Ukovich. 2008. "A classification of DEA models when the internal structure of the Decision Making Units is considered." Annals of Operations Research 173, no. 1: 207-235.

Journal article
Published: 16 April 2004 in European Journal of Operational Research
Reads 0
Downloads 0

The knowledge of the internal structure of decision making units (DMUs) gives further insights with respect to the “black box” perspective when considering data envelopment analysis models. We present one-level and two-level hierarchical structures of the DMUs under evaluation. Each unit is composed of consecutive stages of parallel subunits all with constant returns to scale. In particular, the maximization of the relative efficiency of a DMU is studied. For the two-stage situation, different degrees of coordination among the subunits of the hierarchical levels are discussed. When some form of coordination has to be guaranteed, we introduce balancing constraints and we compare two different models. In both cases, we prove that the maximum relative efficiency of a DMU is assessed by comparing it with all the existing subunits.

ACS Style

Lorenzo Castelli; Raffaele Pesenti; Walter Ukovich. DEA-like models for the efficiency evaluation of hierarchically structured units. European Journal of Operational Research 2004, 154, 465 -476.

AMA Style

Lorenzo Castelli, Raffaele Pesenti, Walter Ukovich. DEA-like models for the efficiency evaluation of hierarchically structured units. European Journal of Operational Research. 2004; 154 (2):465-476.

Chicago/Turabian Style

Lorenzo Castelli; Raffaele Pesenti; Walter Ukovich. 2004. "DEA-like models for the efficiency evaluation of hierarchically structured units." European Journal of Operational Research 154, no. 2: 465-476.