Bare-Bones Teaching-Learning-Based Optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bare-Bones Teaching-Learning-Based Optimization

Teaching-learning-based optimization (TLBO) algorithm which simulates the teaching-learning process of the class room is one of the recently proposed swarm intelligent (SI) algorithms. In this paper, a new TLBO variant called bare-bones teaching-learning-based optimization (BBTLBO) is presented to solve the global optimization problems. In this method, each learner of teacher phase employs an i...

متن کامل

Teaching Learning based Optimization

The main aim of the project is to develop a new efficient optimization method, called „Teaching–Learning-Based Optimization (TLBO)‟, for the optimization of mechanical design problems. The process of TLBO is divided into two parts. The first part consists of the „Teacher Phase‟ and the second part consists of the „Learner Phase‟. „Teacher Phase‟ means learning from the teacher and „Learner Phas...

متن کامل

Concept of Velocity into Bare Bones Particle Swarm Optimization Algorithm

Studies have shown that the limit on the updating formula of velocity in particle swarm optimization (PSO) can produce good performance. Inspired by the logic, we introduce the concept of velocity into bare bones particle swarm optimization (BBPSO), which doesn’t consider the velocity term, hence no constraint on velocity. The velocity term is an additional restriction, and thus it doesn’t dama...

متن کامل

A Modified Algorithm of Bare Bones Particle Swarm Optimization

Bare bones particle swarm optimization (PSO) greatly simplifies the particles swarm by stripping away the velocity rule, but performance seems not good as canonical one in some test problems. Some studies try to replace the sampling distribution to improve the performance, but there are some problems in the algorithm itself. This paper proposes a modified algorithm to solve these problems. In a...

متن کامل

Bare-Bones Dependency Parsing

If all we want from a syntactic parser is a dependency tree, what do we gain by first computing a different representation such as a phrase structure tree? The principle of parsimony suggests that a simpler model should be preferred over a more complex model, all other things being equal, and the simplest model is arguably one that maps a sentence directly to a dependency tree – a bare-bones de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Scientific World Journal

سال: 2014

ISSN: 2356-6140,1537-744X

DOI: 10.1155/2014/136920