๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A method for mixed integer programming problems by particle swarm optimization

โœ Scribed by Satoshi Kitayama; Keiichiro Yasuda


Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
744 KB
Volume
157
Category
Article
ISSN
0424-7760

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A variable time transformation method fo
โœ Matthias Gerdts ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 285 KB

## Abstract The article discusses a variable time transformation method for the approximate solution of mixedโ€integer nonโ€linear optimal control problems (MIOCP). Such optimal control problems enclose realโ€valued and discreteโ€valued controls. The method transforms MIOCP using a discretization into

A mixed integer programming for robust t
โœ Yoshihiro Kanno; Xu Guo ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 285 KB

## Abstract This paper presents a mixed integer programming (MIP) formulation for robust topology optimization of trusses subjected to the stress constraints under the uncertain load. A designโ€dependent uncertainty model of the external load is proposed for dealing with the variation of truss topol

New wide-aperture-dimension formula obta
โœ Ali Akdagli; Kerim Guney ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 89 KB

## Abstract A new formula for the wide aperture dimension of a pyramidal horn is presented. It is obtained by using a particleโ€swarm optimization (PSO) algorithm, and is used in successfully designing optimumโ€gain pyramidal horns. The computed gains of the designed pyramidal horns are in very good