Search Results - parallel program search algorithm
Search alternatives:
- program search »
-
1
Parallel Homologous Search With Hirschberg Algorithm: A Hybrid MPI-Pthreads Solution.
Published 2007“…In this paper, we apply two different parallel programming model, the message passing model using Message Passing Interface (MPI) and the multithreaded model using Pthreads, to-protein sequence homologous search. …”
Get full text
Get full text
Conference or Workshop Item -
2
Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems
Published 2018“…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
Get full text
Get full text
Thesis -
3
Local search approaches for patient scheduling problem in parallel operating theatre
Published 2020“…The objective of the study is to propose different types of local search which are local search(LS), improved local search(ILS) and mixed local search (MLS) for solving patient scheduling problem in parallel OT. …”
Get full text
Get full text
Thesis -
4
-
5
Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line
Published 2010“…The problem under study attempted to describe the mathematical programming limitation for minimizing the overall make-span and balancing objective for set of parallel lines. …”
Get full text
Get full text
Get full text
Article -
6
Disjunctive programming-tabu search for job shop scheduling problem / Syarifah Zyurina Nordin ... [et al.]
Published 2021“…A tabu search (TS) algorithm has been implemented to solve the job shop scheduling problem. …”
Get full text
Get full text
Conference or Workshop Item -
7
-
8
Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib
Published 2019“…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. Modification and simplification using parallel processing are done for both methods to grossly search the optimal solution and to minimize the program running time, respectively. …”
Get full text
Get full text
Get full text
Thesis -
9
A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
Published 2020“…The current paper presents a neural network-based hybrid strategy that combines a Genetic Algorithm (GA) and a Dual Recurrent Neural Network (DRNN) for efficiently and accurately solving the quadratic-Bi-level Programming Problem (BLPP). …”
Get full text
Get full text
Article -
10
-
11
Three-point Block Algorithm For Approximating Duffing Type Differential Equations
Published 2024journal::journal article -
12
Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining.
Published 2005“…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
Get full text
Get full text
Thesis -
13
Development of a multi-objective optimization model for transport and environment in a closed-loop automotive supply chain
Published 2014“…In the last stage, an extended Gravitational Search Algorithm (GSA) as a parallel search algorithm and high convergence rate into high quality final solutions is used to solve the proposed mathematical model and to achieve the Pareto set of solution. …”
Get full text
Get full text
Thesis -
14
Scheduling dynamic cellular manufacturing systems in the presence of cost uncertainty using heuristic method
Published 2016“…Since the proposed models (like similar models in the literature) are likely to fall into local optimum points, a Branch and Bound based heuristic, a hybrid Simulated Annealing and Genetic algorithm, a hybrid Tabu search and Simulated Annealing, a hybrid Genetic algorithm and Simulated Annealing, a hybrid Ant Colony Optimization and Simulated Annealing and a hybrid Multi-layer Perceptron and Simulated Annealing algorithms are developed. …”
Get full text
Get full text
Thesis
