WorldCat Identities

Yassine, Adnan (1961-....; chercheur en mathématiques appliquées)

Overview
Works: 64 works in 91 publications in 4 languages and 118 library holdings
Genres: Academic theses 
Roles: Thesis advisor, Author, Other, Opponent, Contributor, Editor, 956
Publication Timeline
.
Most widely held works by Adnan Yassine
Die Bedeutung von Zeckeninvasionen für die Rinderhaltung in Syrien Erhebungen und Untersuchungen zur gegenwärtigen Situation sowie Bekämpfungsvorschläge by Adnan Yassine( Book )

5 editions published in 1973 in German and held by 21 WorldCat member libraries worldwide

Études adaptatives et comparatives de certains algorithmes en optimisation : implementations effectives et applications by Adnan Yassine( Book )

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

Sont étudiés: 1) l'algorithme s.g.g.p. Pour la résolution d'un programme linéaire général; 2) la méthode de pivotage de Lemke, la methode du gradient conjugue conditionnel et la methode de l'inverse partiel pour la résolution des programmes quadratiques convexes; 3) les méthodes d'approximation extérieure et les méthodes de coupes planes et les méthodes de région de confiance pour l'optimisation non convexe
Algorithmes de sous-gradients pour la résolution du problème d'analyse multidimensionnelle des tableaux de dissimilarité by Adnan Yassine( Book )

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

Variantes d'algorithmes génétiques appliquées aux problèmes d'ordonnancement by Saïd Bourazza( Book )

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

L'algorithme génétique (AG) est fondé sur les mécanismes de codage, sélection, croisement, mutation et insertion. Chacun présente plusieurs choix ce qui donne un résultat à plusieurs variantes de AG. Nous avons obtenu une meilleure variante d'algorithme génétique pour le "problème du voyageur de commerce" dans laquelle nous avons introduit notre nouvel opérateur de croisement Cedrx qui, jumelé avec l'opérateur edrx, donne de bons résultats. Cette étude nous a permis de créer des variantes efficaces d'algorithme génétique pour les probèmes suivants : le problème d'ordonnancement dans les ateliers de type Job Shop ; le problème des atterrissages d'avions (PAA) ; le problème d'ordonnancement des véhicules sur une chaîne de production sans une usine (POV)
Étude asymptotique des méthodes de points intérieurs pour la programmation linéaire by Mousaab Bouafia( Book )

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

In this research, we are interested by asymptotic study of interior point methods for linear programming. By basing itself on the works of Schrijver and Padberg, we propose two new displacement steps to accelerate the convergence of Karmarkar's algorithm and reduce its algorithmic complexity. The first step is a moderate improvement of the behaviour of this algorithm; the second represents the best fixed displacement step obtained actually. We propose two parameterized approaches of the central trajectory algorithm via a kernel function. The first function generalizes the kernel function given by Y.Q. Bai et al., the second is the first trigonometric kernel function that gives the best algorithmic complexity, obtained until now. These proposals have made new contributions of algorithmic, theoretical and numerical order
Multi-objective optimization of the integrated problem of location assignment and straddle carrier scheduling in maritime container terminal at import by Hamdi Dkhil( )

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

An efficient twice parameterized trigonometric kernel function for linear optimization by Mousaab Bouafia( )

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

Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. by Mohamad Khorbatly( )

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

The work presented in this thesis is part of human evacuation methods. It aims to study the capacities, model the evacuation problem (wounded, victims, children, elderly, etc.) in a crisis situation (terrorist attacks, natural disasters, etc.) and to develops methods for decision making while proposing better planning and optimal evacuation plans for populations from the crisis zone to hospitals.Our job is to solve the wounded evacuation problem in crisis zone with a new vision that optimizes the transport time and thus saving the maximum of causalities in a dynamic, efficient and fast way in order to minimize human loss
Optimisation des systèmes de stockage de conteneurs dans les terminaux maritimes automatisés by Hamdi Dkhil( )

2 editions published in 2015 in Multiple languages and French and held by 2 WorldCat member libraries worldwide

Notre travail s'intéresse à un cas très particulier des terminaux à conteneurs, il s'agit des terminaux à conteneurs automatisés, qui en plus des véhicules autoguidés, sont équipés de grues de quai et de grues de stockage automatiques (grues de cour), ce qui pousse souvent les scientifiques à considérer les problèmes d'ordonnancement intégré dans les terminaux automatisés ou semi-automatisés. Nous traitons dans ce travail l'optimisation de plusieurs objectifs pour stocker les conteneurs d'une manière efficace et réaliste. Nous traitons le problème d'ordonnancement intégré considérant les trois équipements d'un terminal à conteneurs automatisé soient: les véhicules autoguidés, les grues de quai et les grues de baie (éventuellement). L'objectif principal de cette étude est la minimisation du coût opérationnel de stockage de conteneurs dans un terminal maritime automatisé
Multi-objective optimization of dial a ride problems : modeling and resolution by Manel Ayadi( )

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

This thesis focuses on finding computer science solutions for some combinatorial optimization problems, namely Vehicle Routing Problems (VRP). The thesis addresses the Dial A Ride Problems (DARP). Its main objective is to use some exact and meta-heuristics approaches to solve multi-objective optimization of Dial A Ride Problem with multi-vehicles. Hence, our main research aims are : - I)Solve a multi-objective Dial A Ride Problem with multi-vehicles based on quality of service, this problem treats a general case ; - II) Solve another multi-objective Dial A Ride Problem with multi-vehicles, this problem deals with a specific case which is an application of the Dial A Ride Problem in Home Health Care (HHC). We have also applied exact algorithms "Branch and Bound" and meta-heuristic algorithms such as evolutionary algorithms "Genetic Algorithm" and "Ant Colony" algorithm to provide effective solutions to these different problems. A set of numerical results are presented for each of these methods. Our results show that they produce high quality solutions in a reasonable execution time for all the treated problems
Modèles d'auto-organisation multi-agents pour le problème de transport à la demande by Besma Zeddini( Book )

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

This PhD thesis is motivated by the proposal of multiagent models for the Dial A Ride Problem with Time Windows (DARPTW). The DARPTW is a highly complex dynamic problem, for which a multiagent design is relevent. Our proposals focus on Self-Organization models in multiagent systems that allows for the consideration of new criteria for the assessment of the proposed systems, which with the strict consideration of the utility of the transport operator. In our work, we propose several multiagent architectures for the implementation of the DARPTW system. After experimentally evaluating the different architectures, we popose algorrithmic improvements of the best architecture. The objective of these improvements is to palliate the drawbacks related to the myopic behavior of insertion heuristics and the sequentiality of their insertion process. On the one side, we relax the constraint on the non-revokation of assignment decisions by allowing vehicles to exchange customers that they have inserted. On the other side, by adopting an extension of the Contract Net Protocol, we propose to Vehicle agents to process several customers in parallel. The third contribution of this PhD thesis is the proposal of two Self-Organization models (spatial and temporal) allowing a better spatial and temporal coverage of the network. A set of experiments validate our proposals. Finally, we implement a platform allowing for the deployment of DARPTW systems
Résolution d'un problème quadratique non convexe avec contraintes mixtes par les techniques de l'optimisation D.C. by Mira Al Kharboutly( )

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

Our objective in this work is to solve a binary quadratic problem under mixed constraints by the techniques of DC optimization. As DC optimization has proved its efficiency to solve large-scale problems in different domains, we decided to apply this optimization approach to solve this problem. The most important part of D.C. optimization is the choice of an adequate decomposition that facilitates determination and speeds convergence of two constructed suites where the first converges to the optimal solution of the primal problem and the second converges to the optimal solution of the dual problem. In this work, we propose two efficient decompositions and simple to manipulate. The application of the DC Algorithm (DCA) leads us to solve at each iteration a convex quadratic problem with mixed, linear and quadratic constraints. For it, we must find an efficient and fast method to solve this last problem at each iteration. To do this, we apply three different methods: the Newton method, the semidefinite programing and interior point method. We present the comparative numerical results on the same benchmarks of these three approaches to justify our choice of the fastest method to effectively solve this problem
Object pose from 2-D to 3-D point and line correspondences by Thal Quynh Phong( )

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

Résolution de problèmes non linéaires par les méthodes de points intérieurs : théorie et algorithmes by Mohammed Ouriemchi( Book )

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

The barrier methods solve the nonlinear problem by solving a sequence of penalized problems. The relation between the sequence, known as external, of the solutions of the penalized functions and the solution of the initial problem was established in the Sixties. In this thesis, we used a logarithmic barrier function. At each external iteration, SQP techniques produce a series of quadratic subproblems whose solutions form a sequence, known as internal, of descent directions, to solve the penalized nonlinear problem. We introduced a change of variable on the step what allow us to obtain optimality conditions more stable numerically. We gave simulations to compare the performances of the G.C. method with that of D.C. method, applied to solve trust-region quadratic problems. We adapted D.C. method to solve the vertical subproblems, which allowed us to reduce their dimensions from n+m to m+p (p<n). The evolution of the algorithm is controlled by the merit function. Numerical tests make it possible to compare the advantages of various forms of the them. We introduced new rules to improve this evolution. The numerical experiments show a profit concerning the number of solved problems. The study of the convergence of our method SDC, closes this work
Méthodes de points intérieurs non réalisables en optimisation : théorie, algorithmes et applications by Hayet Roumili( Book )

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

In this study, we are interested to the initialization problem for central path following interior point methods, taking Y. Zhang's work for the linear programming (LP) as bench-mark. After, we make use of an appropriate algorithm for linear programming, we propose an extension for the quadratic convex programming as well semidefinite programming
An Efficient Primal-Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term by Mousaab Bouafia( )

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

An efficient parameterized logarithmic kernel function for linear optimization by Mousaab Bouafia( )

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

Résolution approchée du problème de bin-packing by Mohamed Abdellahi Ben Mohamed Ahmed( Book )

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

Étude et extensions d'algorithmes de points intérieurs pour la programmation non linéaire by Zakia Kebbiche( Book )

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

Dans cette thèse, nous présentons une étude algorithmique et numérique concernant la méthode de trajectoire centrale appliquée au problème de complémentarité linéaire considéré comme une formulation unificatrice de la programmation linéaire et de la programmation quadratique convexe. Puis, nous proposons deux variantes intéressantes, l'une de trajectoire centrale et l'autre de type projectif avec linéarisation, pour minimiser une fonction convexe différentiable sur un polyèdre. Les algorithmes sont bien définis et les résultats théoriques correspondants sont établis
Contribution aux graphes creux pour le problème de tournées sur arcs déterministe et robustes : théorie et algorithmes by Sara Tfaili( )

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

This dissertation consists of two main parts : in the first part, we study the detreministic capacitated arc routing problem over sparse underlying graphs wher we have developed a new transformation techniquevof sparse CARP into sparse CVRP. The second part is consecrated about the sparse CARP with travel costs uncertainty. We have given a mathematical formulation of the probleme in min-max. A worst scenario for the robust problem is then identified, and two algorithmic approaches are proposed to determine a solution of the studied problem
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.92 (from 0.81 for Algorithme ... to 0.97 for Die Bedeut ...)

Languages