نتایج جستجو برای: heuristic crossover

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

Journal: :iranian journal of chemistry and chemical engineering (ijcce) 2004
azzedine abbaci

the thermodynamic properties of fluids can be predicted using the global equations of state. among these thermodynamic properties of fluids, we choose the densities of the liquid and vapor phases. this paper considers the application of the crossover model to the vapor-liquid rectilinear diameter of sulfurhexafluoride. we also present a comparison of the crossover model equation with the experi...

Journal: :Journal of the Operational Research Society 2021

The distance-based critical node problem involves identifying a subset of nodes in network whose removal minimises pre-defined connectivity measure. Having the classical as special case, is computationally challenging. In this article, we study from heuristic algorithm perspective. We consider objective goal to minimise number pairs connected by path length at most k, subject budgetary constrai...

Journal: :Journal of physics 2023

Abstract Due to the shortcomings of GA in path planning, there are too many control variables and it is easy fall into local areas. We introduce idea a gene bank store new chromosomes generated each time bank. The linear regression proposed predict probability crossover mutation next generation. At same time, method increasing chromosome diversity proposed, which avoids problem that difficult s...

Journal: :IEEE Access 2023

In this paper, the problem of integration and scheduling automated guided vehicles (AGVs) inspection machines in medical sample-testing laboratories is addressed with objective minimizing maximum turnaround time (TAT). A genetic algorithm (GA) a sliding window (STW) heuristic (GA-STW) proposed for studied while incorporating vehicle assignment (VAA) decoding operations. mathematical model AGV m...

Journal: :Mathematics 2023

In cognitive radio (CR), cooperative spectrum sensing (CSS) employs a fusion of multiple decisions from various secondary user (SU) nodes at central center (FC) to detect spectral holes not utilized by the primary (PU). The energy detector (ED) is well-established technique (SS). However, major challenge in designing an detector-based SS requirement correct knowledge for distribution decision s...

2007
Zoheir Ezziane

This research investigates the use of intelligent techniques for the bipartite drawing problem (BDP). Due to the combinatorial nature of the solution space, the use of traditional search methods lead to exponential time. Hence, the aim of this paper is to speed up the search time when solving the BDP through the use of Evolutionary Algorithms (EAs) and Barycenter Heuristic (BC). EA is applied o...

Journal: :Computers 2016
Rafael Lahoz-Beltra

Abstract: Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quan...

Journal: :iranian journal of biotechnology 2013
hesamedin torabi dashti fatemeh zare-mirakabad nima aghaeepour hayedeh ahrabian abbas nowzari-dalini

background: rna molecules play many important regulatory, catalytic and structuralroles in the cell, and rna secondary structure prediction with pseudoknots is one themost important problems in biology. an rna pseudoknot is an element of the rna secondary structure in which bases of a single-stranded loop pair with complementary basesoutside the loop. modeling these nested structures (pseudokno...

Journal: :IEEE Access 2021

This article addresses a challenging industrial problem known as the unrelated parallel machine scheduling (UPMSP) with sequence-dependent setup times. In UPMSP, we have set of machines and group jobs. The goal is to find optimal way schedule jobs for execution by one several available machines. UPMSP has been classified an NP-hard optimisation and, thus, cannot be solved exact methods. Meta-he...

Journal: :IEEE Trans. Evolutionary Computation 2000
Gábor Magyar Mika Johnsson Olli Nevalainen

This paper presents a hybrid of genetic algorithm (GA) and local search operators for solving the three-matching problem (3MP). Several general / heuristic crossover and local hill-climbing operators are introduced. The adaptive process based on the observation of on-line performance of GA is used to select the feasible operators. In particular, the probability of applying an operator is increa...

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

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