About: Parallel Branch and Bound Method for Size Optimization Benchmarks

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Parallel Branch and Bound Method for Size Optimization Benchmarks Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.ctresources.info/ccp/paper.html?id=7299
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 our 5-bar truss and for the frequently used 25-bar truss benchmark and the global optima were obtained. 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 our 5-bar truss and for the frequently used 25-bar truss benchmark and the global optima were obtained. (en)
Title	Parallel Branch and Bound Method for Size Optimization Benchmarks Parallel Branch and Bound Method for Size Optimization Benchmarks (en)
skos:prefLabel	Parallel Branch and Bound Method for Size Optimization Benchmarks Parallel Branch and Bound Method for Size Optimization Benchmarks (en)
skos:notation	RIV/68407700:21110/13:00205079!RIV14-GA0-21110___
http://linked.open...avai/predkladatel	Fakulta stavební
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP105/12/1146)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Lepš, Matěj Pospíšilová, Adéla
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta stavební
http://linked.open...dnocenehoVysledku	95283
http://linked.open...ai/riv/idVysledku	RIV/68407700:21110/13:00205079
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	branch and bound method; size optimization; benchmarks; global optima; mixed-integer linear problem; big-M problem; parallel computing (en)
http://linked.open.../riv/klicoveSlovo	big-M problem mixed-integer linear problem size optimization parallel computing branch and bound method global optima benchmarks
http://linked.open...ontrolniKodProRIV	[2FBEB4B62CF7]
http://linked.open...v/mistoKonaniAkce	Pécs
http://linked.open...i/riv/mistoVydani	Stirling
http://linked.open...i/riv/nazevZdroje	Proceedings of the Third International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Methods for paralelization of engineering problems using low-cost technologies
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Lepš, Matěj Pospíšilová, Adéla
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-03-25 (xsd:date)
issn	1759-3433
number of pages	18 (xsd:int)
http://bibframe.org/vocab/doi	10.4203/ccp.101.20
http://purl.org/ne...btex#hasPublisher	Civil-Comp Press Ltd
https://schema.org/isbn	978-1-905088-56-0
http://localhost/t...ganizacniJednotka	21110

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software