The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...

in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...

in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

In this dissertation we investigate logic programming to model decision-making. To this extent, we introduce three formalisms with increasing expressiveness. The most basic one, called choice logic programming, allows circumstance-dependent decisions. The stable models of the program correspond to the rational solutions of the represented decision-problem. To support dynamic preference-based de...

in this paper, we consider rna structures with arc-length 4 . first, we represent thesestructures as matrix models and zero-one linearprogramming problems. then, we obtain anoptimal solution for this problemusing an implicit enumeration method. the optimal solutioncorresponds toan rna structure with the maximum number of hydrogen bonds.

In this paper, we examine genetic programming as a policy search technique for planning problems representable as Markov Decision Processes. The planning task under consideration is derived from a real-time strategy war game. This problem presents unique challenges for standard genetic programming approaches; despite this, we show that genetic programming produces results competitive with stand...

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

Stacking sequence design of a composite laminate with a given set of plies is a combinatorial problem of seeking an optimal permutation. Permutation genetic algorithms optimizing the stacking sequence of a composite laminate for maximum buckling load are studied. A new permutation GA named gene±rank GA is developed and compared with an existing Partially Mapped Permutation GA, originally develo...

in this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. the main idea is that the processing times of operations may be controlled by consumptions of additional resources. the purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. the proposed model, flexibl...