Recently a novel technique has been published to augment traditional Branchand-Bound (B&B) while solving exactly a discrete optimization problem [Goldberg et al., 1997]. This technique is based on the negative thinking paradigm and has been applied to develop , a Unate Covering Problem (UCP) solver which reportedly was able to deal efficiently with some time-consuming benchmark problems. Howeve...

E-learning model is examined of three major dimensions. And each dimension has a range of indicators that is effective in optimization and modeling, in many optimization problems in the modeling, target function or constraints may change over time that as a result optimization of these problems can also be changed. If any of these undetermined events be considered in the optimization process, t...

This study focuses on the optimization of the plane structure. Sequential quadratic programming (SQP) will be utilized, which is one of the most efficient methods for solving nonlinearly constrained optimization problems. A new formulation for the second order sensitivity analysis of the two-dimensional finite element will be developed. All the second order required derivatives will be calculat...

Ant colony optimization (ACO) is a novel and promising meta-heuristic for solving hard combinatorial optimization problems, such as travelling salesman[3] [4] [5] [6] [7] [8], quadratic assignment[9] [10] [11] [12] and set covering problem [13]. Unfortunately, according to systems performance evaluation literature, the methods adopted to experimentally validate the current ACO are not enough ac...

A new combinatorial approach for modeling and reconstructing sibling relationships in a single generation of individuals without parental information is proposed in this paper. Simple genetic constraints on the full-sibling groups, imposed by the Mendelian inheritance rules, are employed to investigate data from codominant DNA markers. To extract the minimum number of biologically consistent si...

Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependen...

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...