Watermarking has increased dramatically in recent years in the Internet and digital media. Watermarking is one of the powerful tools to protect copyright. Local image features have been widely used in watermarking techniques based on feature points. In various papers, the invariance feature has been used to obtain the robustness against attacks. The purpose of this research was based on local f...

The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...

This paper presents an energy management strategy to supply residential load by hybrid fuel cell power plant (FCPP). Economical fuel cell (FC) model includes thermal load, local electrical load, operational cost, startup cost and different tariffs on electricity during the day hour is discussed.  Several Strategies have been presented for supplying residential load (electrical and thermal loads...

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

the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...

The basic idea of local search is to find a good local optima quickly enough to approximate the global optima. This idea is somewhat like hill climbing. Starting from an arbitrary point, we try to go down or climb up a little step and compare the objective value at the new point to that at the old point. We then choose the step that increase the objective value. In this manner, we finally reach...

In the paper we investigate stochastic local search by Markov chain analysis in a high and a low dimensional discrete space. In the n-dimensional space Bn a function called Jump is considered. The analysis shows that an algorithm using a large neighborhood and never accepting worse points performs much better than any local search algorithm accepting worse points with a certain probability. We ...

Hybrid algorithms formed by the combination of Genetic Algorithms with Local Search methods provide increased performances when compared to real coded GA or Local Search alone. However, the cost of Local Search can be rather high. In this paper we present a new hybrid algorithm which reduces the total cost of local search by avoiding the start of the method in basins of attraction where a local...

This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical function...