Search results for "swa"
showing 10 items of 430 documents
Solving a continuous periodic review inventory-location allocation problem in vendor-buyer supply chain under uncertainty
2019
In this work, a mixed-integer binary non-linear two-echelon inventory problem is formulated for a vendor-buyer supply chain network in which lead times are constant and the demands of buyers follow a normal distribution. In this formulation, the problem is a combination of an (r, Q) and periodic review policies based on which an order of size Q is placed by a buyer in each fixed period once his/her on hand inventory reaches the reorder point r in that period. The constraints are the vendors’ warehouse spaces, production restrictions, and total budget. The aim is to find the optimal order quantities of the buyers placed for each vendor in each period alongside the optimal placement of the ve…
A hybrid metaheuristic for the cyclic antibandwidth problem
2013
We propose a hybrid artificial bee colony algorithm for the cyclic antibandwidth problem.We present a computational comparison of different parameter settings.We derive a fine-tuning hybrid artificial bee colony algorithm.The proposal is very competitive with the state-of-the-art algorithm for the cyclic antibandwidth problem. In this paper, we propose a hybrid metaheuristic algorithm to solve the cyclic antibandwidth problem. This hard optimization problem consists of embedding an n-vertex graph into the cycle Cn, such that the minimum distance (measured in the cycle) of adjacent vertices is maximized. It constitutes a natural extension of the well-known antibandwidth problem, and can be v…
Pareto-optimal Glowworm Swarms Optimization for Smart Grids Management
2013
This paper presents a novel nature-inspired multi-objective optimization algorithm. The method extends the glowworm swarm particles optimization algorithm with algorithmical enhancements which allow to identify optimal pareto front in the objectives space. In addition, the system allows to specify constraining functions which are needed in practical applications. The framework has been applied to the power dispatch problem of distribution systems including Distributed Energy Resources (DER). Results for the test cases are reported and discussed elucidating both numerical and complexity analysis.
Simultaneous and multi-criteria optimization of TS requirements and maintenance at NPPs
2002
Abstract One of the main concerns of the nuclear industry is to improve the availability of safety-related systems at nuclear power plants (NPPs) to achieve high safety levels. The development of efficient testing and maintenance has been traditionally one of the different ways to guarantee high levels of systems availability, which are implemented at NPP through technical specification and maintenance requirements (TS&M). On the other hand, there is a widely recognized interest in using the probabilistic risk analysis (PRA) for risk-informed applications aimed to emphasize both effective risk control and effective resource expenditures at NPPs. TS&M-related parameters in a plant are associ…
A novel abstraction for swarm intelligence: particle field optimization
2016
Particle swarm optimization (PSO) is a popular meta-heuristic for black-box optimization. In essence, within this paradigm, the system is fully defined by a swarm of "particles" each characterized by a set of features such as its position, velocity and acceleration. The consequent optimized global best solution is obtained by comparing the personal best solutions of the entire swarm. Many variations and extensions of PSO have been developed since its creation in 1995, and the algorithm remains a popular topic of research. In this work we submit a new, abstracted perspective of the PSO system, where we attempt to move away from the swarm of individual particles, but rather characterize each …
Surrogate-Assisted Evolutionary Optimization of Large Problems
2019
This chapter presents some recent advances in surrogate-assisted evolutionary optimization of large problems. By large problems, we mean either the number of decision variables is large, or the number of objectives is large, or both. These problems pose challenges to evolutionary algorithms themselves, constructing surrogates and surrogate management. To address these challenges, we proposed two algorithms, one called kriging-assisted reference vector guided evolutionary algorithm (K-RVEA) for many-objective optimization, and the other called cooperative swarm optimization algorithm (SA-COSO) for high-dimensional single-objective optimization. Empirical studies demonstrate that K-RVEA works…
Wireless sensor network coverage problem using modified fireworks algorithm
2016
Wireless sensor networks are emerging technology with increasing number of applications, and consequently an active research area. One of the problems pertinent to wireless sensor networks is the coverage problem with number of definitions, depending on the assumed conditions. In this paper we consider hard optimization area coverage problem with the goal of finding optimal sensor nodes positions that maximize probabilistic coverage of the area of interest. For such type of optimization problem swarm intelligence stochastic metaheuristics have been successfully used. In this paper we propose a modified enhanced fireworks algorithm for wireless sensor network coverage problem and compare it …
Memetic Algorithms in Engineering and Design
2012
When dealing with real-world applications, one often faces non-linear and nondifferentiable optimization problems which do not allow the employment of exact methods. In addition, as highlighted in [104], popular local search methods (e.g. Hooke-Jeeves, Nelder Mead and Rosenbrock) can be ill-suited when the real-world problem is characterized by a complex and highly multi-modal fitness landscape since they tend to converge to local optima. In these situations, population based meta-heuristics can be a reasonable choice, since they have a good potential in detecting high quality solutions. For these reasons, meta-heuristics, such as Genetic Algorithms (GAs), Evolution Strategy (ES), Particle …
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…