The concepts of robust classification and intelligently controlling the search process of genetic algorithm (GA) are introduced and integrated with a conventional genetic classifier for development of a new version of it, which is called Intelligent and Robust GA-classifier (IRGA-classifier). It can efficiently approximate the decision hyperplanes in the feature space. It is shown experime...

prediction of the agricultural developmental problems has ever been one of the goals of proper agricultural development, to gain more productions from the minimum resources. the goal of this research is zoning prone area of olive cultivation with two methods: gis and genetic algorithm. also the results have been compared with the current olive cultivation areas in lorestan province and the resu...

In this paper, we address the problem of buffer management in a DBMS when the workload consists of transactions of different priority levels. We present Priority-Hints. a new buffer management algorithm that uses hints provided by the DBMS access methods. The performance of Priority-Hints is compared to that of priority buffer management schemes introduced earlier for a variety of workloads. Ou...

This paper presents a biased random-keys genetic algorithm for the Resource Constrained Project Scheduling Problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are de ned by the genetic algorithm. A forward-backward improvement procedure is applied to all solution...

Research on the Flexible Job Shop Scheduling (FJSP) problem in manufacturing process of aircraft engines has been carried out. It is found that there are real requirements such as order mandatory nodes and equipment selection current job scheduling process. Order node means some important orders must be delivered time at a certain point time, which often affects quality workshop results. In add...

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

In modern manufacturing systems like multi-resource constrained project scheduling problem with the multiple modes (mcPSP-mM) is complicated because of the complex interrelationships between the units of the different stages. In this paper, we develop an adaptive genetic algorithm (aGA) to solve the mcPSP-mM which is a well known NP-hard problem. A new aGA algorithm approach for solving these m...