Loading...
Search for: particle-swarm
0.007 seconds
Total 316 records

    Refined microstructure of compo cast nanocomposites: the performance of combined neuro-computing, fuzzy logic and particle swarm techniques

    , Article Neural Computing and Applications ; 2014 ; ISSN: 09410643 Shabani, M. O ; Rahimipour, M. R ; Tofigh, A. A ; Davami, P ; Sharif University of Technology
    Abstract
    Aluminum metal matrix composites (MMCs) reinforced with nanoceramics are ideal materials for the manufacture of lightweight automotive and other commercial parts. Adaptive neuro-fuzzy inference system combined with particle swarm optimization method is implemented in this research study in order to optimize the parameters in processing of aluminum MMCs. In order to solve the problems associated with poor wettability, agglomeration and gravity segregation of nanoparticles in the melt, a mixture of alumina and aluminum particles was used as the reinforcement instead of raw nanoalumina. Microstructural characterization shows dendritic microstructure for the sand cast and non-dendritic... 

    Dynamic diversity enhancement in particle swarm optimization (DDEPSO) algorithm for preventing from premature convergence

    , Article Procedia Computer Science ; Volume 24 , 2013 , Pages 54-65 ; ISSN: 18770509 Nezami, O. M ; Bahrampour, A ; Jamshidlou, P ; Sharif University of Technology
    2013
    Abstract
    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... 

    Application of particle swarm optimization to transportation network design problem

    , Article Journal of King Saud University - Science ; Volume 23, Issue 3 , 2011 , Pages 293-300 ; 10183647 (ISSN) Babazadeh, A ; Poorzahedy, H ; Nikoosokhan, S ; Sharif University of Technology
    2011
    Abstract
    Transportation network design problem (TNDP) aims to choose from among a set of alternatives (e.g., set of new arcs) which minimizes an objective (e.g., total travel time), while keeping consumption of resources (e.g., budget) within their limits. TNDP is formulated as a bilevel programming problem, which is difficult to solve on account of its combinatorial nature. Following a recent, heuristic by ant colony optimization (ACO), a hybridized ACO (HACO) has been devised and tested on the network of Sioux Falls, showing that the hybrid is more effective to solve the problem. In this paper, employing the heuristic of particle swarm optimization (PSO), an algorithm is designed to solve the TNDP.... 

    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... 

    Application of particle swarm optimization in chaos synchronization in noisy environment in presence of unknown parameter uncertainty

    , Article Communications in Nonlinear Science and Numerical Simulation ; Volume 17, Issue 2 , 2012 , Pages 742-753 ; 10075704 (ISSN) Shirazi, M. J ; Vatankhah, R ; Boroushaki, M ; Salarieh, H ; Alasty, A ; Sharif University of Technology
    Abstract
    In this paper, particle swarm optimization (PSO) is applied to synchronize chaotic systems in presence of parameter uncertainties and measurement noise. Particle swarm optimization is an evolutionary algorithm which is introduced by Kennedy and Eberhart. This algorithm is inspired by birds flocking. Optimization algorithms can be applied to control by defining an appropriate cost function that guarantees stability of system. In presence of environment noise and parameter uncertainty, robustness plays a crucial role in succeed of controller. Since PSO needs only rudimentary information about the system, it can be a suitable algorithm for this case. Simulation results confirm that the proposed... 

    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 hybrid PSO-SA algorithm for the travelling tournament problem

    , Article European Journal of Industrial Engineering ; Volume 6, Issue 1 , 2012 , Pages 2-25 ; 17515254 (ISSN) Tajbakhsh, A ; Eshghi, K ; Shamsi, A ; Sharif University of Technology
    Abstract
    Sports scheduling has become an important area of applied operations research in recent years, since satisfying fans and teams' requests and revenues of a sports league and TV networks may be affected by quality of the league schedule. While this type of scheduling problem can be solved by mathematical methods and exact solutions are accessible, it computationally leads to hard problems. The travelling tournament problem (TTP) is defined as minimising total travelling distance for all teams in a league. In this study, a new mathematical model for the TTP with the no-repeater constraint is presented. In addition, a very fast hybrid metaheuristic algorithm is proposed, which combines particle... 

    A framework for tolerance design considering systematic and random uncertainties due to operating conditions

    , Article Assembly Automation ; Volume 39, Issue 5 , 2019 , Pages 854-871 ; 01445154 (ISSN) Khodaygan, S ; Sharif University of Technology
    Emerald Group Publishing Ltd  2019
    Abstract
    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... 

    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)... 

    Finding sub-optimum signature matrices for overloaded code division multiple access systems

    , Article IET Communications ; Volume 7, Issue 4 , 2013 , Pages 295-306 ; 17518628 (ISSN) Khoozani, M. H ; Marvasti, F ; Azghani, M ; Ghassemian, M ; Sharif University of Technology
    2013
    Abstract
    The objective of this study is to design sub-optimal signature matrices for binary inputs for an overloaded code division multiple access (CDMA) system as developed by this author group. In this study, the authors propose to use the sum capacity, the bit error rate and distance criteria as objective functions for signature matrix optimisation. Three optimisation techniques, the genetic algorithm, the particle swarm optimisation and the conjugate gradient (CG) are exploited in this work. Since the optimisation computational complexity increases by matrix dimensions, it is practically impossible to directly optimise the large signature matrices. In order to address this problem, a method is... 

    An integrated model of parallel processing and PSO algorithm for solving optimum highway alignment problem

    , Article Proceedings - 27th European Conference on Modelling and Simulation, ECMS 2013 ; May , 2013 , Pages 551-557 Kazemi, S. F ; Shafahi, Y ; Sharif University of Technology
    European Council for Modelling and Simulation  2013
    Abstract
    Optimum highway alignment is among the most substantial, but large and complicated topics in transportation area. Infinite number of feasible solutions, numerous local optima and the constrained feature of the problem, associated with complex and mainly non-linear constraints, has put an extra effort into the problem solving process. This paper focuses on solving highway alignment optimization problem using an integrated model of parallel processing and particle swarm optimization algorithm. To achieve this goal, algorithm parallelization is done in synchronous and asynchronous manner. For assessing parallel performance, corresponding indexes are evaluated. SRTM3 databank is used for solving... 

    Ball striking algorithm for a 3 DOF ping-pong playing robot based on particle swarm optimization

    , Article 2012 16th International Conference on System Theory, Control and Computing, ICSTCC 2012 - Joint Conference Proceedings ; 2012 ; 9786068348483 (ISBN) Jahandideh, H ; Nooranidoost, M ; Enghiad, B ; Hajimirzakhani, A ; Sharif University of Technology
    2012
    Abstract
    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  

    Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness

    , Article European Journal of Industrial Engineering ; Volume 13, Issue 1 , 2019 , Pages 54-80 ; 17515254 (ISSN) Keshavarz, T ; Salmasi, N ; Varmazyar, M ; Sharif University of Technology
    Inderscience Enterprises Ltd  2019
    Abstract
    In this research, we approach the flowshop sequence-dependent group scheduling problem with minimisation of total weighted earliness and tardiness as the objective for the first time. A mixed integer linear programming model is developed to solve the problem optimally. Since the proposed research problem is proven to be NP-hard, a hybrid meta-heuristic algorithm based on the particle swarm optimisation (PSO) algorithm, enhanced with neighbourhood search is developed to heuristically solve the problem. Since the objective is a non-regular, a timing algorithm is developed to find the best schedule for each sequence provided by the metaheuristic algorithm. A lower bounding method is also... 

    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)... 

    Optimization of the K-Out-of-N Systems using Particle Swarm Optimization Method

    , M.Sc. Thesis Sharif University of Technology Yahyatabar Arabi, Ali Asghar (Author) ; Eshraghniaye Jahromi, Abdolhamid (Supervisor)
    Abstract
    In this study, redundancy allocation problem for a system with y subsystem including k-out-of-n structure is investigated. Due to existing repairable components in each subsystem, the model consists of selecting number of repairman and redundancy level for each subsystem. The model is constructed based on Markovian process and the goal is maximization of steady-state availability under constraints such as cost, weight, and volume. In this model, two type of costs are considered; cost of employing repairmen and cost of preparing components and decision variables of the model are number of repairman and number of component in each subsystem.The model is located into integer non-linear... 

    Optimal design and operation of a photovoltaic-electrolyser system using particle swarm optimisation

    , Article International Journal of Sustainable Energy ; 2014 ; ISSN: 14786451 Sayedin, F ; Maroufmashat, A ; Roshandel, R ; Khavas, S. S
    Abstract
    In this study, hydrogen generation is maximised by optimising the size and the operating conditions of an electrolyser (EL) directly connected to a photovoltaic (PV) module at different irradiance. Due to the variations of maximum power points of the PV module during a year and the complexity of the system, a nonlinear approach is considered. A mathematical model has been developed to determine the performance of the PV/EL system. The optimisation methodology presented here is based on the particle swarm optimisation algorithm. By this method, for the given number of PV modules, the optimal sizeand operating condition of a PV/EL system areachieved. The approach can be applied for different... 

    An evolutionary decoding method for HMM-based continuous speech recognition systems using particle swarm optimization

    , Article Pattern Analysis and Applications ; Vol. 17, issue. 2 , 2014 , pp. 327-339 Najkar, N ; Razzazi, F ; Sameti, H ; Sharif University of Technology
    Abstract
    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 particle swarm optimization and fuzzy rule-based system for breast cancer diagnosis

    , Article International Journal of Soft Computing ; Volume 8, Issue 2 , 2013 , Pages 126-133 ; 18169503 (ISSN) Alikar, N ; Abdullah, S ; Mousavi, S. M ; Akhavan Niaki, S. T ; Sharif University of Technology
    2013
    Abstract
    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