Sökning: "Neighbourhood search methods"

Hittade 2 avhandlingar innehållade orden Neighbourhood search methods.

1. 1. On Methods for Discrete Topology Optimization of Continuum Structures

   Författare :Mats Werme; Krister Svanberg; Wolfgang Achtziger; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Topology optimization; Stress constraints; Sensitivity calculations; Neighbourhood search methods; Sequential integer programming; Optimization; systems theory; Optimeringslära; systemteori;

   Sammanfattning : This thesis consists of an introduction and seven appended papers. The purpose of the introduction is to give an overview of the field of topology optimization of discretized load carrying continuum structures. LÄS MER

3. 2. Optimisation methods for solving a large-scale avionics scheduling problem

   Författare :Emil Karlsson; Elina Rönnberg; Kaj Holmberg; Simin Nadjm-Tehrani; Musliu Nysret; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Optimisation; Decomposition; Large-scale scheduling; Avionics scheduling;

   Sammanfattning : Modern computer systems in aircraft are based on an integrated modular avionic architecture. In this architecture, software applications share hardware resources on a common avionic platform. Many functions in an aircraft are controlled by software and a failure in such software can have severe consequences. LÄS MER