نتایج جستجو برای: hybrid genetic algorithm
تعداد نتایج: 1462452 فیلتر نتایج به سال:
The project scheduling problem is known as a NP-hard problem in literature. In this research, a resource constrained project scheduling problem which is known as a NP-Hard problem is considered. This problem has attracted many researchers during recent years. The aim of this problem is to determine the optimal starting times of activities considering both precedence and available resources co...
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
In this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. Various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. The goal of the proposed model is to efficiently respond to the customers’ demands in the presenc...
This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach ...
In this paper, we propose a Hybrid Genetic Algorithm for data model partitioning of power distribution network. Analytical functions are the core of Distribution Management Systems (DMSs). Efficient calculation of the functions is of the utmost importance for the DMS users; the necessary preconditions for the efficient calculation are optimal load balancing of processors and data model partitio...
The forward kinematics of the 6-6 leg parallel manipulator is solved using hybrid meta-heuristic techniques in which the simulated annealing algorithm replaces the mutation operator in a genetic algorithm. The results are compared with the standard simulated annealing and genetic algorithm. It shows that the standard simulated annealing algorithm outperforms standard genetic algorithm in terms ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید