Search Results - (( based solving path algorithm ) OR ( sequence optimization based algorithm ))

An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

“…The proposed algorithm is found to provide better solutions with shorter paths when applied to TSP as compared to swap sequence based PSO. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

“…In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. …”
Get full text
Get full text

Path optimization using genetic algorithm in laser scanning system by Chen C.P., Koh S.P., Aris I.B., Albert F.Y.C., Tiong S.K.

“…In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. …”

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

“…Modification or enhancement is needed for continuous algorithm to solve combinatorial optimization problem. …”
Get full text
Get full text
Get full text
Get full text

Hybrid optimal path traceback system development for optimization DNA sequences alignment by Ahmad Sabri, Nur Dalilah

“…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
Get full text
Get full text

Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article by Ahmad Sabri, Nur Dalilah

“…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
Get full text
Get full text

Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

“…Genetic algorithm has recorded of huge success in solving NP-Complete optimization problems with similar nature to this problem. …”
Get full text
Get full text

DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization by Zulkifli, Md. Yusof, Muhammad Arif, Abdul Rahim, Sophan Wahyudi, Nawawi, Kamal, Khalil, Zuwairie, Ibrahim

“…Previously, direct-proportional length-based DNA computing which involved DNA sequences with different lengths has been implemented to solve the shortest path problem. …”
Get full text
Get full text
Get full text

Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

“…The ASH algorithm is basically applied with its probabilistic decision rule and pheromone feedback to construct the sequences of customers to be visited in the CVRP solution. …”
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

“…There were also attempts to hybridize SKF with other famous algorithms such as Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Sine Cosine Algorithm (SCA) to improve its performance. …”
Get full text
Get full text
Get full text
Get full text

Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

“…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
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

“…The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
Get full text
Get full text
Get full text

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

“…Although several extensions of the sampling-based algorithms have been proposed for solving each drawback, but the lack of a randomized planner that overcomes abovementioned inefficiencies in a single package is evident and makes the sampling-based path planning less effective for certain purposes. …”
Get full text
Get full text

Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

“…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
Get full text
Get full text
Get full text

Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

“…These algorithms can influence the convergence to find an efficient optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text

A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. …”
Get full text
Get full text
Get full text

Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

Product assembly and disassembly sequence optimization based on genetic algorithm and design for assembly methodologies by Yasin, Azman, Puteh, Nurnasran, Daud, Ruslizam

“…In this paper, an Artificial Intelligence (AI) technique, namely Genetic Algorithm (GA) is proposed to optimize product components assembly and disassembly sequences.The proposed methodology is developed and tested on an industrial product made of plastics with no integrated assembly and permanent joint parts.GA method is applied to determine the accuracy and optimum results based on 20 assembly and disassembly sequence solutions that was generated by the Design for Assembly methodology.The results indicated that GA based approach is able to obtain a near optimal solution for assembly and disassembly sequences.…”
Get full text
Get full text
Get full text