Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Mohammad Reza Bonyadi is active.

Publication


Featured researches published by Mohammad Reza Bonyadi.


Evolutionary Computation | 2017

Book review: particle swarm optimization for single objective continuous space problems: A review

Mohammad Reza Bonyadi; Zbigniew Michalewicz

This paper reviews recent studies on the Particle Swarm Optimization (PSO) algorithm. The review has been focused on high impact recent articles that have analyzed and/or modified PSO algorithms. This paper also presents some potential areas for future study.


congress on evolutionary computation | 2013

The travelling thief problem: The first step in the transition from theoretical problems to realistic problems

Mohammad Reza Bonyadi; Zbigniew Michalewicz; Luigi Barone

There are some questions concerning the applicability of meta-heuristic methods for real-world problems; further, some researchers claim there is a growing gap between research and practice in this area. The reason is that the complexity of real-world problems is growing very fast (e.g. due to globalisation), while researchers experiment with benchmark problems that are fundamentally the same as those of 50 years ago. Thus there is a need for a new class of benchmark problems that reflect the characteristics of real-world problems. In this paper, two main characteristics of real-world problems are introduced: combination and interdependence. We argue that real-world problems usually consist of two or more sub-problems that are interdependent (to each other). This interdependence is responsible for the complexity of the real-world problems, while the type of complexity in current benchmark problems is missing. A new problem, called the travelling thief problem, is introduced; it is a combination of two well-known problems, the knapsack problem and the travelling salesman problem. Some parameters which are responsible for the interdependence of these two sub-problems are defined. Two sets of parameters are introduced that result in generating two instances of the travelling thief problem. The complexities that are raised by interdependences for these two instances are discussed in detail. Finally, a procedure for generating these two instances is given.


genetic and evolutionary computation conference | 2014

A comprehensive benchmark set and heuristics for the traveling thief problem

Sergey Polyakovskiy; Mohammad Reza Bonyadi; Markus Wagner; Zbigniew Michalewicz; Frank Neumann

Real-world optimization problems often consist of several NP-hard optimization problems that interact with each other. The goal of this paper is to provide a benchmark suite that promotes a research of the interaction between problems and their mutual influence. We establish a comprehensive benchmark suite for the traveling thief problem (TTP) which combines the traveling salesman problem and the knapsack problem. Our benchmark suite builds on common benchmarks for the two sub-problems which grant a basis to examine the potential hardness imposed by combining the two classical problems. Furthermore, we present some simple heuristics for TTP and their results on our benchmark suite.


Swarm Intelligence | 2014

A locally convergent rotationally invariant particle swarm optimization algorithm

Mohammad Reza Bonyadi; Zbigniew Michalewicz

Several well-studied issues in the particle swarm optimization algorithm are outlined and some earlier methods that address these issues are investigated from the theoretical and experimental points of view. These issues are the: stagnation of particles in some points in the search space, inability to change the value of one or more decision variables, poor performance when the swarm size is small, lack of guarantee to converge even to a local optimum (local optimizer), poor performance when the number of dimensions grows, and sensitivity of the algorithm to the rotation of the search space. The significance of each of these issues is discussed and it is argued that none of the particle swarm optimizers we are aware of can address all of these issues at the same time. To address all of these issues at the same time, a new general form of velocity update rule for the particle swarm optimization algorithm that contains a user-definable function


Journal of Heuristics | 2014

An analysis of the velocity updating rule of the particle swarm optimization algorithm

Mohammad Reza Bonyadi; Zbigniew Michalewicz; Xiaodong Li


IEEE Transactions on Evolutionary Computation | 2016

Analysis of Stability, Local Convergence, and Transformation Sensitivity of a Variant of the Particle Swarm Optimization Algorithm

Mohammad Reza Bonyadi; Zbigniew Michalewicz

f


International Journal of Parallel Programming | 2009

A bipartite genetic algorithm for multi-processor task scheduling

Mohammad Reza Bonyadi; Mohsen Ebrahimi Moghaddam


IEEE Transactions on Evolutionary Computation | 2016

Stability Analysis of the Particle Swarm Optimization Without Stagnation Assumption

Mohammad Reza Bonyadi; Zbigniew Michalewicz

f is proposed. It is proven that the proposed velocity update rule guarantees to address all of these issues if the function


genetic and evolutionary computation conference | 2014

Socially inspired algorithms for the travelling thief problem

Mohammad Reza Bonyadi; Zbigniew Michalewicz; Michal Roman Przybylek; Adam Wierzbicki


Swarm and evolutionary computation | 2014

A hybrid particle swarm with a time-adaptive topology for constrained optimization

Mohammad Reza Bonyadi; Xiang Li; Zbigniew Michalewicz

f

Collaboration


Dive into the Mohammad Reza Bonyadi's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Xiang Li

University of Adelaide

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge