Search Results - (( based selection problems algorithm ) OR ( using optimization path algorithm ))

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

“…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text

Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text

Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text

Adaptive route optimization for mobile robot navigation using evolutionary algorithm by Kit Guan Lim, Guan Lim, Yoong Hean Lee, Hean Lee, Min Keng Tan, Keng Tan, Hou, Pin Yoong, Tienlei, Wang, Tze, Kenneth Kin Teo

“…For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. …”
Get full text
Get full text
Get full text
Get full text

Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

“…Therefore, in this research, will be use Ant Colony Optimization (ACO) algorithm as an optimize technique that provide a shortest path of defining a successor that is their highest value of criteria. …”
Get full text
Get full text

Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
Get full text
Get full text

Systematic design of chemical reactors with multiple stages via multi-objective optimization approach by Mohd Fuad, Mohd Nazri, Hussain, Mohd Azlan

“…Following the identification of path-dependent design variables, several (possibly conflicting) design objectives will be selected and solutions of the corresponding problem will be generated from multi-objective optimization algorithm. …”
Get full text
Get full text

An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text

Solving vehicle routing problem by using improved genetic algorithm for optimal solution by Mohammed M.A., Abd Ghani M.K., Hamed R.I., Mostafa S.A., Ahmad M.S., Ibrahim D.A.

Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

“…Two case studies are used to evaluate those algorithms, and the camera placement problem is formulated as a coverage maximization problem. …”
Get full text
Get full text

Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”

Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”

Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text

Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

“…Job Shop Scheduling Problem (JSSP) is one of the well-known hard combinatorial scheduling problems and one of the most computationally difficult combinatorial optimization problems considered to date. …”
Get full text
Get full text
Get full text

Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…Lastly, a single-agent variant of SKF and a multi-objective SKF were introduced. SKF algorithms and its variants have been implemented in at least nine areas of applications: drill path optimization, airport gate allocation problem (AGAP), assembly sequence planning (ASP), system identification, feature selection, image template matching, controller tuning, wireless sensor network, and engineering design problem. …”
Get full text
Get full text
Get full text
Get full text

Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

“…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
Get full text
Get full text

Controller placement problem in the optimization of 5G based SDN and NFV architecture by Ibrahim, Abeer Abdalla Zakaria

“…A distributed 5G-SDN-NFV-based network architecture uses the controller placement problem (CPP) to manage controller placement and number. …”
Get full text
Get full text

Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

“…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
Get full text
Get full text

Development Of Generative Computer-Aided Process Planning System For Lathe Machining by Zubair, Ahmad Faiz

“…These parameters were then useful for tooling selections and tool-path planning. …”
Get full text
Get full text