In this study, the performance of the algorithms of whale, Differential evolutionary, crow search, and Gray Wolf optimization were evaluated to operate the Golestan Dam reservoir with the objective function of meeting downstream water needs. Also, after defining the objective function and its constraints, the convergence degree of the algorithms was compared with each other and with the absolut...

Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean Optimization (PBO) algorithms. This paper addresses the utilization of Gomory mixed-integer and clique cuts, in Satisfiability-based algorithms for PBO, and shows how these cuts can be used for computing lower bounds ...

This paper extends existing work on constraint-based scheduling for solving complex Resource Constrained Project Scheduling Problems. The main result of the paper is the reduction of the RCPSP/max problem to a Disjunctive Temporal Problem that allow customization of specific properties within a backtracking search procedure for makespan optimization where decision variables are Minimal Critical...

Nature computing has evolved with exciting performance to solve complex real-world combinatorial optimization problems. These problems span across engineering, medical sciences, and sciences generally. The Ebola virus a propagation strategy that allows individuals in population move among susceptible, infected, quarantined, hospitalized, recovered, dead sub-population groups. Motivated by the e...

Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...

Stochastic local search is one of the most successful methods for model finding in propositional satisfiability. However, many combinatorial problems have no concise propositional encoding. In this paper, we show that domain-independent local search for satisfiability (Walksat) can be generalized to handle systems of linear pseudo-Boolean (0-1 integer) constraints, a representation that is wide...

Optimal design of large-scale structures is a rather difficult task and the computational efficiency of the currently available methods needs to be improved. In view of this, the paper presents a modified Charged System Search (CSS) algorithm. The new methodology is based on the combination of CSS and Particle Swarm Optimizer. In addition, in order to improve optimization search, the sequence o...

In this paper, we propose a novel search algorithm called band search that generalizes guided depth-first and best-first searches. The search allocates a band of at most W nodes in each level of the search tree for storing active nodes in that level, D priority lists, one for each level, for storing overflow nodes, and D counters, one for each level, for keeping track of and to limit the degree...

An important topic of research in computer systems is the optimization finding optimum course action based on different variables, such as environment's state, system's goal, etc. The building entire state search space, also known minimax algorithm, can result from any algorithm's attempt to find best feasible solution among all possibilities. recursive backtracking algorithm Minimax used selec...