Search results for "Multi-swarm optimization"
showing 4 items of 14 documents
Applying fuzzy Particle Swarm Optimization to Multi-unit Double Auctions
2010
Abstract In the context of Quadratic Programming Problems, we use a fuzzy Particle Swarm Optimization (PSO) algorithm to analyze a Multi-unit Double Auction (MDA) market. We give also a Linear Programming (LP) based upper bound to help the decision maker in dealing with constraints in the mathematical model. In the computational study, we evaluate our algorithm and show that it is a feasible approach for processing bids and calculating assignments.
Scatter Search and Path Relinking
2011
Scatter search (SS) and path relinking (PR) are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The methods use strategies for search diversification and intensification that have proved effective in a variety of optimization problems and that have sometimes been embedded in other evolutionary methods to yield improved performance. This paper examines the scatter search and path relinking methodologies from both conceptual and p…
A multi-local optimization algorithm
1998
The development of efficient algorithms that provide all the local minima of a function is crucial to solve certain subproblems in many optimization methods. A “multi-local” optimization procedure using inexact line searches is presented, and numerical experiments are also reported. An application of the method to a semi-infinite programming procedure is included.
Influence of the evolutionary optimization parameters on the optimal topology
2016
Topological optimization can be considered as one of the most general types of structural optimization. Between all known topological optimization techniques, the Evolutionary Structural Optimization represents one of the most efficient and easy to implement approaches. Evolutionary topological optimization is based on a heuristic general principle which states that, by gradually removing portions of inefficient material from an assigned domain, the resulting structure will evolve towards an optimal configuration. Usually, the initial continuum domain is divided into finite elements that may or may not be removed according to the chosen efficiency criteria and other parameters like the spee…