نتایج جستجو برای: binary genetic algorithm

تعداد نتایج: 1401413  

A. Yazdian, H. Seifi, R. Keypour,

In this paper, two algorithms have been developed for allocation and size determination of Active Power Filters (APF) in power systems. In the first algorithm, the objective is to minimize harmonic voltage distortion. The objective in the second algorithm is to minimize the new APF injection currents while satisfying harmonic standards. Genetic algorithm is proposed for these two optimization p...

Journal: :IEICE Transactions 2005
Jong-Wook Kim Sang Woo Kim

This paper presents new encoding methods for the binary genetic algorithm (BGA) and new converting methods for the real-coded genetic algorithm (RCGA). These methods are developed for the specific case in which some parameters have to be searched in wide ranges since their actual values are not known. The oversampling effect which occurs at large values in the wide range search are reduced by a...

2016
Maolong Xi Jun Sun Li Liu Fangyun Fan Xiaojun Wu

This paper focuses on the feature gene selection for cancer classification, which employs an optimization algorithm to select a subset of the genes. We propose a binary quantum-behaved particle swarm optimization (BQPSO) for cancer feature gene selection, coupling support vector machine (SVM) for cancer classification. First, the proposed BQPSO algorithm is described, which is a discretized ver...

Journal: :journal of industrial engineering and management studies 0
f. molavi sadjad university of technology, mashhad, iran. e. rezaee nik sadjad university of technology, mashhad, iran.

resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...

Journal: :journal of ai and data mining 2015
a. ghaffari s. nobahary

wireless sensor networks (wsns) consist of a large number of sensor nodes which are capable of sensing different environmental phenomena and sending the collected data to the base station or sink. since sensor nodes are made of cheap components and are deployed in remote and uncontrolled environments, they are prone to failure; thus, maintaining a network with its proper functions even when und...

2000
Marin Golub

This paper describes the implementation details and compares two methods for optimisation of multi-dimensional cost functions. The implemented genetic algorithm uses two chromosome representations: binary and floating point. In both representations the algorithm is based on steady-state reproduction, roulette-wheel bad individuals selection and has the same parameters.

2008
Abas Sabouni Ali Ashtari Sima Noghanian Stephen Pistorius

This paper addresses a novel microwave tomography method for the reconstruction of the dielectric properties of breast tissue using the percentage of the tissue water content. The reconstruction algorithm consists of a combination of a binary and a real Genetic Algorithm (GA).

Journal: :مدیریت فناوری اطلاعات 0
محمد رضا مهرگان علیرضا فراست

in this study, a hybrid algorithm is presented to tackle multi-variables robust design problem. the proposed algorithm comprises neural networks (nns) and co-evolution genetic algorithm (cga) in which neural networks are as a function approximation tool used to estimate a map between process variables. furthermore, in order to make a robust optimization of response variables, co-evolution algor...

2003
G. Schütz F. M. Pires

In this work we present an algorithm to the unrestricted binary quadratic program. This approach combines genetic operators with greedy and heuristic procedures. We started from a genetic based algorithm and replaced the random mutation by a greedy procedure based on each variable contribution to the objective function. We also introduced in the genetic population an individual obtained by a he...

2007
Li Li Sushil J. Louis James N. Brune

This paper explores the possibility of using genetic algorithms to invert seismic refraction travel time data for a two-dimensional velocity structure. The problem is usually high-dimensional, non-linear and multi-modal. Our chromosome is encoded as a two-dimensional real number array. Binary tournament selection, two-point crossover and block mutation directed by prior geological knowledge are...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->