Search Results - parallel process search algorithm*
Search alternatives:
- search »
-
1
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 -
2
Development of a heuristic procedure for balancing mixed-model parallel assembly line type II
Published 2010“…The main advantages of employing TS are using a flexible memory structure during the search process, and intensification and diversification strategies, which help to make a comprehensive search in the solution space. …”
Get full text
Get full text
Thesis -
3
Parallel metaheuristic algorithm for route planning using CUDA
Published 2025“…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
4
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 -
5
Parallel multiple tabu search for multiobjective Urban Transit Scheduling Problem
Published 2020“…A set covering model was then adopted to minimize the number of buses and drivers simultaneously. A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. …”
Get full text
Get full text
Article -
6
-
7
Integrated OBF-NN models with enhanced extrapolation capability for nonlinear systems
Published 2013Get full text
Get full text
Get full text
Citation Index Journal -
8
-
9
Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources
Published 2022“…The processing time and the number of required resources for each job rely on the machine that does the processing. …”
Get full text
Get full text
Get full text
Article -
10
Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures
Published 2020“…The first step lies at the modelling of parallel applications running on heterogeneous parallel computers. …”
Get full text
Get full text
Thesis -
11
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 -
12
Robust partitioning and indexing for iris biometric database based on local features
Published 2018“…Moreover, search within a group is achieved using a proposed half search algorithm. …”
Get full text
Get full text
Get full text
Article -
13
Accounting Information Systems Genetic Algorithms for All-Optical Shared Fiber-Delay-Line Packet Switches
Published 2009“…In the first algorithm, packet scheduling is formulated as a tree-searching problem. …”
Get full text
Get full text
Get full text
Article -
14
A bit-serial sum of absolute difference accelerator for variable block size motion estimation of H.264
Published 2009Get full text
Get full text
Conference or Workshop Item -
15
Process Planning Optimization In Reconfigurable Manufacturing Systems
Published 2008“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text
Thesis -
16
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 -
17
Fruit-Fly Based Searching Algorithm For Cooperative Swarming Robotic System
Published 2013“…A number of benchmark function processes were conducted to assess the performance of proposed FOA (Fly Optimisation Algorithm).…”
Get full text
Get full text
Thesis -
18
Optimal placement of static VAR compensator using genetic algorithms
Published 2008“…The existence of the multiple solutions in the optimal placement of reactive power in the power system typically often get stuck at the local optimum rather than at the global optimum. Genetic Algorithms (GAs) are stochastic searching algorithms that make the searching process jumps randomly from point to point, thus allowing escape from the local optimum, and search for many sub-optimum points in parallel.This paper presents an evolutionary computation algorithm for enhancing voltage stability. …”
Get full text
Get full text
Get full text
Article -
19
Single and Multiple variables control using Tree Physiology Optimization
Published 2017“…In the proposed method, each shoot from each branch search for possible solution in parallel and the fitness is evaluated based on all best values found by branch search. …”
Get full text
Get full text
Article -
20
An efficient indexing and retrieval of iris biometrics data using hybrid transform and firefly based K-means algorithm title
Published 2019“…Searches within a group can be done using a half-searching algorithm to improve the response time for data retrieval. …”
Get full text
Get full text
Thesis
