many real world problems can be modelled as an optimization problem. evolutionary algorithms are used to solve these problems. ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. these ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. ant colony optim...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

an evolutionary structural optimization (eso) method is used for plastic design of frames. based on safe theorems some criteria are derived and made an effort to satisfy them during the optimization process. in this regard, equilibrium is checked and yield condition is gradually satisfied during the optimization process. in this method, the amount of used material and the stiffness for each ele...

Abstract In this paper the problem of concurrent topological optimization two different bodies sharing a region design space is dealt with. This focuses on simultaneous (components) where not only material distribution each body has to be optimized but also divided among bodies. novel formulation represents in which more than one component have located inside limited allowable room. Each its ow...

the present study is concerned with the simultaneous optimization of the size of components and the arrangement of connections for performance-based seismic design of low-rise spsws. design variables include the size of beams and columns, the thickness of the infill panels, the type of each beam-to-column connection and the type of each infill-to-boundary frame connection. the objective functio...

this paper presents a new meta-heuristic solution to find the efficient frontier using the mean-variance approach. portfolio optimization problem is a quadratic programming model and, changes to np-hard if the number of assets and constraints has increased, and it cannot be solved using common mathematical methods in a reasonable time. therefore, a heuristic or meta-heuristic algorithm should b...

in this work, harmony search meta-heuristic optimization algorithm has been developed for aerodynamic shape optimization problem for the first time. the aerodynamic shape, which has been investigated, is an airfoil with parces method for its shape parameterization. the problem was minimization of aerodynamic objective function using inverse design method and the objective function has been the ...

nowadays, software cost estimation (sce) with machine learning techniques are more performance than other traditional techniques which were based on algorithmic techniques. in this paper, we present a new hybrid model of multi-layer perceptron (mlp) artificial neural network (ann) and ant colony optimization (aco) algorithm for high accuracy in sce called multilayer perceptron ant colony optimi...

augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...