untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd>
<responseDate>2018-01-15T18:42:44Z</responseDate>
<request identifier=oai:HAL:hal-00602264v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00602264v1</identifier>
<datestamp>2017-12-21</datestamp>
<setSpec>type:COMM</setSpec>
<setSpec>subject:info</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:BNRMI</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>An hybrid approach to real complex system optimization Application to satellite constellation design</title>
<creator>Grandchamp, Enguerran</creator>
<contributor>Laboratoire de Mathématiques Informatique et Applications (LAMIA) ; Université des Antilles et de la Guyane (UAG)</contributor>
<description>International audience</description>
<source>HPCSE Proceedings</source>
<source>HPCSE</source>
<coverage>Toulouse, France</coverage>
<identifier>hal-00602264</identifier>
<identifier>https://hal.archives-ouvertes.fr/hal-00602264</identifier>
<source>https://hal.archives-ouvertes.fr/hal-00602264</source>
<source>HPCSE, Aug 2004, Toulouse, France. pp.1, 2004</source>
<language>en</language>
<subject lang=en>Hybrid optimization</subject>
<subject lang=en>metaheuristics</subject>
<subject lang=en>modeling</subject>
<subject lang=en>simulation</subject>
<subject lang=en>constellation design</subject>
<subject>[INFO.INFO-TI] Computer Science [cs]/Image Processing</subject>
<type>info:eu-repo/semantics/conferenceObject</type>
<type>Conference papers</type>
<description lang=en>This paper presents some considerations about hybrid optimization algorithms useful to optimize real complex system. The given indication could be used by readers to conceive hybrid algorithms. These considerations have been deducted from a concrete application case: the satellites constellations design problem. But each of the advanced techniques proposed in this paper are considered in a more general way to solve other problems. This problem is used to illustrate the techniques along the paper because it is grouping many characteristics (di culties) of contemporary real complex systems: the size and the characteristics of the search space engendered by a combinatorial problem; The irregularity of the criterions; The mathematical and physical heterogeneity of parameters forbids the use of classical algorithms; The evaluation of a solution, which uses a time consuming simulation; A need of accurate values. More details are available in previous papers ([?], [?], [?], [?]). For these reasons, we could learn a lot from this experiment in order to detach hybrid techniques usable for problems having close characteristics. This paper presents the historic leading to the current algorithm, the modeling of the complex system and the sophisticated algorithm proposed to optimize it. Application cases and ways to built signi cant tests of hybrid algorithm are also given.</description>
<date>2004-08-27</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
