All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Parallel Branch and Bound Method for Size Optimization Benchmarks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F13%3A00205079" target="_blank" >RIV/68407700:21110/13:00205079 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.ctresources.info/ccp/paper.html?id=7299" target="_blank" >http://www.ctresources.info/ccp/paper.html?id=7299</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4203/ccp.101.20" target="_blank" >10.4203/ccp.101.20</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallel Branch and Bound Method for Size Optimization Benchmarks

  • Original language description

    This contribution presents a new formulation of a classical Branch and Bound method to find global optima of size optimization benchmarks. In our previous procedure, the brunching was done at an assignment of areas to the trusses, i.e. we have been solving the problem in the integer manner. However, the classical method requires a model with convex objectives and constraints, which was not the case. To convert the non-convex problem to the convex one, a relaxation of some variables is necessary. Original design variables ? cross-section areas on truss-bars are converted to the binary design variables with the meaning whether a cross-section area is presented on the respective truss-bar or not. This problem is relaxed and gives us the lower bound. Moreover, a parallel version of the classical Branch and Bound algorithm was implemented, where the upgrades of the lower and upper bounds are broadcasted among individual processes. This algorithm was used to compute the global optimum for ou

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP105%2F12%2F1146" target="_blank" >GAP105/12/1146: Methods for paralelization of engineering problems using low-cost technologies</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the Third International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering

  • ISBN

    978-1-905088-56-0

  • ISSN

    1759-3433

  • e-ISSN

  • Number of pages

    18

  • Pages from-to

  • Publisher name

    Civil-Comp Press Ltd

  • Place of publication

    Stirling

  • Event location

    Pécs

  • Event date

    Mar 25, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article