Mohammed Sbihi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Mohammed Sbihi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Delahaye
Lab ENAC, Ecole Nationale de l’Aviation Civile, Université de Toulouse, 31400 Toulouse, France
2 shared publications - Jeremie Chevalier
Ecole nationale de l’aviation civile (ENAC), Université Fédérale de Toulouse, 7 Avenue Edouard Belin, FR-31055 Toulouse CEDEX, France
1 shared publication - Ji Ma
Lab ENAC Ecole Nationale de l'Aviation Civile 7 Av. Edouard Belin Toulouse 31400 France
1 shared publication - Nicolas Couellan
École Nationale de l’Aviation Civile, Toulouse, France
1 shared publication - Pierre Maréchal
Paul Sabatier University
1 shared publication - Youcef Askoura
Lemma, Université Paris-Panthéon-Assas, Paris, France
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (1&2) , 377-392
A Bang-Bang Principle for the Conditional Expectation Vector Measure
We prove a conditional expectation bang-bang principle. Based on properties of the conditional expectation vector measure, we establish that the conditional expectation of a set-valued mapping coincides with the conditional expectation of the set of selections of its extreme points part. As a by-product, we obtain straightforwardly a purification principle.
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (1&2) , 377-392
Open AccessA Bang-Bang Principle for the Conditional Expectation Vector Measure
We prove a conditional expectation bang-bang principle. Based on properties of the conditional expectation vector measure, we establish that the conditional expectation of a set-valued mapping coincides with the conditional expectation of the set of selections of its extreme points part. As a by-product, we obtain straightforwardly a purification principle.
- 8 February 2024
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 92 (5) , 1273-1293
Theoretical aspects of robust SVM optimization in Banach spaces and Nash equilibrium interpretation
- 8 February 2024
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 92 (5) , 1273-1293
Theoretical aspects of robust SVM optimization in Banach spaces and Nash equilibrium interpretation
- Open Access
Departure and Arrival Routes Optimization Near Large Airports
The bottleneck of today’s airspace is the Terminal Maneuvering Areas (TMA), where aircraft leave their routes to descend to an airport or take off and reach the en-route sector. To avoid congestion in these areas, an efficient design of departure and arrival routes is necessary. In this paper, a solution for designing departure and arrival routes is proposed, which takes into account the runway configuration, the surroundings of the airport and operational constraints such as limited slopes or turn angles. The routes consist of two parts: a horizontal path in a graph constructed by sampling the TMA around the runway, to which is associated a cone of altitudes. The set of all routes is optimized by the Simulated Annealing metaheuristic. In the process and at each iteration, each route is computed by defining adequately the cost of the arcs in the graph and then searching a path on it. The costs are chosen so as to avoid zigzag behaviors as much as possible. Two tests were performed, one on an instance taken from the literature and the other on an artificial problem designed specifically to test this approach. The obtained results are satisfying with regard to the current state of air operations management and constraints.
Open AccessDeparture and Arrival Routes Optimization Near Large Airports
The bottleneck of today’s airspace is the Terminal Maneuvering Areas (TMA), where aircraft leave their routes to descend to an airport or take off and reach the en-route sector. To avoid congestion in these areas, an efficient design of departure and arrival routes is necessary. In this paper, a solution for designing departure and arrival routes is proposed, which takes into account the runway configuration, the surroundings of the airport and operational constraints such as limited slopes or turn angles. The routes consist of two parts: a horizontal path in a graph constructed by sampling the TMA around the runway, to which is associated a cone of altitudes. The set of all routes is optimized by the Simulated Annealing metaheuristic. In the process and at each iteration, each route is computed by defining adequately the cost of the arcs in the graph and then searching a path on it. The costs are chosen so as to avoid zigzag behaviors as much as possible. Two tests were performed, one on an instance taken from the literature and the other on an artificial problem designed specifically to test this approach. The obtained results are satisfying with regard to the current state of air operations management and constraints.
- 20 March 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (2) , 615-637
Optimization of departure runway scheduling incorporating arrival crossings
The runway is a key airport resource and an efficient runway operation is critical to enhance the airport efficiency and to reduce delays. This paper addresses the problem of scheduling aircraft departures incorporating arrival crossings. Constraints for wake turbulence separations, flight time window restrictions, and holding queue capacity at runway threshold are explicitly considered. We present two integer linear programming models and a simulated annealing (SA) algorithm. Comparison tests are conducted for the south side of Paris Charles De Gaulle Airport and show that the three proposed methods can significantly improve the solutions based on the simple first‐come‐first‐served rule. Moreover, SA has sufficiently small computation time for real‐time deployment.
- 20 March 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (2) , 615-637
Optimization of departure runway scheduling incorporating arrival crossings
The runway is a key airport resource and an efficient runway operation is critical to enhance the airport efficiency and to reduce delays. This paper addresses the problem of scheduling aircraft departures incorporating arrival crossings. Constraints for wake turbulence separations, flight time window restrictions, and holding queue capacity at runway threshold are explicitly considered. We present two integer linear programming models and a simulated annealing (SA) algorithm. Comparison tests are conducted for the south side of Paris Charles De Gaulle Airport and show that the three proposed methods can significantly improve the solutions based on the simple first‐come‐first‐served rule. Moreover, SA has sufficiently small computation time for real‐time deployment.