Publications

2000

• Neural Nets trained by genetic algorithms for collision avoidance
  
  • Durand Nicolas
  • Alliot Jean-Marc
  • Medioni Frédéric
  Applied Intelligence, Springer Verlag, 2000, 13 (3), pp.pp 205-213. As air traffic keeps increasing, many research programs focus on collision avoidance techniques. For short or medium term avoidance, new headings have to be computed almost on the spot, and feed forward neural nets are susceptible to find solutions in a much shorter amount of time than classical avoidance algorithms (A_, stochastic optimization, etc.) In this article, we show that a neural network can be built with unsupervised learning to compute nearly optimal trajectories to solve two aircraft conflicts with the highest reliability, while computing headings in a few milliseconds. (10.1023/A:1026507809196)
  DOI : 10.1023/A:1026507809196
• Agrégat fractal bidimensionnel obtenu par collage de 50% des particules lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. Bidimensional fractal aggregate obtained by means of a 50% pasting process during collisions of particles submitted to an attractive central field of gravity (Agregat fractal bidimensionnel obtenu par collage de 50% des particules lors de leurs collisions, dans un champ de gravitation central attractif)
• Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 50% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. The trajectories of bidimensional fractal aggregates obtained by means of a 50% pasting process during collisions of particles submitted to an attractive central field of gravity (Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 50% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif)
• Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 50% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. The trajectories of bidimensional fractal aggregates obtained by means of a 50% pasting process during collisions of particles submitted to an attractive central field of gravity (Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 50% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif)
• Agrégat fractal bidimensionnel obtenu par collage de 50% des particules lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. Bidimensional fractal aggregate obtained by means of a 50% pasting process during collisions of particles submitted to an attractive central field of gravity (Agrégat fractal bidimensionnel obtenu par collage de 50% des particules lors de leurs collisions, dans un champ de gravitation central attractif)
• Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 50% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. The trajectories of bidimensional fractal aggregates obtained by means of a 50% pasting process during collisions of particles submitted to an attractive central field of gravity (Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 50% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif)
• Take it EASEA
  
  • Collet Pierre
  • Lutton Evelyne
  • Schoenauer Marc
  • Louchet Jean
  , 2000. Evolutionary algorithms are not straightforward to implement and the lack of any specialised language forces users to reinvent the wheel every time they want to write a new program. Over the last years, evolutionary libraries have appeared, trying to reduce the amount of work involved in writing such algorithms from scratch, by offering standard engines, strategies and tools. Unfortunately, most of these libraries are quite complex to use, and imply a deep knowledge of object programming and C++. To further reduce the amount of work needed to implement a new algorithm, without however throwing down the drain all the man-years already spent in the development of such libraries, we have designed EASEA (acronym for EAsy Specification of Evolutionary Algorithms): a new high-level language dedicated to the specification of evolutionary algorithms. EASEA compiles .ez files into C++ object files, containing function calls to a chosen existing library. The resulting C++ file is in turn compiled and linked with the library to produce an executable file implementing the evolutionary algorithm specified in the original .ez file.
• An Adaptive Algorithm for constrained optimization problems
  
  • Ben Hamida Sana
  • Schoenauer Marc
  , 2000. Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems. The most widely used are those based on penalty function, thanks to their simplicity. In this paper, we propose a new adaptative penalty approach for solving constrained optimization problems, based on the amount of feasible individuals in the population. This method uses specific selection and recombination operators adapted to the penalisation strategy. We demonstrate the power of this approach on the eleven test cases presented in the litterature.
• Visualisation tridimensionnelle de la dynamique de la superposition linéaire de 6 états propres de l'atome d'Hydrogène (calcul bidimensionnel)
  
  • Colonna Jean-François
  , 2000. Tridimensional display of the dynamics of a linear superposition of 6 eigenstates of the Hydrogen atom (bidimensional computation) (Visualisation tridimensionnelle de la dynamique de la superposition linéaire de 6 états propres de l'atome d'Hydrogène (calcul bidimensionnel))
• Visualisation tridimensionnelle de la dynamique de la superposition lineaire de 6 états propres de l'atome d'Hydrogène (calcul bidimensionnel)
  
  • Colonna Jean-François
  , 2000. Tridimensional display of the dynamics of a linear superposition of 6 eigenstates of the Hydrogen atom (bidimensional computation) (Visualisation tridimensionnelle de la dynamique de la superposition linéaire de 6 états propres de l'atome d'Hydrogène (calcul bidimensionnel))
• Agrégat fractal tridimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central
  
  • Colonna Jean-François
  , 2000. Tridimensional fractal aggregate obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Agregat fractal tridimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central)
• Agregat fractal tridimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central
  
  • Colonna Jean-François
  , 2000. Tridimensional fractal aggregate obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Agregat fractal tridimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central)
• Agrégat fractal tridimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central
  
  • Colonna Jean-François
  , 2000. Tridimensional fractal aggregate obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Agrégat fractal tridimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central)
• Artificial Evolution, 4th European Conference, AE '99 Dunkerque, France, November 1999. Selected Papers
  
  • Fonlupt Cyril
  • Hao Jin-Kao
  • Lutton Evelyne
  • Schoenauer Marc
  • Ronald Edmund
  , 2000, 1829. Evolutionary algorithms (EAs) have been increasingly, and successfully, applied to combinatorial optimization problems. However, EAs are relatively complicated algorithms (compared to local search, for example) and it is not always clear to what extent their behaviour can be explained by the particular set of strategies and parameters used. One of the most commonly-used metaphors to describe the process of simple methods such as local search is that of a ‘fitness landscape’, but even in this case, describing what we mean by such a term is not as easy as might be assumed. In this paper, we first present some intuitive ideas and mathematical definitions of what is meant by a landscape and its properties, and review some of the theoretical and experimental work that has been carried out over the past 6 years. We then consider how the concepts associated with a landscape can be extended to search by means of evolutionary algorithms, and connect this with previous work on epistasis variance measurement. The example of the landscapes of the Onemax function will be considered in some detail, and finally, some conclusions will be drawn on how knowledge of typical landscape properties can be used to improve the efficiency and effectiveness of heuristic search techniques. (10.1007/10721187)
  DOI : 10.1007/10721187
• The need for improving the exploration operators for constrained optimization problems
  
  • Hamida Sana Ben
  • Petrowski Alain
  , 2000, pp.1176-1183. Several specific methods have been proposed for handling nonlinear constraints. These methods have to bring individuals in the feasible space, and help to explore and exploit efficiently the feasible domain. However, even if this domain is not sparse, this paper demonstrates that the exploration capacity of standard reproduction operators is not optimal when solving constrained problems. The logarithmic mutation operator presented in this paper has been conceived to explore both locally and globally the search space. As expected, it exhibits a robust and efficient behavior on a constrained version of the Sphere problem, compared to some other standard operators. Associated with BLX-0.5 crossover and a special ranking selection taking the constraints into account, the logarithmic mutation allows a GA to often reach better performance than several well known methods on a set of classical test cases. (10.1109/CEC.2000.870781)
  DOI : 10.1109/CEC.2000.870781
• Vue artistique des trajectoires des particules d'agrégats fractals bidimensionnels obtenus par collage de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. Artistic view of the trajectories of bidimensional fractal aggregates obtained by means of pasting during collisions of particles submitted to an attractive central field of gravity (Vue artistique des trajectoires des particules d'agrégats fractals bidimensionnels obtenus par collage de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif)
• Agrégats fractals bidimensionnels obtenus par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. Bidimensional fractal aggregates obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Agrégats fractals bidimensionnels obtenus par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif)
• Agrégat fractal bidimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. Bidimensional fractal aggregate obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Agregat fractal bidimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif)
• Agregat fractal bidimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. Bidimensional fractal aggregate obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Agregat fractal bidimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif)
• Agrégat fractal bidimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. Bidimensional fractal aggregate obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Agrégat fractal bidimensionnel obtenu par collage de 100% des particules lors de leurs collisions, dans un champ de gravitation central attractif)
• Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 100% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. The trajectories of bidimensional fractal aggregates obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Les trajectoires des particules d'agregats fractals bidimensionnels obtenus par collage de 100% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif)
• Les trajectoires des particules d'agrégats fractals bidimensionnels obtenus par collage de 100% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. The trajectories of bidimensional fractal aggregates obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Les trajectoires des particules d'agrégats fractals bidimensionnels obtenus par collage de 100% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif)
• Les trajectoires des particules d'agrégats fractals bidimensionnels obtenus par collage de 100% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif
  
  • Colonna Jean-François
  , 2000. The trajectories of bidimensional fractal aggregates obtained by means of a 100% pasting process during collisions of particles submitted to an attractive central field of gravity (Les trajectoires des particules d'agrégats fractals bidimensionnels obtenus par collage de 100% de celles-ci lors de leurs collisions, dans un champ de gravitation central attractif)
• Flights Alternative Routes Generator by Genetic Algorithms
  
  • Oussedik Sofiane
  • Delahaye Daniel
  • Schoenauer Marc
  , 2000, 2, pp.896-901. This paper present a new Air Traffic routes generator based on Genetic Algorithms. Due to the traffic growth, direct (and near direct) routes are more and more congested and there is a real need for spreading the traffic on new alternative routes. Those routes have to be different from several operational criteria and must not generate too much extra-distance compared with the direct route. To reach this goal, a GA has been implemented with an efficient sharing which automatically allows the emergence of different alternative routes. This algorithm has been tried on the French airspace and gives realistic operational results. (10.1109/CEC.2000.870735)
  DOI : 10.1109/CEC.2000.870735
• Un piston bidimensionnel parfait avec les conditions initiales suivantes : piston immobile, particules chaudes à gauche et froides à droite, le tout dans une boite bidimensionnelle soumise à un champ de gravitation vertical
  
  • Colonna Jean-François
  , 2000. A perfect bidimensional piston with following initial conditions : still piston, high temperature particles at left and low temperature particles at right, in a bidimensional box submitted to a vertical field of gravity (Un piston bidimensionnel parfait avec les conditions initiales suivantes : piston immobile, particules chaudes à gauche et froides à droite, le tout dans une boite bidimensionnelle soumise à un champ de gravitation vertical)