نتایج جستجو برای: hybrid algorithm optimization

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

Journal: :TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES 2019

Journal: :Computers, materials & continua 2023

This paper proposes Parallelized Linear Time-Variant Acceleration Coefficients and Inertial Weight of Particle Swarm Optimization algorithm (PLTVACIW-PSO). Its designed has introduced the benefits Parallel computing into combined power TVAC (Time-Variant Coefficients) IW (Inertial Weight). Proposed been tested against linear, non-linear, traditional, multiswarm based optimization algorithms. An...

Journal: :Bulletin of Electrical Engineering and Informatics 2021

Pneumonia affects so many people around the world, which leads to of them being killed. In order identify and diagnose disease, patient must first undergo an x-ray scan chest (CXR). Disease will be identified according CXR images. Software diagnostic tools are used help decision-making promote pneumonia diagnosis process. From these is gray level distribution moments (GLDM) algorithm for image ...

Journal: :international journal of civil engineering 0
c. torres-machi camino de vera, s/n 46022 valencia (spain) v. yepes camino de vera, s/n 46022 valencia (spain) j. alcala camino de vera, s/n 46022 valencia (spain) e. pellicer camino de vera, s/n 46022 valencia (spain)

this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...

Journal: :journal of advances in computer research 2013
ali safari mamaghani kayvan asghari mohammad reza meybodi

evolutionary algorithms are some of the most crucial random approaches tosolve the problems, but sometimes generate low quality solutions. on the otherhand, learning automata are adaptive decision-making devices, operating onunknown random environments, so it seems that if evolutionary and learningautomaton based algorithms are operated simultaneously, the quality of results willincrease sharpl...

Journal: :Discrete Event Dynamic Systems 2000
Leyuan Shi

Stochastic discrete resource allocation problems are difficult to solve. In this paper, we propose a new algorithm designed specifically to tackle them. The algorithm combines with the Nested Partitions method, the Ordinal Optimization techniques, and an efficient simulation control technique. The resulting hybrid algorithm retains the global perspective of the Nested Partitions method and the ...

Journal: :mechanics of advanced composite structures‎ 2014
hossein hemmatian abdolhossein fereidoon hadi shirdel

imperialist competitive algorithm (ica) is a new socio-politically motivated global search strategy. the ica is applied to hybrid composite laminates to obtain minimum weight and cost. the approach which is chosen for conducting the multi-objective optimization was the weighted sum method (wsm). the hybrid composite laminates are made of glass/epoxy and carbon/epoxy to combine the lightness and...

M. Pourmahyabadi,

In this article, Hill Climbing (HC) and Estimation of Distribution Algorithm (EDA) are integrated to produce a hybrid intelligent algorithm for design of endlessly Single Mode Photonic Crystal Fibers (SMPCFs) structure with desired properties over the C communication band. In order to analyzing the fiber components, Finite Difference Frequency Domain (FDFD) solver is applied. In addition, a spe...

Mani Sharifi, Mehdi Yazdani, Mohammad Jafar Tarokh, Mohammad Navid Mokhtarian

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...

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

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