Search Results - (( using selection path algorithm ) OR ( sequence optimisation based algorithm ))
Search alternatives:
- sequence optimisation »
- optimisation based »
- using selection »
- selection path »
- path algorithm »
-
1
Optimisation of energy efficient Assembly Sequence Planning using Moth-Flame Optimisation alghorithm
Published 2019“…For optimisation purpose, this research proposed a relatively new algorithm called the Moth-Flame Optimisation (MFO). …”
Get full text
Get full text
Thesis -
2
Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation
Published 2013“…The aim of this research is to establish a methodology and algorithm for integrating ASP and ALB optimisation using Particle Swarm Optimisation. …”
Get full text
Get full text
Thesis -
3
An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite
Published 2018“…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. In line with such a need, this paper presents a unified strategy based on the new meta-heuristic algorithm, called the elitist flower pollination algorithm (eFPA), for sequence and sequence-less coverage. …”
Get full text
Get full text
Get full text
Article -
4
Performance evaluation and benchmarking of an extended computational model of ant colony system for DNA sequence design
Published 2014“…In literature, ACS has been employed to solve DNA sequence design problem. The DNA sequence design problem was modelled based on a finite state machine in which the nodes represent the DNA bases {A, C, T, G}. …”
Get full text
Get full text
Get full text
Article -
5
An improved particle swarm optimization algorithm for data classification
Published 2023“…Particle Swarm Optimization (PSO) is a metaheuristic algorithm based on swarm intelligence, widely used to solve global optimisation problems throughout the real world. …”
Get full text
Get full text
Get full text
Article -
6
Linear-PSO with binary search algorithm for DNA Motif Discovery / Hazaruddin Harun
Published 2015“…Particle Swarm Optimisation (PSO) was selected as the base algorithm that needs improvement and integration with other techniques. …”
Get full text
Get full text
Book Section -
7
Automated path testing using the negative selection algorithm
Published 2017“…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
Get full text
Get full text
Indexed Article -
8
Meta-heuristic approaches for reservoir optimisation operation and investigation of climate change impact at Klang gate dam
Published 2023“…Consequently, seeking managing of reservoir optimisation operations had always been at the forefront and to improve managing, algorithms have had been presented over the past few decades, beginning with conventional algorithms, followed by heuristic algorithms, and finally, the meta-heuristic algorithms (MHAs). …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
9
Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun
Published 2015“…Particle Swarm Optimisation (PSG) was selected as the base algorithm that needs improvement and integration with other techniques. …”
Get full text
Get full text
Thesis -
10
A Study of the Contribution of Nearest-Neighbour Thermodynamic Parameters to the DNA Sequences Generated by Ant Colony Optimisation
Published 2013Get full text
Get full text
Conference or Workshop Item -
11
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
thesis::doctoral thesis -
12
Path planning for unmanned aerial vehicles using visibility line-based methods
Published 2011“…The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. …”
Get full text
Get full text
Thesis -
13
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
14
A novel Bezier curve control point search algorithm for autonomous navigation using N-order polynomial search with boundary conditions
Published 2021“…However, the Bezier curve is the most widely used in the curve fitting algorithm for vehicle path planning as it can generate a possible number of path maneuvers. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
15
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text
Thesis -
16
A Continuous Overlay Path Probing Algorithm For Overlay Networks
Published 2013“…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
Get full text
Get full text
Thesis -
17
Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization
Published 2015“…Here, in this paper, we propose a path planning with predetermined waypoints method using Particle Swarm Optimization (PSO) algorithm. …”
Get full text
Get full text
Get full text
Article -
18
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
Get full text
Get full text
Thesis -
19
Shortest Path Routing Using Heuristic Search
Published 2006“…In this project A* algorithm was used, to suggest shortest path model between two selected points to find the fastest and shortest route on Malaysia map. …”
Get full text
Get full text
Get full text
Thesis -
20
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
Get full text
Get full text
Get full text
Thesis
