Loading...
Search for: particle-swarm-optimization-algorithm
0.011 seconds
Total 49 records

    Design of an H∞-optimal FOPID controller using particle swarm optimization

    , Article 26th Chinese Control Conference, CCC 2007, Zhangjiajie, 26 July 2007 through 31 July 2007 ; October , 2007 , Pages 435-440 ; 7900719229 (ISBN); 9787900719225 (ISBN) Majid, Z ; Masoud, K. G ; Nasser, S ; Sharif University of Technology
    2007
    Abstract
    This paper proposes a novel method to design an H∞-optimal Fractional Order PLD (FOPLD) controller with ability to control the transient, steady-state response and stability margins characteristics. The method uses particle swarm optimization algorithm and operates based on minimizing a general cost function. Minimization of the cost function is carried out subject to the H∞-norm; this norm is also included in the cost function to achieve its lower value. The method is applied to a phase-locked-loop motor speed system and an electromagnetic suspension system as two examples to illustrate the design procedure and verify performance of the proposed controller. The results show that the... 

    Finding feasible timetables with particle swarm optimization

    , Article Innovations'07: 4th International Conference on Innovations in Information Technology, IIT, Dubai, 18 November 2007 through 20 November 2007 ; 2007 , Pages 387-391 ; 9781424418411 (ISBN) Qarouni Fard, D ; Najafi Ardabifi, A ; Moeinzadeh, M. H ; Sharifian R, S ; Asgarian, E ; Mohammadzadeh, J ; Sharif University of Technology
    IEEE Computer Society  2007
    Abstract
    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... 

    A robust simulation optimization algorithm using kriging and particle swarm optimization: application to surgery room optimization

    , Article Communications in Statistics: Simulation and Computation ; Volume 50, Issue 7 , 2021 , Pages 2025-2041 ; 03610918 (ISSN) Azizi, M. J ; Seifi, F ; Moghadam, S ; Sharif University of Technology
    Taylor and Francis Ltd  2021
    Abstract
    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)... 

    A multi-product multi-period inventory control problem under inflation and discount: A parameter-tuned particle swarm optimization algorithm

    , Article International Journal of Advanced Manufacturing Technology ; Vol. 70, issue. 9-12 , 2014 , pp. 1739-1756 ; ISSN: 02683768 Mousavi, S. M ; Hajipour, V ; Niaki, S. T. A ; Aalikar, N ; Sharif University of Technology
    Abstract
    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... 

    Well placement optimization using a particle swarm optimization algorithm, a novel approach

    , Article Petroleum Science and Technology ; Vol. 32, issue. 2 , 2014 , pp. 170-179 ; ISSN: 10916466 Afshari, S ; Pishvaie, M. R ; Aminshahidy, B ; Sharif University of Technology
    Abstract
    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... 

    Stabilization of DC microgrids with constant-power loads by an active damping method

    , Article PEDSTC 2013 - 4th Annual International Power Electronics, Drive Systems and Technologies Conference ; 2013 , Pages 471-475 ; 9781467344845 (ISBN) Ashourloo, M ; Khorsandi, A ; Mokhtari, H ; Sharif University of Technology
    2013
    Abstract
    High penetration of constant-power loads (CPL) in dc microgrids may cause a destabilizing effect on the system that can lead to severe voltage oscillations. This paper addresses stability problems of the CPLs and proposes a simple active damping technique to damp the oscillations caused by CPLs. The particle swarm optimization algorithm has been used to find the best values of the parameters of the proposed active damper to achieve maximum damping of the oscillations. The effectiveness of the proposed approach is verified by simulations  

    A new decentralized voltage control scheme of an autonomous microgrid under unbalanced and nonlinear load conditions

    , Article Proceedings of the IEEE International Conference on Industrial Technology ; February , 2013 , Pages 1812-1817 ; 9781467345699 (ISBN) Paridari, K ; Hamzeh, M ; Emamian, S ; Karimi, H ; Bakhshai, A ; Sharif University of Technology
    2013
    Abstract
    This paper presents an effective voltage control strategy for the autonomous operation of a medium voltage (MV) microgrid under nonlinear and unbalanced load conditions. The main objectives of this strategy are to effectively compensate the harmonic and negative-sequence currents of nonlinear and unbalanced loads using distributed generation (DG) units. The proposed control strategy consists of a multi-proportional resonant controller (MPRC) whose parameters are assigned with particle swarm optimization (PSO) algorithm. The optimization function is defined to minimize the tracking error at the specific harmonics considering the stability limitations. In this paper the performance of the... 

    Color quantization with clustering by F-PSO-GA

    , Article Proceedings - 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2010, 29 October 2010 through 31 October 2010 ; Volume 3 , 2010 , Pages 233-238 ; 9781424465835 (ISBN) Alamdar, F ; Bahmani, Z ; Haratizadeh, S ; Sharif University of Technology
    Abstract
    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  

    A combination of PSO and K-means methods to solve haplotype reconstruction problem

    , Article 2009 International Conference on Innovations in Information Technology, IIT '09, 15 December 2009 through 17 December 2009 ; 2009 , Pages 190-194 ; 9781424456987 (ISBN) Sharifian R, S ; Baharian, A ; Asgarian, E ; Rasooli, A ; Sharif University of Technology
    Abstract
    Disease association study is of great importance among various fields of study in bioinformatics. Computational methods happen to be advantageous specifically when experimental approaches fail to obtain accurate results. Haplotypes are believed to be the most responsible biological data for genetic diseases. In this paper, the problem of reconstructing haplotypes from error-containing SNP fragments is discussed For this purpose, two new methods have been proposed by a combination of k-means clustering and particle swarm optimization algorithm. The methods and their implementation results on real biological and simulation datasets are represented which shows that they outperform the methods... 

    A robust simulation optimization algorithm using kriging and particle swarm optimization: application to surgery room optimization

    , Article Communications in Statistics: Simulation and Computation ; 2019 ; 03610918 (ISSN) Azizi, M. J ; Seifi, F ; Moghadam, S ; Sharif University of Technology
    Taylor and Francis Inc  2019
    Abstract
    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)... 

    A robust simulation optimization algorithm using kriging and particle swarm optimization: Application to surgery room optimization

    , Article Communications in Statistics: Simulation and Computation ; 2019 ; 03610918 (ISSN) Azizi, M. J ; Seifi, F ; Moghadam, S ; Sharif University of Technology
    Taylor and Francis Inc  2019
    Abstract
    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)... 

    Implementation of APSO and improved APSO on Non-cascaded and cascaded short term hydrothermal scheduling

    , Article IEEE Access ; Volume 9 , 2021 , Pages 77784-77797 ; 21693536 (ISSN) Fakhar, M. S ; Kashif, S. A. R ; Liaquat, S ; Rasool, A ; Padmanaban, S ; Iqbal, M. A ; Baig, M. A ; Khan, B ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    Short-term hydrothermal scheduling (STHTS) is a highly non-linear, multi-model, non-convex, and multi-dimensional optimization problem that has been worked upon for about 5 decades. Many research articles have been published in solving different test cases of STHTS problem, while establishing the superiority of one type of optimization algorithm over the type, in finding the near global best solution of these complex problems. This paper presents the implementation of an improved version of a variant of the Particle Swarm Optimization algorithm (PSO), known as Accelerated Particle Swarm Optimization (APSO) on three benchmark test cases of STHTS problems. The adaptive and variable nature of... 

    GEPSO: A new generalized particle swarm optimization algorithm

    , Article Mathematics and Computers in Simulation ; Volume 179 , 2021 , Pages 194-212 ; 03784754 (ISSN) Sedighizadeh, D ; Masehian, E ; Sedighizadeh, M ; Akbaripour, H ; Sharif University of Technology
    Elsevier B.V  2021
    Abstract
    Particle Swarm Optimization (PSO) algorithm is a nature-inspired meta-heuristic that has been utilized as a powerful optimization tool in a wide range of applications since its inception in 1995. Due to the flexibility of its parameters and concepts, PSO has appeared in many variants, probably more than any other meta-heuristic algorithm. This paper introduces the Generalized Particle Swarm Optimization (GEPSO) algorithm as a new version of the PSO algorithm for continuous space optimization, which enriches the original PSO by incorporating two new terms into the velocity updating equation. These terms aim to deepen the interrelations of particles and their knowledge sharing, increase... 

    Optimizing a hybrid vendor-managed inventory and transportation problem with fuzzy demand: An improved particle swarm optimization algorithm

    , Article Information Sciences ; Vol. 272 , July , 2014 , pp. 126-144 ; ISSN: 00200255 Sadeghi, J ; Sadeghi, S ; Niaki, S. T. A ; Sharif University of Technology
    Abstract
    Vendor-managed inventory (VMI) is a popular policy in supply chain management (SCM) to decrease bullwhip effect. Since the transportation cost plays an important role in VMI and because the demands are often fuzzy, this paper develops a VMI model in a multi-retailer single-vendor SCM under the consignment stock policy. The aim is to find optimal retailers' order quantities so that the total inventory and transportation cost are minimized while several constraints are satisfied. Because of the NP-hardness of the problem, an algorithm based on particle swarm optimization (PSO) is proposed to find a near optimum solution, where the centroid defuzzification method is employed for... 

    Multi-objective geometrical optimization of full toroidal CVT

    , Article International Journal of Automotive Technology ; Volume 14, Issue 5 , 2013 , Pages 707-715 ; 12299138 (ISSN) Delkhosh, M ; Saadat Foumani, M ; Sharif University of Technology
    2013
    Abstract
    The objective of this research is geometrical and kinematical optimization of full-toroidal continuously variable transmission (CVT) in order to achieve high power transmission efficiency and low mass. At first, a dynamic analysis is performed for the system. A computer model is developed to simulate elastohydrodynamic (EHL) contact between disks and roller and consequently, calculate CVT efficiency. The validity of EHL model is investigated by comparing output of this model and experimental data. Geometrical parameters are obtained by means of Particle Swarm Optimization algorithm, while the optimization objective is to maximize CVT efficiency and minimize its mass. The algorithm is run for... 

    A Customized Particle Swarm Method to Solve Highway Alignment Optimization Problem

    , Article Computer-Aided Civil and Infrastructure Engineering ; Volume 28, Issue 1 , January , 2013 , Pages 52-67 ; 10939687 (ISSN) Shafahi, Y ; Bagherian, M ; Sharif University of Technology
    2013
    Abstract
    Optimizing highway alignment requires a versatile set of cost functions and an efficient search method to achieve the best design. Because of numerous highway design considerations, this issue is classified as a constrained problem. Moreover, because of the infinite number of possible solutions for the problem and the continuous search space, highway alignment optimization is a complex problem. In this study, a customized particle swarm optimization algorithm was used to search for a near-optimal highway alignment, which is a compound of several tangents, consisting of circular (for horizontal design) and parabolic (for vertical alignment) curves. The selected highway alignment should meet... 

    Optimal tuning of sliding mode controller parameters using LQR input trend

    , Article IS'2012 - 2012 6th IEEE International Conference Intelligent Systems, Proceedings ; 2012 , Pages 297-303 ; 9781467327824 (ISBN) Azad, R. K ; Banazadeh, A ; Ahadi, A ; Sharif University of Technology
    2012
    Abstract
    This paper presents a novel method fortuning the parameters of an sliding mode (SM) controller to obtain near-optimal performance. In order to do so the Linear Quadratic Regulator (LQR) was implemented on a linearized system. The input history of the LQR was used as a reference to obtain an optimal space for sliding mode controller parameters. Afterwards, the optimal space boundaries were dedicated to Genetic Algorithm (GA) to search for the optimal parameter for the nonlinear model. Also, the center of the obtained optimal space was used as an initial guess to the Particle Swarm Optimization (PSO) Algorithm. The proposed algorithm was implemented to regulate SM controller for the attitude... 

    Multi-product multi-chance-constraint stochastic inventory control problem with dynamic demand and partial back-ordering: A harmony search algorithm

    , Article Journal of Manufacturing Systems ; Volume 31, Issue 2 , 2012 , Pages 204-213 ; 02786125 (ISSN) Taleizadeh, A. A ; Niaki, S. T. A ; Seyedjavadi, S. M. H ; Sharif University of Technology
    Abstract
    In this paper, a multiproduct inventory control problem is considered in which the periods between two replenishments of the products are assumed independent random variables, and increasing and decreasing functions are assumed to model the dynamic demands of each product. Furthermore, the quantities of the orders are assumed integer-type, space and budget are constraints, the service-level is a chance-constraint, and that the partial back-ordering policy is taken into account for the shortages. The costs of the problem are holding, purchasing, and shortage. We show the model of this problem is an integer nonlinear programming type and to solve it, a harmony search approach is used. At the... 

    Hydrogen generation optimization in a hybrid photovoltaic-electrolyzer using intelligent techniques

    , Article ASME 2012 10th International Conference on Fuel Cell Science, Engineering and Technology, FUELCELL 2012 Collocated with the ASME 2012 6th International Conference on Energy Sustainability, San Diego, CA, USA, 23 July 2012 through 26 July 2012 ; July , 2012 , Pages 19-24 ; 9780791844823 (ISBN) Maroufmashat, A ; Seyyedyn, F ; Roshandel, R ; Bouroshaki, M ; Sharif University of Technology
    American Society of Mechanical Engineers (ASME)  2012
    Abstract
    Hydrogen is a flexible energy carrier and storage medium and can be generated by electrolysis of water. In this research, hydrogen generation is maximized by optimizing the optimal sizing and operating condition of an electrolyzer directly connected to a PV module. The method presented here is based on Particle swarm optimization algorithm (PSO). The hydrogen, in this study, was produced using a proton exchange membrane (PEM) electrolyzer. The required power was supplied by a photovoltaic module rated at 80 watt. In order to optimize Hydrogen generation, the cell number of the electrolyser and its activity must be 9 and 3, respectively. As a result, it is possible to closely match the... 

    A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems

    , Article Computers and Operations Research ; Volume 38, Issue 8 , 2011 , Pages 1164-1174 ; 03050548 (ISSN) Mohammad Nezhad, A ; Mahlooji, H ; Sharif University of Technology
    Abstract
    In this paper, a new algorithm for solving constrained nonlinear programming problems is presented. The basis of our proposed algorithm is none other than the necessary and sufficient conditions that one deals within a discrete constrained local optimum in the context of the discrete Lagrange multipliers theory. We adopt a revised particle swarm optimization algorithm and extend it toward solving nonlinear programming problems with continuous decision variables. To measure the merits of our algorithm, we provide numerical experiments for several renowned benchmark problems and compare the outcome against the best results reported in the literature. The empirical assessments demonstrate that...