• Title, Summary, Keyword: heuristic optimization algorithms

Search Result 165, Processing Time 0.049 seconds

A Hybrid of Evolutionary Search and Local Heuristic Search for Combinatorial Optimization Problems

  • Park, Lae-Jeong;Park, Cheol-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.1 no.1
    • /
    • pp.6-12
    • /
    • 2001
  • Evolutionary algorithms(EAs) have been successfully applied to many combinatorial optimization problems of various engineering fields. Recently, some comparative studies of EAs with other stochastic search algorithms have, however, shown that they are similar to, or even are not comparable to other heuristic search. In this paper, a new hybrid evolutionary algorithm utilizing a new local heuristic search, for combinatorial optimization problems, is presented. The new intelligent local heuristic search is described, and the behavior of the hybrid search algorithm is investigated on two well-known problems: traveling salesman problems (TSPs), and quadratic assignment problems(QAPs). The results indicate that the proposed hybrid is able to produce solutions of high quality compared with some of evolutionary and simulated annealing.

  • PDF

A new hybrid meta-heuristic for structural design: ranked particles optimization

  • Kaveh, A.;Nasrollahi, A.
    • Structural Engineering and Mechanics
    • /
    • v.52 no.2
    • /
    • pp.405-426
    • /
    • 2014
  • In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.

Heuristic Algorithms for Optimization of Energy Consumption in Wireless Access Networks

  • Lorincz, Josip;Capone, Antonio;Begusic, Dinko
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.626-648
    • /
    • 2011
  • Energy consumption of wireless access networks is in permanent increase, which necessitates development of more energy-efficient network management approaches. Such management schemes must result with adaptation of network energy consumption in accordance with daily variations in user activity. In this paper, we consider possible energy savings of wireless local area networks (WLANs) through development of a few integer linear programming (ILP) models. Effectiveness of ILP models providing energy-efficient management of network resources have been tested on several WLAN instances of different sizes. To cope with the problem of high computational time characteristic for some ILP models, we further develop several heuristic algorithms that are based on greedy methods and local search. Although heuristics obtains somewhat higher results of energy consumption in comparison with the ones of corresponding ILP models, heuristic algorithms ensures minimization of network energy consumption in an amount of time that is acceptable for practical implementations. This confirms that network management algorithms will play a significant role in practical realization of future energy-efficient network management systems.

Effective Task Scheduling and Dynamic Resource Optimization based on Heuristic Algorithms in Cloud Computing Environment

  • NZanywayingoma, Frederic;Yang, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5780-5802
    • /
    • 2017
  • Cloud computing system consists of distributed resources in a dynamic and decentralized environment. Therefore, using cloud computing resources efficiently and getting the maximum profits are still challenging problems to the cloud service providers and cloud service users. It is important to provide the efficient scheduling. To schedule cloud resources, numerous heuristic algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search (CS) algorithms have been adopted. The paper proposes a Modified Particle Swarm Optimization (MPSO) algorithm to solve the above mentioned issues. We first formulate an optimization problem and propose a Modified PSO optimization technique. The performance of MPSO was evaluated against PSO, and GA. Our experimental results show that the proposed MPSO minimizes the task execution time, and maximizes the resource utilization rate.

An investigation of non-linear optimization methods on composite structures under vibration and buckling loads

  • Akbulut, Mustafa;Sarac, Abdulhamit;Ertas, Ahmet H.
    • Advances in Computational Design
    • /
    • v.5 no.3
    • /
    • pp.209-231
    • /
    • 2020
  • In order to evaluate the performance of three heuristic optimization algorithms, namely, simulated annealing (SA), genetic algorithm (GA) and particle swarm optimization (PSO) for optimal stacking sequence of laminated composite plates with respect to critical buckling load and non-dimensional natural frequencies, a multi-objective optimization procedure is developed using the weighted summation method. Classical lamination theory and first order shear deformation theory are employed for critical buckling load and natural frequency computations respectively. The analytical critical buckling load and finite element calculation schemes for natural frequencies are validated through the results obtained from literature. The comparative study takes into consideration solution and computational time parameters of the three algorithms in the statistical evaluation scheme. The results indicate that particle swarm optimization (PSO) considerably outperforms the remaining two methods for the special problem considered in the study.

Regularizing structural configurations by using meta-heuristic algorithms

  • Massah, Saeed Reza;Ahmadi, Habibullah
    • Geomechanics and Engineering
    • /
    • v.12 no.2
    • /
    • pp.197-210
    • /
    • 2017
  • This paper focuses on the regularization of structural configurations by employing meta-heuristic optimization algorithms such as Particle Swarm Optimization (PSO) and Biogeography-Based Optimization (BBO). The regularization of structural configuration means obtaining a structure whose members have equal or almost equal lengths, or whose member's lengths are based on a specific pattern; which in this case, by changing the length of these elements and reducing the number of different profiles of needed members, the construction of the considered structure can be made easier. In this article, two different objective functions have been used to minimize the difference between member lengths with a specific pattern. It is found that by using a small number of iterations in these optimization methods, a structure made of equal-length members can be obtained.

Optimal design of truss structures using a new optimization algorithm based on global sensitivity analysis

  • Kaveh, A.;Mahdavi, V.R.
    • Structural Engineering and Mechanics
    • /
    • v.60 no.6
    • /
    • pp.1093-1117
    • /
    • 2016
  • Global sensitivity analysis (GSA) has been widely used to investigate the sensitivity of the model output with respect to its input parameters. In this paper a new single-solution search optimization algorithm is developed based on the GSA, and applied to the size optimization of truss structures. In this method the search space of the optimization is determined using the sensitivity indicator of variables. Unlike the common meta-heuristic algorithms, where all the variables are simultaneously changed in the optimization process, in this approach the sensitive variables of solution are iteratively changed more rapidly than the less sensitive ones in the search space. Comparisons of the present results with those of some previous population-based meta-heuristic algorithms demonstrate its capability, especially for decreasing the number of fitness functions evaluations, in solving the presented benchmark problems.

Optimum design of steel frame structures by a modified dolphin echolocation algorithm

  • Gholizadeh, Saeed;Poorhoseini, Hamed
    • Structural Engineering and Mechanics
    • /
    • v.55 no.3
    • /
    • pp.535-554
    • /
    • 2015
  • Dolphin echolocation (DE) optimization algorithm is a recently developed meta-heuristic in which echolocation behavior of Dolphins is utilized for seeking a design space. The computational performance of meta-heuristic algorithms is highly dependent to its internal parameters. But the computational time of adjusting these parameters is usually extensive. The DE is an efficient optimization algorithm as it includes few internal parameters compared with other meta-heuristics. In the present paper a modified Dolphin echolocation (MDE) algorithm is proposed for optimization of steel frame structures. In the MDE the step locations are determined using one-dimensional chaotic maps and this improves the convergence behavior of the algorithm. The effectiveness of the proposed MDE algorithm is illustrated in three benchmark steel frame optimization test examples. Results demonstrate the efficiency of the proposed MDE algorithm in finding better solutions compared to standard DE and other existing algorithms.

A Hybridization of Adaptive Genetic Algorithm and Particle Swarm Optimization for Numerical Optimization Functions

  • Yun, Young-Su;Gen, Mitsuo
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • /
    • pp.463-467
    • /
    • 2008
  • Heuristic optimization using hybrid algorithms have provided a robust and efficient approach for solving many optimization problems. In this paper, a new hybrid algorithm using adaptive genetic algorithm (aGA) and particle swarm optimization (PSO) is proposed. The proposed hybrid algorithm is applied to solve numerical optimization functions. The results are compared with those of GA and other conventional PSOs. Finally, the proposed hybrid algorithm outperforms others.

  • PDF

Colliding bodies optimization for size and topology optimization of truss structures

  • Kaveh, A.;Mahdavi, V.R.
    • Structural Engineering and Mechanics
    • /
    • v.53 no.5
    • /
    • pp.847-865
    • /
    • 2015
  • This paper presents the application of a recently developed meta-heuristic algorithm, called Colliding Bodies Optimization (CBO), for size and topology optimization of steel trusses. This method is based on the one-dimensional collisions between two bodies, where each agent solution is considered as a body. The performance of the proposed algorithm is investigated through four benchmark trusses for minimum weight with static and dynamic constraints. A comparison of the numerical results of the CBO with those of other available algorithms indicates that the proposed technique is capable of locating promising solutions using lesser or identical computational effort, with no need for internal parameter tuning.