WorldCat Identities

Mongeau, Marcel

Overview
Works: 30 works in 53 publications in 2 languages and 75 library holdings
Genres: Biographies  Commentaries 
Roles: Author, Thesis advisor, Other, Opponent
Publication Timeline
.
Most widely held works by Marcel Mongeau
Mishta Pinamen : Philomène, la formidable! : existence pathétique d'une indienne montagnaise by Marcel Mongeau( Book )

6 editions published in 1981 in French and held by 17 WorldCat member libraries worldwide

Un peuple avec Dieu : les appelé(e)s de l'Ancien Testament by Marcel Mongeau( Book )

5 editions published in 1994 in French and held by 9 WorldCat member libraries worldwide

Quelle femme! by Marcel Mongeau( Book )

3 editions published in 1999 in French and held by 3 WorldCat member libraries worldwide

Discontinuous piecewise differentiable optimization by A. R Conn( Book )

2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide

The descent algorithm which is elaborated uses active set and projected gradient approaches. It is a generalization of the ideas used by Conn to deal with nonsmoothness in the l₁ exact penalty function, and it is based on the notion of decomposition of a function into a smooth and a nonsmooth part. In an accompanying paper, we shall tackle constraints via a penalty approach, we shall discuss the degenerate situation, the implementation of the algorithm, and numerical results will be presented."
Optimisation des trajectoires avion dans l'Atlantique Nord by Olga Rodionova( Book )

2 editions published in 2015 in English and held by 3 WorldCat member libraries worldwide

This thesis investigates the ways to improve the air traffic system in the highly congested North Atlantic oceanic airspace (NAT). First, we consider the current system, where aircraft follow predefined NAT tracks. We favor the re-routings between tracks, decreasing congestion in pre-oceanic airspace, and apply stochastic methods of optimization to find a conflict-free flight configuration with reduced separation between aircraft. Second, we simulate trajectory prediction by Wind Networking (WN). While the main source of time prediction errors is the uncertainty in wind forecast, WN permits aircraft to exchange measured winds and adjust their predictions using this recent and accurate information. Third, we study the impact of introducing the free flight concept in NAT. We apply a stochastic method of optimization on data provided by NASA consisting of NAT flights with wind optimal trajectories. The aim is to reduce the number of conflicts on the strategic level, while keeping the trajectories close to the optimal routes. Our computational experiments show that the air traffic situation in NAT can be improved in several different ways, considering new technologies and new trajectory planning concepts
Nouvelles approches pour la résolution du problème d'ordonnancement de projet à moyens limités by Oumar Koné( Book )

2 editions published in 2009 in French and held by 3 WorldCat member libraries worldwide

In this thesis, we studied two types of scheduling problems. The major part concerns the Resource-Constrained Project Scheduling Problem (RCPSP). The scheduling problem of handling operations in a warehouse of Crossdocking is also dealt. First, from models using mixed integer linear programming, we proposed two new formulations of this problem, using variables indexed by events. In one of them, we use a binary variable to mark the beginning of the performing of each activity and another variable to mark its end. In the second proposal, a single variable is used. It identifies events in which the activity starts or continues its performing. Overall, compared to other models in the literature on various types of instances, our proposals show more interesting results on the instances with long scheduling horizons containing activities with disparate durations. In particular, on the highly cumulative instances (basic characteristics of RCPSP) of these types of instances, they are the most efficient. We also treat the resolution of the extension of the RCPSP which consists in taking into account specific resources that can be consumed during the performing of each activity, but also produced in another quantity at the end of performing of each activity: it is the RCPSP with consumption and production of resources. To make a comparison between different experimental models, we proposed an adaptation of our event-based formulations, the discrete-time formulations of Pritsker and Christofides, and the flow-based continuous-time formulation (proposed by Artigues on basis of the work of Balas). Overall, the results show that our event-based formulations are most successful on many types of instances. Second, in one less extensive part, we proposed a branch-and-bound using some cuts based on the Pareto frontier for the resolution of the scheduling problem of handling operations in a warehouse of Crossdocking. The excellent results obtained, which had strengthened our questions about the non-proved complexity of this problem, have contributed to establish later that this problem is of polynomial complexity
Planification de trajectoires avion : approche par analogie lumineuse by Nour Elhouda Dougui( Book )

2 editions published in 2011 in French and held by 2 WorldCat member libraries worldwide

In the European framework SESAR, the need to increase the air traffic capacity motivated the 4D (space + time) aircraft trajectory planning. In order to produce, on one side, a pre-tactical trajectory planning (an aircraft avoid congested areas or areas with bad weather) and on the other side a tactical trajectory planning (generating sets of 4D conflict-free trajectories), we introduce a new algorithm : the Light Propagation Algorithm (LPA). This algorithm is based on a wavefront propagation method inspired from light propagation analogy. Besides, this algorithm is adapted to the trajectory planning problem. LPA produces very good results for a real traffic day over France, while satisfying specific ATM constraints. LPA was then adapted to take into account the uncertainties concerning actual aircraft positions. Once adapted to the uncertainty LPA was tested on the same traffic day, using RTA points (Real Arrival Time). When LPA fails to resolve conflicts, RTA points are used to reduce the uncertainty concerning aircraft positions. The results obtained are very encouraging
Problèmes d'optimisation globale en statistique robuste by Salvador Flores( Book )

2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide

Robust statistics is a branch of statistics dealing with the analysis of data containing contaminated observations. The robustness of an estimator is measured notably by means of the breakdown point. High-breahdown point estimators are usuallly defined as global minima of a non-convex scale of the erros, hence their computation is a challenging global optimization problem. The objective of this dissertation is to investigate the potential distribution of modern global optimization methods to this class of problem. The first part of this thesis is devoted to the tau-estimator for linear regression, which is defined as a global minimum of a nonconvex differentiable function. We investigate the impact of incorporating clustering techniques and stopping conditions in existing stochastic algorithms. The consequences of some phenomena involving the nearest neighbor in high dimension on clustering global optimization algorithms is thoroughly discussed as well. The second part is devoted to deterministic algorithms for computing the least trimmed squares regression estimator, Which is defined through a nonlinear mixed-integer program. Due to the combinatorial nature of this problem, we concentrated on obtaining lower bounds to be used in a branch-and-bound algorithm. In particular, we propose a second-order cone relaxation that can be complemented with concavity cuts that we obtain explicitly. Global optimality conditions are also provided
Problèmes d'approximation matricielle linéaires coniques : approches par projections et via optimisation sous contraintes de semidéfinie positivité by Pawoumodom Ledogada Takouda( Book )

2 editions published in 2003 in French and held by 2 WorldCat member libraries worldwide

Il est présenté dans cette thèse l'étude et la comparaison de 2 approches numériques de résolution de problèmes d'approximation matricielle linéaire conique
Conception d'organes automobiles par optimisation topologique by Sonia Calvel( Book )

2 editions published in 2004 in French and held by 2 WorldCat member libraries worldwide

In car manufacturing, designing mechanical components of low mass is critical in order to save on raw materials and in order to produce cars that consume less fuel. However, it is also important that comfort (mainly acoustic aspects) and security requirements are satisfied. In such a context, the aim of topology optimization is to determine, at the beginning of engineering projects, the main features of a component. Existing commercial software cannot deal with all the constraints relevant to a vehicle project, in particular dynamical constraints. We propose in this thesis a methodology and a software solution which can take into account such specifications and namely those required by Renault. It combines the topology optimization method SIMP and the mathematical programming algorithm FSQP. We tested the potential of our method, firstly on a simplistic academic problem, and then on the design of an engine accessories support
Conception optimale de l'architecture de roulis avec application aux avions Airbus by Christophe Bauer( Book )

2 editions published in 2008 in French and held by 2 WorldCat member libraries worldwide

Roll architecture is composed of ailerons, spoilers and of all the elements that can control them. The design of a viable and certifiable roll architecture with a minimum mass is complex because it must take into account the objectives of performance, especially industrial and safety criteria. This design requires a long iterative process without guaranteeing optimality of the solution. This thesis defines a methodology of automated research to determine the optimal solution, to reduce the design's delays and costs. For that we formulate and model this problem in mono and bi-objective forms, where the industrial constraints are used to reduce the research's domain. For each formulation, we adapt a method of resolution, a branch-and-bound algorithm and a genetic multi-objective: SPEA. These tools are integrated into an open-loop process that addresses the design of roll control. The details of these methods and processes, as well as gains, are highlighted through applications to A340-300 aircraft
Modélisation mathématique et résolution automatique de conflits par algorithmes génétiques et par optimisation locale continue by Clément Peyronne( )

2 editions published between 2012 and 2017 in French and held by 2 WorldCat member libraries worldwide

La gestion du trafic aérien est un système complexe. Actuellement en pleine mutation, une des problématiques essentielles à l'évolution du système est la recherche de méthodes automatiques de résolution de conflits. Nous présentons d'abord un nouveau modèle de trajectoire courbe basé sur les B-splines et permettant de définir une trajectoire à l'aide d'un nombre très limité de paramètres. à partir de cette modélisation, nous arrêtons une nouvelle formulation du problème de résolution de conflits pour obtenir un problème d'optimisation continue. Celle-ci repose sur une formulation dite semi-infinie de la contrainte de séparation entre deux avions. La manière dont nous avons défini la fonction-objectif et les fonctions contraintes nous permettent également d'en calculer les gradients. Nous utilisons trois différentes méthodes d'optimisation pour résoudre notre problème. Une méthode globale stochastique est d'abord testée : les algorithmes génétiques, couramment utilisés pour le problème de résolution de conflits. Deux méthodes d'optimisation locale sont aussi mises en oeuvre, une méthode de points intérieurs et une méthode d'optimisation sans dérivées. Enfin, nous présentons des résultats numériques prometteurs montrant la viabilité de l'optimisation locale pour le problème de résolution de conflits. Notre méthodologie, alliant une modèle de trajectoire courbe parcimonieux et une méthode d'optimisation locale appliquée à notre formulation mathématique du problème, est une option crédible pour le problème de résolution de conflits aériens
A new machining strategy for roughing deep pockets of magnesium-rare earth alloys by Frédéric Monies( )

1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide

Planification stratégique de trajectoires d'avions by Supatcha Chaimatanan( Book )

2 editions published in 2014 in English and held by 2 WorldCat member libraries worldwide

To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called Trajectory Based Operations (TBO) concept that will increase air traffic capacity by reducing the controllers workload. This will be achieved by transferring tactical conflict detection and resolution tasks to the strategic planning phase. In this future air traffic management paradigm context, this thesis presents a methodology to address such strategic trajectory planning at nation-wide and continent scale. The proposed methodology aims at minimizing the global interaction between aircraft trajectories by allocating alternative departure times, alternative horizontal flight paths, and alternative flight levels to the trajectories involved in the interaction. To improve robustness of the strategic trajectory planning, uncertainty of aircraft position and aircraft arrival time to any given position on the trajectory are considered. This thesis proposes a mathematical formulation of this strategic trajectory planning problem leading to a discrete-optimization and a mixed-integer optimization problem whose objective function relies on the new concept of interaction between trajectories. A computationally efficient algorithm to compute interaction between trajectories for large-scale applications is introduced and implemented. Resolution methods based on metaheuristic and hybrid-metaheuristic algorithms have been developed to solve the above large-scale optimization problems. Finally, the overall methodology is implemented and tested with air traffic data taking into account uncertainty over the French and the European airspaces, involving more than 30,000 trajectories. Conflict-free and robust 4D trajectory planning are produced within computational time acceptable for the operation context, which shows the viability of the approach
Modélisation et évaluation des performances de disponibilité d'un avion dans un contexte opérationnel lors des phases de conception by Laurent Saintis( Book )

2 editions published between 2008 and 2019 in French and held by 2 WorldCat member libraries worldwide

This thesis deals with the modelling and computation of in-service aircraft availability at the preliminary design stage. This problem is crucial for designers because it enables them to evaluate availability indicators in order to improve systems under design and to optimize aircraft support. We formalize the dynamic process of technical incidents and their effects on corrective maintenance in airline's aircraft operations. In the context of a mission defined by a sequence of flight cycles, standard reliability methods are not computationally conceivable with respect to industrial timing constraints. Based on analytic developments, we introduce a methodology that provides an efficient algorithm for computing bounds for availability indicators. Finally, we show the usefulness of our approach on use-cases inspired by real-world aircraft systems
Saint Joseph : époux bien accordé à Marie by Marcel Mongeau( Book )

1 edition published in 1996 in French and held by 2 WorldCat member libraries worldwide

Programmation stochastique à deux étapes pour l'ordonnancement des arrivées d'avions sous incertitude by Ahmed Khassiba( Book )

2 editions published in 2020 in French and held by 2 WorldCat member libraries worldwide

Airport operations are well known to be a bottleneck in the air traffic system, which puts more and more pressure on the world busiest airports to optimally schedule landings, in particular, and also but to a smaller extent departures. The Aircraft Landing Problem (ALP) has arisen from this operational need. ALP consists in finding for aircraft heading to a given airport a landing sequence and landing times so as to optimize some given criteria (optimizing runway utilization, minimizing delays, etc) while satisfying operational constraints (safety constraints mainly). As a reply to this operational need, decision support tools have been designed and put on service for air traffic controllers since the early nineties in the US as well as in Europe. A considerable number of publications dealing with ALP focus on the deterministic and static case. However, the aircraft landing problem arising in practice has a dynamic nature riddled with uncertainties. In addition, operational horizon of current decision support tools are to be extended so that aircraft are captured at larger distances from the airport to hopefully start the scheduling process earlier. Such a horizon extension affects the quality of input data which enlarges the uncertainty effect. In this thesis, we aim at scheduling aircraft arrivals under uncertainty. For that purpose, we propose an approach based on two-stage stochastic programming. In the first stage, aircraft are captured at a large distance from the destination airport. They are to be scheduled on the same initial approach fix (IAF), a reference point in the near-to-airport area where aircraft start their approach phase preparing for landing. Actual IAF arrival times are assumed to be random variables with known probability distributions. In practice, such an uncertainty may cause loss of safety separations between aircraft. In such situations, air traffic controllers are expected to intervene to ensure air traffic safety. In order to alleviate the consequent air trqffic control workload, chance constraints are introduced so that the safety risks around the IAF are limited to an acceptable level once the uncertainty is revealed. The second stage corresponds to the situation where aircraft are actually close to the IAF. In this stage, the uncertainty is revealed and a recourse decision is made in order to schedule aircraft on the runway threshold so that a second-stage cost function is minimized (e.g., air traffic control workload, delay cost, etc). Our first contribution is a proof of concept of the extended aircraft arrival management under uncertainty and a computational study on optimization parameters and problem characteristics. Modeling this problem as a two-stage stochastic programming model and solving it by a Benders decomposition is our second contribution. Finally, our third contribution focuses on extending our model to the more realistic case, where aircraft in the first stage are scheduled on several IAFs
Comparison of mixed integer linear programming models for the resource-constrained project scheduling problem with consumption and production of resources by Oumar Koné( )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Efficient mold cooling optimization by using model reduction by Fabrice Schmidt( )

1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide

Optimisation auto-adaptative en environnement d'analyse multidisciplinaire via les modèles de krigeage combinés à la méthode PLS by Mohamed Amine Bouhlel( )

1 edition published in 2016 in French and held by 1 WorldCat member library worldwide

Les turbomachines aéronautiques sont composées de plusieurs roues aubagées dont la fonction estde transférer l'énergie de l'air au rotor. Les roues aubagées des modules compresseur et turbine sontdes pièces particulièrement sensibles car elles doivent répondre à des impératifs de performanceaérodynamique, de tenue mécanique, de tenue thermique et de performance acoustique. L'optimisation aéro-méca-acoustique ou aéro-thermo-mécanique des aubages consiste à chercher, pourun ensemble de formes aérodynamiques paramétrées (par plusieurs dizaines de variables), celleassurant le meilleur compromis entre la performance aérodynamique du moteur et la satisfactionde plusieurs dizaines de contraintes souvent contradictoires. Cette thèse introduit une méthode d'optimisation basée sur les métamodèles et adaptée à la grande dimension pour répondre à la problématique industrielle des aubages. Les contributions de cettethèse portent sur deux aspects : le développement de modèles de krigeage, et l'adaptation d'unestratégie d'optimisation pour la gestion du grand nombre de variables et de contraintes.La première partie de ce travail traite des modèles de krigeage. Nous avons proposé une nouvelleformulation du noyau de covariance permettant de réduire le nombre de paramètres du modèleafin d'accélérer sa construction. Une des limitations connues du modèle de krigeage concernel'estimation de ses paramètres. Cette estimation devient de plus en plus difficile lorsque nousaugmentons la dimension du phénomène à approcher. En particulier, la base de données nécessitedavantage de points et par conséquent la matrice de covariance du modèle du krigeage est de plusen plus coûteuse à inverser. Notre approche consiste à réduire le nombre de paramètres à estimer en utilisant la méthode de régression des moindres carrés partiels (PLS pour Partial Least Squares). Cette méthode de réduction dimensionnelle fournit des informations sur la relation linéaire entre les variables d'entrée et la variable de sortie. Ces informations ont été intégrées dans les noyaux du modèle de krigeage tout en conservant les propriétés de symétrie et de positivité des noyaux. Grâce à cette approche, la construction de ces nouveaux modèles appelés KPLS est très rapide étant donné le faible nombre de paramètres nécessaires à estimer. La validation de ces modèles KPLS sur des cas test académiques ou industriels a démontré leur qualité de prédiction équivalente voire même meilleure que celle des modèles de krigeage classiques. Dans le cas de noyaux de covariance de type exponentiel, laméthode KPLS peut être utilisée pour initialiser les paramètres du krigeage classique, afin d'accélérerla convergence de l'estimation des paramètres du modèle. La méthode résultante, notée KPLS+K, a permis d'améliorer la qualité des modèles dans le cas de fonctions fortement multimodales. La deuxième contribution de la thèse a consisté à développer une stratégie d'optimisation globale sous contraintes pour la grande dimension, en s'appuyant sur les modèles KPLS ou les modèlesKPLS+K. En effet, nous avons étendu la méthode d'optimisation auto-adaptative connue dans lalittérature sous le nom "Efficient Global Optimisation, EGO" pour gérer les problèmes d'optimisationsous contraintes en grande dimension. Différents critères d'enrichissement adaptatifs ont pu êtreexplorés. Cette stratégie a permis de retrouver l'optimum global sur des problèmes académiquesjusqu'à la dimension 50. La méthode proposée a été confrontée à deux types de problèmes industriels, le cas test MOPTA issu de l'industrie automobile (124 variables d'entrée et 68 fonctions contraintes) et le cas test Snecma des aubes de turbomachines (50 variables d'entrée et 31 fonctions contraintes). Les résultats ont permis de montrer la validité de la démarche ainsi que les limites de la méthode pour une application dans un cadre industriel
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.86 (from 0.73 for Mishta Pin ... to 0.97 for Saint Jose ...)

Languages
French (32)

English (11)