Search Results - parallel solution ((using algorithm) OR (search algorithm))*

Refine Results
  1. 1
  2. 2

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…This research aims to significantly speed up solution searching for the TSP by using GPUs compared to CPUs. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm by Khoo, Thau Soon

    Published 2022
    “…Our algorithm uses non-fitness evolutionary distributed parallelized adaptive large neighbourhood search (NEDPALNS). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Accounting Information Systems Genetic Algorithms for All-Optical Shared Fiber-Delay-Line Packet Switches by Liew, S.Y., Wong, E.S.K.

    Published 2009
    “…In the first algorithm, packet scheduling is formulated as a tree-searching problem. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

    Published 2010
    “…Conclusion/Recommendations: The results obtained from intelligence based genetic algorithm were used as an initial point for fine-tuning by simulated annealing to increase the quality of solution. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…Meta-heuristic algorithms have widely used in HPAs due to their global optimization ability. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Optimal placement of static VAR compensator using genetic algorithms by Mustafa, Mohd. Wazir, Wong, Yan Chiew

    Published 2008
    “…Genetic Algorithms (GAs) are stochastic searching algorithms that make the searching process jumps randomly from point to point, thus allowing escape from the local optimum, and search for many sub-optimum points in parallel.This paper presents an evolutionary computation algorithm for enhancing voltage stability. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Single and Multiple variables control using Tree Physiology Optimization by Halim, A.H., Ismail, I.

    Published 2017
    “…In the proposed method, each shoot from each branch search for possible solution in parallel and the fitness is evaluated based on all best values found by branch search. …”
    Get full text
    Get full text
    Article
  11. 11

    Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

    Published 2004
    “…Based on the results of these simulations, we compared the number of iterations needed by each algorithm to arrive at the optimal solution and the CPU time taken for each algorithm to execute the search. …”
    Get full text
    Get full text
    Monograph
  12. 12
  13. 13
  14. 14
  15. 15

    Development of a multi-objective optimization model for transport and environment in a closed-loop automotive supply chain by Sadrnia, Abdolhossein

    Published 2014
    “…In the last stage, an extended Gravitational Search Algorithm (GSA) as a parallel search algorithm and high convergence rate into high quality final solutions is used to solve the proposed mathematical model and to achieve the Pareto set of solution. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Performance Comparison of Parallel Bees Algorithm on Rosenbrock Function by Hammash, Nayif Mohammed

    Published 2012
    “…It is a series of activities based on the searching algorithm in order to access the best solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things by Hadi, Ahmed Adnan

    Published 2022
    “…The reason for using variable length searching is its effectiveness in searching for high dimensional space and reducing the number of candidates' features. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Development of a heuristic procedure for balancing mixed-model parallel assembly line type II by Esmaeilian, Gholamreza

    Published 2010
    “…The main advantages of employing TS are using a flexible memory structure during the search process, and intensification and diversification strategies, which help to make a comprehensive search in the solution space. …”
    Get full text
    Get full text
    Thesis
  20. 20

    A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem by WATADA, J., ROY, A., LI, J., WANG, B., WANG, S.

    Published 2020
    “…In this model, the GA is used to handle the upper-level decision problem by choosing desirable solution candidates and passing them to the lower-level problem. …”
    Get full text
    Get full text
    Article