In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...

There has been substantial recent interest in two new families of search techniques. One family consists of systematic approaches, which use the idea of dependency directed backtracking (DDB) and dynamic backtracking (DB) as an antidote for the inefficiencies of chronological backtracking. Based on backtracking, systematic approaches are able to produce an optimal assignment, when no time limit...

Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function a...

Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). That system can be seen as an integration of arc-consistency within the dynamic backtracking algorithm [Ginsberg, 1993]. Dynamic backtracking replaces the backtracking process by a much less blind behavior that consists in local mod...

Path planning is an important area of mobile robot research, and the ant colony optimization algorithm essential for analyzing path planning. However, current applied to robots still has some limitations, including early blind search, slow convergence speed, more turns. To overcome these problems, improved proposed in this paper. In algorithm, we introduce idea triangle inequality a pseudo-rand...

This article deals with the multicriteria programming model to optimize time of completing home assignments by school students in both in-class and online forms teaching. To develop a solution, we defined 12 criteria influencing exercises’ effectiveness. In this amount, five describe exercises themselves seven others conditions at which are completed. We used these design neural network, output...

We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitment to variable assignment of local search. Our method backtracks through a space of complete but possibly inconsistent solutions while supporting the freedom to move arbitrarily under heuristic guidance. The version of the schem...

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...