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

today, with rapid growth of the world wide web and creation of internet sites and online text resources, text summarization issue is highly attended by various researchers. extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. when, we are facing into large data volume documents, the extr...

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

Scheduling and timetabling problems are multi-constrained constraint satisfaction problems that have huge search space. These problems are NP hard. This paper investigates the use of backtracking approaches to laboratory personnel scheduling problem in which the objective is to assign tasks to employees. The main objective of this work is to search for better solutions than those obtained by au...

This paper investigates a form of algorithm hybridization that combines constraint satisfaction algorithms with local search algorithms. On one hand, constraint satisfaction algorithms are eeective at nding feasible solutions for tightly constrained problems with complex constraints. On the other hand, local search algorithms are usually better at nding solutions that are good with respect to a...

In this paper, an efficient recursive construction algorithm based on the backtracking search algorithm is presented for the construction of accurate implication sets. The new techniques suggested improve the time and space complexities of the backtracking search algorithm dramatically.

Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting search from an elite solution. Empirical results indicate that for job shop scheduling optimization problems and quasi-group completion problems, multi-point constructive search performs significantly better than chronological backtr...

We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the unexplored part of the search tree will be similar to the part we have so far explored. We compare these methods against an old method due to Knut...