Assessment of pavement distresses is one of the important parts of pavement management systems to adopt the most effective road maintenance strategy. In the last decade, extensive studies have been done to develop automated systems for pavement distress processing based on machine vision techniques. One of the most important structural components of computer vision is the feature extraction met...

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

this study proposes a modified version of cultural algorithms (cas) which benefits from rule-based system for influence function. this rule-based system selects and applies the suitable knowledge source according to the distribution of the solutions. this is important to use appropriate influence function to apply to a specific individual, regarding to its role in the search process. this rule ...

cost optimization of the reinforced concrete cantilever soil retaining wall of a given height satisfying some structural and geotechnical design constraints is performed utilizing harmony search and improved harmony search algorithms. the objective function considered is the cost of the structure, and design is based on aci 318-05. this function is minimized subjected to design constraints. a n...

Comparison-based algorithms are for which the execution of each operation is solely based on outcome a series comparisons between elements [5]. Examples include most sorting algorithms, search and more general such as Heapify constructs heap data structure from an input list computations can be naturally represented via following computational model [12]: (a) structures partially-ordered finite...