Results 81 to 90 of about 4,528,698 (293)

A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem [PDF]

, 2011
Copyright @ Springer-Verlag Berlin Heidelberg 2011.The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided ...
Yang, S, Shengxiang Yang, Jat, SN, Sadaf Naseem Jat, Yang, Shengxiang, Jat, Sadaf Naseem   +5 more
core   +1 more source

Polarization‐resolved femtosecond Vis/IR spectroscopy tailored for resolving weak signals in biological samples using minimal sample volume

FEBS Open Bio, EarlyView.
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley   +1 more source

A NEW MULTI-FREQUENCY VIBRATIONAL GENETIC ALGORITHM IN RADAR CROSS SECTION MINIMIZATION PROBLEMS

Havacılık ve Uzay Teknolojileri Dergisi, 2009
Within this study, it is aimed to provide an efficient stochastic algorithm for different optimization problems. For this purpose, as a search method, multi frequency vibrational genetic algorithm [m-VGA] is improved and used to accelerate the genetic ...
Y. Volkan Pehlivanoğlu
doaj  

Analysis of usage of genetic and tabu search algorithms in shop scheduling

Lietuvos Matematikos Rinkinys, 2008
A wide area of scheduling problem is industrial so-called shop scheduling (Job Shop, Flow Shop and Open Shop) which has important applications in real world industrial problems.
Edgaras Šakurovas , Narimantas Listopadskis   +1 more
doaj   +1 more source

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

FEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli, Mohammad Nour Alsamsam, Ugnė Bagdonaitė, Van Truc Vu, Chun‐Jen Huang, Polina Kuzhir, Mindaugas Zaremba, Aurimas Kopūstas, Marijonas Tutkus   +8 more
wiley   +1 more source

An Improved NSGA-III Algorithm Using Genetic K-Means Clustering Algorithm

IEEE Access, 2019
The non-dominated sorting genetic algorithm III (NSGA-III) has recently been proposed to solve many-objective optimization problems (MaOPs). While this algorithm achieves good diversity, its convergence is unsatisfactory.
Qingguo Liu, Xinxue Liu, Jian Wu, Yaxiong Li   +3 more
doaj   +1 more source

RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells

FEBS Open Bio, EarlyView.
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour, Christine Volmert, Valentina Piano   +2 more
wiley   +1 more source

Optimization method of truss structure size and shape based on harmonic search genetic algorithm

Jixie qiangdu
In order to improve the traditional design concept and the lack of optimization of genetic algorithm, and promote the development and innovation of the shape optimization of truss structure, according to the basic principles of harmony search algorithm ...
XIE Jun, ZHANG Huashuai, LIN Shuqin, PANG Bolei, YAN Jie   +4 more
doaj  

Public Transport Route Finding using a Hybrid Genetic Algorithm [PDF]

In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order
Andreea DIOSTEANU, Liviu Adrian COTFAS
core  

A self-organizing random immigrants genetic algorithm for dynamic optimization problems [PDF]

, 2007
This is the post-print version of the article. The official published version can be obtained from the link below - Copyright @ 2007 SpringerIn this paper a genetic algorithm is proposed where the worst individual and individuals with indices close to ...
Yang, S, Tinos, Renato, Shengxiang Yang, Tinos, R, Yang, Shengxiang, Shengxiang Yang (7582940), Renato Tinos (7582937), Renato Tinós   +7 more
core   +1 more source