ScholarLens Back to search
2010•Unpublished venueRequires access

A DISCRETE BIG BANG - BIG CRUNCH ALGORITHM FOR OPTIMAL DESIGN OF SKELETAL STRUCTURES

A. Kaveh, Siamak Talatahari

Open publisher page 95 citations

Abstract

The Big Bang–Big Crunch (BB–BC) optimization algorithm is a new optimization method that relies on the Big Bang and Big Crunch theory, one of the theories of the evolution of the universe. In this paper, a discrete Big Bang–Big Crunch algorithm is presented for optimal design of structures. The BB–BC is employed to optimize different types of skeletal structures with discrete variables including trusses and frames. The results demonstrate the efficiency of the discrete BB–BC algorithm compared to other heuristic algorithms.

About this research paper

What this paper is about

The Big Bang–Big Crunch (BB–BC) optimization algorithm is a new optimization method that relies on the Big Bang and Big Crunch theory, one of the theories of the evolution of the universe. In this paper, a discrete Big Bang–Big Crunch algorithm is presented for optimal design of structures. The BB–BC is employed to optimize different types of skeletal structures with discrete variables including trusses and frames. The results demonstrate the efficiency of the discrete BB–BC algorithm compared to other heuristic algorithms.

Why it matters

OpenAlex reports 95 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Big Bang–Big Crunch (BB–BC) optimization algorithm is a new optimization method that relies on the Big Bang and Big Crunch theory, one of the theories of the evolution of the universe. In this paper, a discrete Big Bang–Big Crunch algorithm is presented for optimal design of structures. The BB–BC is employed to optimize different types of skeletal structures with discrete variables including trusses and frames. The results demonstrate the efficiency of the discrete BB–BC algorithm compared to other heuristic algorithms.

Key concepts: Crunch, Big Crunch, Big Bang (financial markets), Heuristic, Big data, Algorithm, Computer science, Mathematical optimization

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A DISCRETE BIG BANG - BIG CRUNCH ALGORITHM FOR OPTIMAL DESIGN OF SKELETAL STRUCTURES — Research Paper | ScholarLens