نتایج جستجو برای: cellular genetic algorithm
تعداد نتایج: 1684801 فیلتر نتایج به سال:
cellular manufacturing system (cms) is highly important in modern manufacturing methods. given the ever increasing market competition in terms of time and cost of manufacturing, we need models to decrease the cost and time of manufacturing. in this study, cms is considered in condition of dynamic demand in each period. the model is developed for facing dynamic demand that increases the cost of ...
this study emphasized the ability of genetic algorithm and cellular automate to simulate urban land use changes by integrating adaptive model. the most important part of modeling is to define transition rules. in this research, a cellular automata model in dinamica ego software was used coupled with genetic algorithm. according to disability of the software for manipulating large number of var...
به کارگیری روشهای بهینه سازی در تحلیل سیستم های عمران، همانند شبکه های توزیع آب و جمع آوری فاضلاب، منابع آب، سازه و... در چند دهه اخیر مورد توجه متخصصین این رشته واقع شده است. با توجه به هزینه بری فراوان طرحهای آب و فاضلاب (شبکه های توزیع آب و جمع آوری فاضلاب) لزوم به کارگیری روشهای نو و به صرفه برای طراحی و اجرای سیستم های مذکور احساس می شود. روشهای سنتی و مرسوم طراحی شبکه های توزیع آب و جمع آ...
in this paper, we present a simulated annealing (sa) and a genetic algorithm (ga) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. a virtual manufacturing cell (vmc) is a group of resources that is dedicated to the manufacturing of a part family. although this grouping is not reflected in the physical structure of the manufacturing system, but machin...
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
this paper presents the hardware simulation (based on vhdl code) of a multiple-fault tolerant cellular genetic algorithm. this study aims to increase the immunity of cellular genetic algorithm in multiple-fault situation. here, multiple-fault refers to the situation that seu (single event upset) occurs simultaneously at two or more bits of the chromosome and fitness registers. the fault model i...
in this paper an application of cellular learning automata (cla) to vlsi placement is presented. the cla, which is introduced for the first time in this paper, is different from standard cellular learning automata in two respects. it has input and the cell neighborhood varies during the operation of cla. the proposed cla based algorithm for vlsi placement is tested on number of placement proble...
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
چکیده ندارد.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید