Search Results - (( using optimization means 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

    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
  3. 3

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

    Published 2021
    “…In order to improve the final solutions of a single created tour, The employee bees’ movement radius has been limited, because of avoidance of long random jump between nodes. To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    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
  5. 5

    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
  6. 6

    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
  7. 7
  8. 8

    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
  9. 9

    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
  10. 10

    SNR-Based OLSR Routing Protocol for Wireless Mesh Networks by Elobaid, Mohamed Elshaikh

    Published 2009
    “…Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    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
  13. 13

    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
  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

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Clustering technique is able to find hidden patterns and to extract useful information from huge data. Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A near-optimal centroids initialization in K-means algorithm using bees algorithm by Mahmuddin, Massudi, Yusof, Yuhanis

    Published 2009
    “…The K-mean algorithm is one of the popular clustering techniques.The algorithm requires user to state and initialize centroid values of each group in advance. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Optimization of modified Bouc–Wen model for magnetorheological damper using modified cuckoo search algorithm by Rosmazi, Rosli, Zamri, Mohamed

    Published 2021
    “…A comparison was done against particle swarm optimization, genetic algorithm, and sine–cosine algorithm, where the modified cuckoo search algorithm showed the lowest root mean square error and fastest convergence rate among the three algorithms.…”
    Get full text
    Get full text
    Get full text
    Article