Search Results - (( simulation optimization problems algorithm ) OR ( user optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Particle swarm optimization (PSO) for CNC route problem

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

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  2. 2
    Providing wireless coverage in massively crowded events using UAVs

    Providing wireless coverage in massively crowded events using UAVs by Sawalmeh A., Othman N.S., Shakhatreh H., Khreishah A.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  3. 3
    The Effect of Rainfall on the UAV Placement for 5G Spectrum in Malaysia

    The Effect of Rainfall on the UAV Placement for 5G Spectrum in Malaysia by Shalaby A.M., Othman N.S.

    Published 2023
    “…The problem is solved by invoking two algorithms, namely Particle Swarm Optimization (PSO) and Gradient Descent (GD) algorithms. …”
    Article
    Save to List
    Saved in:
  4. 4
    Efficient relay placement algorithm using landscape aware routing (erpalar)

    Efficient relay placement algorithm using landscape aware routing (erpalar) by Onabajo, Olawale Olusegun

    Published 2011
    “…ERP ALAR was implemented in Matlab R2009a using Genetic Algorithm (GA) with multi-objectives. GA is an optimization algorithm that simulates natural selection process as found in nature. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    State-Aware re-configuration model for multi-radio wireless Mesh Networks

    State-Aware re-configuration model for multi-radio wireless Mesh Networks by Zakaria, Omar, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Khalifa, Othman Omran, Azram, Mohammad, Goudarzi, Shidrokh, Jivanadham, Lalitha Bhavani, Zareei, Mahdi

    Published 2017
    “…Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine

    Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine by Jalaluddin, Mohammad Fariduddin, Kamaru-Zaman, Ezzatul Akmal, Abdul Rahman, Shuzlina, Mutalib, Sofianita

    Published 2017
    “…This study developed Courier Delivery Services Visualisor (CDSV) that is able to visualize the best route to be taken by distributor, so that the courier service can arrive on time.CDSV employed Genetic Algorithm (GA) and Astar Algorithm (A*) that integrates with Geographical Information System (GIS) data.A graphical user interface in the form of simulation map that suggests the best route and the optimal distance are displayed for easier courier service distribution references.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Efficient deployment of multi-uavs in massively crowded events�

    Efficient deployment of multi-uavs in massively crowded events� by Sawalmeh A., Othman N.S., Shakhatreh H.

    Published 2023
    Article
    Save to List
    Saved in:
  8. 8
    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Ant colony optimization (ACO) algorithm for CNC route problem

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…The GUT will be display the shortest path that should be taken by user and give user authority to manipulate the coordinate based on the requirement.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  11. 11
    An efficient virtual tour : a merging of path planning and optimization

    An efficient virtual tour : a merging of path planning and optimization by Abd Latiff, Muhammad Shafie, Hassan, Rohayanti

    Published 2004
    “…This paper describes the result of a research project aimed to integrate a path-planning optimization-algorithm and produce an efficient tour in a virtual environment. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…Another type of algorithm is called numerical algorithms. These algorithms were built specifically to address numerical optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Shortest Path Routing Using Heuristic Search

    Shortest Path Routing Using Heuristic Search by Alaiwan, Ahmed Omran A.

    Published 2006
    “…To achieve the best path, there are many algorithms which are more or less effective, depending on the particular case. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization

    Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization by Yusof, T. S. T., Toha, Siti Fauziah, Md. Yusof, Hazlina

    Published 2015
    “…Here, in this paper, we propose a path planning with predetermined waypoints method using Particle Swarm Optimization (PSO) algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm

    Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm by Zuwairie, Ibrahim, Nor Hidayati, Abd Aziz, Nor Azlina, Ab. Aziz, Saifudin, Razali, Mohd Saberi, Mohamad

    Published 2016
    “…To evaluate the performance of the Simulated Kalman Filter algorithm, it is applied to 30 benchmark functions of CEC 2014 for real-parameter single objective optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems

    Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems by Zulkifli, Md. Yusof, Zuwairie, Ibrahim, Ismail, Ibrahim, Kamil Zakwan, Mohd Azmi, Nor Azlina, Ab. Aziz, Nor Hidayati, Abd. Aziz, Mohd Saberi, Mohamad

    Published 2016
    “…However, the SKF is only capable to solve continuous numerical optimization problem. In order to solve discrete optimization problems, the SKF algorithm is combined with an angle modulated approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    AUTOMATIC ROUTE FINDER FOR NEW VISITORS

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…This project proposes a new visitor route model that is based on shortest path algorithms for road networks. Shortest path problems are among the best studied network flow optimization problems, with interesting applications in a range of fields. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  19. 19
    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems

    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Asrul, Adam, Kamil Zakwan, Mohd Azmi, Tasiransurini, Ab Rahman, Badaruddin, Muhammad, Nor Azlina, Ab. Aziz, Norrima, Mokhtar, Mohd Ibrahim, Shapiai, Mohd Saberi, Mohamad

    Published 2018
    “…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Robotic path planning using rapidly-exploring random trees

    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
    Save to List
    Saved in:

Search Tools: