Search Results - (( using linear problem algorithm ) OR ( basic optimization path algorithm ))

Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text

Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

“…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text

Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

“…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
Get full text
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

“…It makes use of three basic operations in order to optimize this problem. …”
Get full text
Get full text

Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

“…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
Get full text
Get full text

Genetic algorithm optimization for coefficient of FFT processor by Pang, Jia Hong, Sulaiman, Nasri

Get full text
Get full text
Get full text

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text

Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

“…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
Get full text
Get full text
Get full text

Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

“…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
Get full text
Get full text

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

“…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
Get full text
Get full text

Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

“…The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%.…”
Get full text
Get full text
Get full text

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

“…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Comparison Between Linear Programming And Integer Linear Programming: A Review by Sam, Mei Lee, Saptari, Adi, Salleh, Mohd Rizal, Mohamad, Effendi

“…Three criteria were used to evaluate the characteristics: time complexity, problem size and computational time. …”
Get full text
Get full text
Get full text

Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

“…The performances obtained show that the optimized APFLC is better than the non-optimize APFLC in terms of RMSE and the settling time.…”
Get full text

Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Get full text

Genetic algorithm techniques for the design of nonlinear microwave circuits by Arsat, Rashidah

“…By using Sample Balance's differential of current linear and nonlinear equation as an objective function, a Genetic Algorithm routine then been constructed. …”
Get full text
Get full text
Get full text

Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

“…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
Get full text
Get full text

Using genetic algorithm for solving N-Queens problem by Turky A.M., Ahmad M.S.