نتایج جستجو برای: ga algorithm
تعداد نتایج: 775820 فیلتر نتایج به سال:
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
This paper proposes an efficient and novel method for transmission expansion planning in regulated environment of power systems. The method is based on combination of two algorithms such as special genetic algorithm (GA) and constructive heuristic algorithm. The proposed GA has its own special characteristics that make it better than other metahuristic methods in transmission expansion planning...
This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...
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, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem. Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
A total of 1099 data points consisting of alcohol-alcohol, alcohol-alkane, alkane-alkane, alcohol-amine and acid-acid binary solutions were collected from scientific literature to develop an appropriate artificial neural network (ANN) model. Temperature, molecular weight of the pure components, mole fraction of one component and the structural groups of the components were used as input paramet...
Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. Graph coloring problem (GCP) is about finding the smallest number of colors needed to color a given graph. The smallest number of colors needed to color a graph G, is called its chromatic number. GCP is a well-known NP-hard problems and, therefore, heuristic algorithms are usually...
One of the strategies for reduction of energy consumption in railway systems is to execute efficient driving by presenting optimized speed profile considering running time, energy consumption and practical constraints. In this paper, by using real route data, an approach based on combination of Genetic and Particle swarm (GA-PSO) algorithms in order to optimize the fuel consumption is provided....
This paper presents a new mathematical model for integrated dynamic cellular manufacturing systems and production planning that minimizes machine purchasing, intra-cell material handling, cell reconfiguration and setup costs. The presented model forms the manufacturing cells and determines the quantity of machine and movements during each period of time. This problem is NP-hard, so a meta-heur...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید