Results 1  10
of
338
A Study of Different Transfer Functions for Binary Version of Particle Swarm Optimization
"... Abstract Particle Swarm Optimization (PSO) is one of the most widely used heuristic algorithms. The simplicity and inexpensive computational cost make this algorithm very popular and powerful in solving wide ranges of problems. However, PSO suffers two problems of trapping in local minima and slow ..."
Abstract
 Add to MetaCart
on the transfer function. In this study, eight new transfer functions dividing into two families (sshape and vshape) for binary particle swarm optimization are introduced and evaluated. Four benchmark optimization problems are employed in order to evaluate these transfer functions in terms of avoiding local
Rounding algorithms for covering problems
, 1998
"... In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science. Recent results from computer science have identified barriers to the degree of approximability of discrete optimization ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
and dual information or randomized but with nonlinear rounding functions) of the optimal solution of a linear programming (LP) relaxation. We apply these generic heuristics to obtain in a systematic way many known as well as new results for the set covering, facility location, general covering, network
A SelfLearning Particle Swarm Optimizer for Global Optimization Problems
, 2011
"... Particle swarm optimization (PSO) has been shown as an effective tool for solving global optimization problems. So far, most PSO algorithms use a single learning pattern for all particles, which means all particles in a swarm use the same strategy. This monotonic learning pattern may cause the lack ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
of intelligence for a particular particle, which makes it unable to deal with different complex situations. This paper presents a novel algorithm, called selflearning particle swarm optimizer (SLPSO), for global optimization problems. In SLPSO, each particle has a set of four strategies to cope with different
The communication complexity of approximate set packing and covering
 In ICALP 2002
, 2002
"... n))approximation for the packing number can be done with polynomial (in n) amount of communication, getting a (1=2 \Gamma ffl) log n approximation for the cover number or a better than min(k; n 1=2\Gamma ffl)approximation for the packing number requires exponential communication complexity. 1 Intr ..."
Abstract

Cited by 32 (11 self)
 Add to MetaCart
to individual goods. I.e. each player holds a valuation function vi that assigns a nonnegative value for each set of items S ae f1:::ng. The valuation function v is usually assumed to be monotone (items can be freely disposed). The problem that combinatorial auctions aim to solve is to find the optimal
The FreezeTag Problem: How to Wake Up a Swarm of Robots
 In Proc. 13th ACMSIAM Sympos. Discrete Algorithms
, 2002
"... An optimization problem that naturally arises in the study of "swarm robotics" is to wake up a set of "asleep" robots, starting with only one "awake" robot. One robot can only awaken another when they are in the same location. As soon as a robot is awake, it assists in ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
An optimization problem that naturally arises in the study of "swarm robotics" is to wake up a set of "asleep" robots, starting with only one "awake" robot. One robot can only awaken another when they are in the same location. As soon as a robot is awake, it assists
A new OptimizationBased Image Segmentation method By Particle Swarm Optimization
 IJACSA, (2011). INTERNATIONAL JOURNAL FOR RESEARCH IN EMERGING SCIENCE AND TECHNOLOGY, VOLUME1, ISSUE7, DECEMBER2014 EISSN: 23497610 VOLUME1, ISSUE7, DECEMBER2014 COPYRIGHT © 2014 IJREST, ALL RIGHT RESERVED 22
"... Abstract — This paper proposes a new multilevel thresholding method segmenting images based on particle swarm optimization (PSO). In the proposed method, the thresholding problem is treated as an optimization problem, and solved by using the principle of PSO. The algorithm of PSO is used to find the ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract — This paper proposes a new multilevel thresholding method segmenting images based on particle swarm optimization (PSO). In the proposed method, the thresholding problem is treated as an optimization problem, and solved by using the principle of PSO. The algorithm of PSO is used to find
A Hybrid Data Clustering Approach Based on Cat Swarm Optimization and K Harmonic Mean Algorithm
 Journal of Information and Computing Science
"... Abstract. Clustering is an important task that is used to find subsets of similar objects from a set of objects such that the objects in the same subsets are more similar than other subsets. Large number of algorithms has been developed to solve the clustering problem. KHarmonic Mean (KHM) is one ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the popular technique that has been applied in clustering as a substitute of KMeans algorithm because it is insensitive to initialization issues due to built in boosting function. But, this method is also trapped in local optima. On the other hand, Cat Swarm Optimization (CSO) is the latest population based
SOME NEW APPROACHES TO SOLVING CONSTRAINED TRANSFER LINE MATCHING PROBLEMS
"... A common type of matching problem involves finding the strengths for four (4) quadrupoles in a transfer line, that will transport a particular beam at the entrance, to produce a beam at the exit of the line with a specified set of horizontal and vertical Twiss parameters. A number of optics programs ..."
Abstract
 Add to MetaCart
A common type of matching problem involves finding the strengths for four (4) quadrupoles in a transfer line, that will transport a particular beam at the entrance, to produce a beam at the exit of the line with a specified set of horizontal and vertical Twiss parameters. A number of optics
SOME NEW APPROACHES TO SOLVING CONSTRAINED TRANSFER LINE MATCHING PROBLEMS
, 2001
"... A common type of matching problem involves finding the strengths for four (4) quadrupoles in a transfer line, that will transport a particular beam at the entrance, to produce a beam at the exit of the line with a specified set of horizontal and vertical Twiss parameters. A number of optics programs ..."
Abstract
 Add to MetaCart
A common type of matching problem involves finding the strengths for four (4) quadrupoles in a transfer line, that will transport a particular beam at the entrance, to produce a beam at the exit of the line with a specified set of horizontal and vertical Twiss parameters. A number of optics
PrizeCollecting SetCovering With Submodular Pricing
"... PrizeCollecting SetCovering With Submodular Pricing is defined as follows: select some subsets S of a ground set E such that each e ∈ E is covered we times and the total value (price) of the selected subsets is minimized. The value (price) of any S ⊆ E is determined by f(S), where f is a submodu ..."
Abstract
 Add to MetaCart
modular function. The prizecollecting property is the following: certain elements e can be left uncovered by paying penalty xe. Although related to SubmodularCost SetCovering, the proposed problem has more integrality properties and it is solved with different methods. We model it using an integer program
Results 1  10
of
338