Search Results - (( using evolution approach algorithm ) OR ( basic optimization path algorithm ))

Refine Results
  1. 1

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

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

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

    Published 1997
    “…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
    Thesis
  3. 3

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

    Published 2002
    “…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
    Undergraduates Project Papers
  4. 4

    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

    Published 2021
    “…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
    Article
  5. 5
  6. 6

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

    Published 2013
    “…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
    Thesis
  7. 7

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

    Published 2020
    “…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
    Thesis
  8. 8
  9. 9

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

    Published 2018
    “…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
    Thesis
  10. 10

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

    Published 2013
    “…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
    Thesis
  11. 11

    Multi-Objectives Memetic Discrete Differential Evolution Algorithm for Solving the Container Pre-Marshalling Problem by Mustafa, Hossam M. J., Ayob, Masri, Ahmad Nazri, Mohd Zakree, Abu-Taleb, Sawsan

    Published 2019
    “…This demonstrates that using the multi-objectives approach with a combination of the Discrete Differential Evolution mutation and the Memetic Algorithm evolutionary is a suitable approach for solving multi-objectives CPMP.…”
    Get full text
    Get full text
    Article
  12. 12
  13. 13

    A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem by Asaad Shakir, Hameed, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon

    Published 2020
    “…The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

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

    Published 2008
    “…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
    Citation Index Journal
  15. 15

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

    Published 2013
    “…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
    Thesis
  16. 16
  17. 17
  18. 18

    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

    Published 2021
    “…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
    Article
  19. 19

    Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

    Published 2020
    “…The proposed algorithm has been evaluated using 24 benchmark functions. …”
    Get full text
    Get full text
    Article
  20. 20

    Multiobjective optimization of bioethanol production via hydrolysis using hopfield- enhanced differential evolution by Ganesan, T., Elamvazuthi, I., Shaari, K.Z.K., Vasant, P.

    Published 2014
    “…In this chapter, the weighted sum scalarization approach is used in conjunction with three meta-heuristic algorithms: Differential Evolution (DE), Hopfield-Enhanced Differential Evolution (HEDE), and Gravitational Search Algorithm (GSA). …”
    Get full text
    Get full text
    Book