Sharif Digital Repository

The problem of early convergence in the Particle Swarm Optimization (PSO) algorithm often causes the search process to be trapped in a local optimum. This problem often occurs when the diversity of the swarm decreases and the swarm cannot escape from a local optimal. In this paper, a novel dynamic diversity enhancement particle swarm optimization (DDEPSO) algorithm is introduced. In this variant of PSO, we periodically replace some of the swarm's particles by artificial ones, which are generated based on the history of the search process, in order to enhance the diversity of the swarm and promote the exploration ability of the algorithm. Afterwards, we update the velocity of the artificial... 

In this paper, a seasonal multi-product multi-period inventory control problem is modeled in which the inventory costs are obtained under inflation and all-unit discount policy. Furthermore, the products are delivered in boxes of known number of items, and in case of shortage, a fraction of demand is considered backorder and a fraction lost sale. Besides, the total storage space and total available budget are limited. The objective is to find the optimal number of boxes of the products in different periods to minimize the total inventory cost (including ordering, holding, shortage, and purchasing costs). Since the integer nonlinear model of the problem is hard to solve using exact methods, a... 

Optimal well placement is a crucial step in reservoir development process. The key points in such an optimization process are using a fast function evaluation tool and development of an efficient optimization algorithm. This study presents an approach that uses particle swarm optimization algorithm in conjunction with streamline simulation to determine the optimum well locations within a reservoir, regarding a modified net present value as the objective. Performance of this algorithm was investigated through several different examples, and compared to that of genetic algorithm (GA) and simulated annealing (SA) methods. It was observed that particle swarm optimization algorithm outperformed... 

Color quantization is a technique for processing and reduction colors in image. The purposes of color quantization are displaying images on limited hardware, reduction use of storage media and accelerating image sending time. In this paper a hybrid algorithm of GA and Particle Swarm Optimization algorithms with FCM algorithm is proposed. Finally, some of color quantization algorithms are reviewed and compared with proposed algorithm. The results demonstrate Superior performance of proposed algorithm in comparison with other color quantization algorithms  

Purpose: The purpose of this paper is to present a novel Kriging meta-model assisted method for multi-objective optimal tolerance design of the mechanical assemblies based on the operating conditions under both systematic and random uncertainties. Design/methodology/approach: In the proposed method, the performance, the quality loss and the manufacturing cost issues are formulated as the main criteria in terms of systematic and random uncertainties. To investigate the mechanical assembly under the operating conditions, the behavior of the assembly can be simulated based on the finite element analysis (FEA). The objective functions in terms of uncertainties at the operating conditions can be... 

Simulation optimization is an endeavor to determine the best combination of inputs that result in the best system performance criterion without evaluating all possible combinations. Since simulation optimization applies to many problems, it is extensively studied in the literature with different methods. However, most of these methods ignore the uncertainty of the systems’ parameters, which may lead to a solution that is not robustly optimal in reality. Motivated by this uncertainty, we propose a robust simulation optimization algorithm that follows the well-known Taguchi standpoint but replaces its statistical technique with a minimax method based on the kriging (Gaussian process)... 

This paper illustrates how a 3 degrees of freedom, Cartesian robot can be given the task of playing ping-pong against a human player. We present an algorithm based on particle swarm optimization for the robot to calculate when and how to hit an approaching ball. Simulation results are shown to depict the effectiveness of our approach. Although emphasis is placed on sending the ball to a desired point on the ping pong table, it is shown that our method may be adjusted to meet the requirements of a variety of ball hitting strategies  

A Timetabling problem is usually defined as assigning a set of events to a number of rooms and timeslots such that they satisfy a number of constraints. Particle swarm optimization (PSO) is a stochastic, population-based computer problem-solving algorithm; it is a kind of swarm intelligence that is based on social-psychological principles and provides insights into social behavior, as well as contributing to engineering applications. This paper applies the Particle Swarm Optimization algorithm to the classic Timetabling problem. This is inspired by similar attempts belonging to the evolutionary paradigm in which the metaheuristic involved is tweaked to suit the grouping nature of problems... 

Simulation optimization is an endeavor to determine the best combination of inputs that result in the best system performance criterion without evaluating all possible combinations. Since simulation optimization applies to many problems, it is extensively studied in the literature with different methods. However, most of these methods ignore the uncertainty of the systems’ parameters, which may lead to a solution that is not robustly optimal in reality. Motivated by this uncertainty, we propose a robust simulation optimization algorithm that follows the well-known Taguchi standpoint but replaces its statistical technique with a minimax method based on the kriging (Gaussian process)... 

The main recognition procedure in modern HMM-based continuous speech recognition systems is Viterbi algorithm. Viterbi algorithm finds out the best acoustic sequence according to input speech in the search space using dynamic programming. In this paper, dynamic programming is replaced by a search method which is based on particle swarm optimization. The major idea is focused on generating initial population of particles as the speech segmentation vectors. The particles try to achieve the best segmentation by an updating method during iterations. In this paper, a new method of particles representation and recognition process is introduced which is consistent with the nature of continuous... 

A hybrid algorithm of a particle swarm optimization and a fuzzy rule-based classification system is proposed in this study to diagnose breast cancer. Two orthogonal and triangular types of fuzzy sets are applied to represent the input variables. In additional, different input membership functions are considered to increase the classification accuracy. The performance of the proposed hybrid algorithm is studied using a classification accuracy measure on the Wisconsin breast cancer dataset. The results of the comparison using different training data sets show the higher performance of the proposed methodology  

Refrigerators have considerable share of residential consumption. They can be, however, flexible loads because their operating time and consumption patterns can be changed to some extent. Accordingly, they can be selected as a target for the study of Demand Side Management plans. In this paper, two experimental models for a refrigerator are derived. In obtaining the first model, following assumptions are made: the ambient temperature of refrigerator is assumed to be constant and the refrigerator door is remained closed. However, in the second model the variation of ambient temperature and door-opening effects are considered according to some general patterns. Further, two strategies are... 

In this research, a single-period two-echelon inventory control problem with market targeting strategies is considered. In this problem, there are several final products and raw materials with varying usage rates. The objective is to determine the order sizes of final products and raw materials before the selling period such that customers' satisfaction is reached and expected profit is maximized within an available budget. The problem is first mathematically formulated and then a modified particle swarm optimization algorithm is employed to solve the nonlinear programming problem. To validate the results obtained, a simulated annealing algorithm is provided as a benchmark. The parameters of... 

Owing to wide-ranging searches (there are various alignments between two points) as well as complex and nonlinear cost functions and a variety of geometric constraints, the problem of optimal railway alignment is classified as a complex problem. Thus, choosing an alignment between two points is usually done based on a limited number of alignments designed by experts. In recent years, the study of railway alignment optimization has shown the importance of optimization and the introduction of various algorithms and their usefulness in solving different problems. It is expected that applying meta-heuristic optimization algorithms such as methods based on swarm intelligence can lead to better... 

Stick-slip oscillations are one of the main sources of system failure and bit damage in a rotary drilling system. Thus, suppressing such vibrations is of great importance. There are different modelling approaches demonstrating drill string dynamics, among which lumped parameter models are more common in control studies due to faster computations. Since the system dynamic includes uncertain terms, in this paper an adaptive back-stepping controller is proposed. To tune controller gains, particle swarm optimization algorithm has been employed which guarantees a better control performance. The simulation results demonstrate the feasibility of the designed controller. The results have been also... 

Recently, Ghanbari et al. (IEEE Transactions on Fuzzy Systems 27:1286–1294, 2019) have proposed modified Kerre’s method for comparison of LR fuzzy numbers. Here, we make use of the modified Kerre’s method to solve fuzzy linear programming problems with LR coefficients. In an approach to solve a fuzzy linear program with fuzzy LR coefficients, a bi-objective optimization problem is formulated. For the associated bi-objective optimization problem, we present a time variant multi-objective particle swarm optimization (TV-MOPSO) algorithm to compute the Pareto front, a set containing a large number of solutions. Contrary to methods that change the fuzzy optimization problem to a crisp problem by... 

Recently, Ghanbari et al. (IEEE Transactions on Fuzzy Systems 27:1286–1294, 2019) have proposed modified Kerre’s method for comparison of LR fuzzy numbers. Here, we make use of the modified Kerre’s method to solve fuzzy linear programming problems with LR coefficients. In an approach to solve a fuzzy linear program with fuzzy LR coefficients, a bi-objective optimization problem is formulated. For the associated bi-objective optimization problem, we present a time variant multi-objective particle swarm optimization (TV-MOPSO) algorithm to compute the Pareto front, a set containing a large number of solutions. Contrary to methods that change the fuzzy optimization problem to a crisp problem by... 

Integrated treatment planning for cancer patients has high importance in intensity modulated radiation therapy (IMRT). Direct aperture optimization (DAO) is one of the prominent approaches used in recent years to attain this goal. Considering a set of beam directions, DAO is an integrated approach to optimize the intensity and leaf position of apertures in each direction. In this paper, first, a mixed integer-nonlinear mathematical formulation for the DAO problem in IMRT treatment planning is presented. Regarding the complexity of the problem, two well-known metaheuristic algorithms, particle swarm optimization (PSO) and differential evolution (DE), are utilized to solve the model. The... 

This paper presents a particle swarm optimization (PSO) based approach to solve the multi-stage transmission expansion planning problem in a competitive pool-based electricity market. It is a large-scale non-linear combinatorial problem. We have considered some aspects in our modeling including a multi-year time horizon, a number of scenarios based on the future demands of system, investment and operating costs, the N - 1 reliability criterion, and the continuous non-linear functions of market-driven generator offers and demand bids. Also the optimal expansion plan to maximize the cumulative social welfare among the multi-year horizon is searched. Our proposed PSO based approach, namely...