optimizing the database queries is one of hard research problems. exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. the use of evolutionary methods, beca...

Since many real-world problems can be designed as optimization problems, heuristic algorithms are increasingly preferred by researchers. The Arithmetic Optimization Algorithm (AOA) is a newly developed algorithm. It uses four arithmetic operations in its structure. addition and subtraction operators enhanced the AOA's local search capability, while multiplication division global capability. has...

Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...

In practical situations, distribution network loads are the mixtures of residential, industrial, and commercial types. This paper presents a hybrid optimization algorithm for the optimal placement of shunt capacitor banks in radial distribution networks in the presence of different voltage-dependent load models. The algorithm is based on the combination of Genetic Algorithm (GA) and Binary Part...

In this paper, a novel hybrid optimization algorithm, which combines a firefly algorithms and Artificial Bee Colony algorithm (FFAABC), is proposed for solving the economic power dispatch (EPD) problem. The hybrid algorithm is structured with two stages. The first stage uses the search by firefly algorithm (FFA) and second stage is a search with Artificial Bee Colony algorithm (ABC). The hybrid...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...