Search Results - (( developing future (problems OR problem) algorithm ) OR ( java implication _ algorithm ))

Refine Results
  1. 1

    Hybrid optimization approach to estimate random demand by Wahab, Musa, Ku-Mahamud, Ku Ruhana, Yasin, Azman

    Published 2012
    “…The main objective of this study is to develop a demand forecasting model that should reflect the characteristics of random demand patterns.To accomplish this goal, a hybrid algorithm combining a genetic algorithm and a local search algorithm method was developed to overcome premature convergence in local optima problems.The performance of the hybrid algorithm was compared with a single algorithm model in estimating parameter values that minimize objective function which was used to measure the goodness-of-fit between the observed data and simulated results.However, two problems had to be overcome in the forecasting random demand model. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Symbiotic organisms search optimization algorithm in cloud computing: a nature-inspired meta-heuristic by Sa'ad, Suleiman, Abdullah, Muhammed, Abdullah, Azizol, Ayob, Fahrul Hakim

    Published 2022
    “…This paper proposes to investigate symbiotic organisms search algorithms used in handling various optimisation problems in different fields to bring out strengths and weaknesses of the existing algorithms as well as to point out future directions for the upcoming studies in the domain. …”
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…We will develop the proposed OCGA to solve the problem of minimising the total (weighted) completion time as future work. …”
    Get full text
    Conference or Workshop Item
  5. 5

    A Survey of metaheuristic approaches for curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…The review of available approaches in solving CBCTT problem in this paper produces information that can be used for future development and experimentation such as number of instances that should be used, neighborhood structure(s) that can be applied and number of experiment repetitions.As stated by Wolpert & Macready (1997) that there is no unique ‘best’ algorithm which performs better than any other algorithm on every test problem (data instance), hence, this paper provides guidelines for future investigation on solving CBCTT problem using other metaheuristic techniques or approaches.…”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    A Model for Evaluation of Cryptography Algorithm on UUM Portal by Norliana, Abdul Majid

    Published 2004
    “…This project concludes by discussing problems and limitations that were encountered in completing this project, and offers a few recommendations for future development in this area.…”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Optimization of multi-holes drilling toolpath using tiki-taka algorithm by Norazlina, Abdul Rahman

    Published 2024
    “…The research methodology involves problem modeling, algorithm development, and validation. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…Next, the framework of QAPU was designed and developed. For this purpose, some gates and connections were projected in the framework which could be applied for future quantum algorithms. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Trend analysis of software engineering scientific publications by Tengku Nadzirah, Tengku Majani

    Published 2019
    “…The estimation of the future trend is done by development of the algorithm linear regression algorithm in Matlab. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  11. 11

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

    Published 2025
    “…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  12. 12

    Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

    Published 2008
    “…The Capacitated Arc Routing Problem (CARP) is a fundamental and well-known routing problem. …”
    Get full text
    Get full text
    Monograph
  13. 13

    Bio-inspired computation: Recent development on the modifications of the cuckoo search algorithm by Haruna, Chiroma, Herawan, Tutut, Iztok, Fister Jr, Iztok, Fister, Abdulkareem, Sameem, Shuib, Liyana, Mukhtar, Fatihu Hamza, Younes, Saadi, Abubakar, Adamu

    Published 2017
    “…Presently, the Cuckoo Search algorithm is attracting unprecedented attention from the research community and applications of the algorithm are expected to increase in number rapidly in the future. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408) by Woon, Siew Fang, Karim, Sharmila, Mohamad, Mohd Saiful Adli

    Published 2016
    “…Numerical results suggest that the proposed algorithm is efficient in solving large scale complex discrete optimization problems, thus could be extended into solving real life application mixed discrete optimization problem in the future…”
    Get full text
    Get full text
    Monograph
  15. 15

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…In addition, research has identified that the existing tools are not adequately designed to enable users to easily develop the LLH algorithms with the dynamic parameterization.In responding to this problem, this research investigates rapid mechanisms for the LLH design and development with easy, flexible and concise programming. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Modeling and optimization of cost-based hybrid flow shop scheduling problem using metaheuristics by Ullah, Wasif, Mohd Fadzil Faisae, Ab Rashid, Muhammad Ammar, Nik Mu’tasim

    Published 2023
    “…In the future, other optimization algorithms will be tested for the CHFS model, such as Teaching Learning Based Optimization (TLBO) and the Crayfish Optimization Algorithm (COA).…”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    The development of network error message alert retrieval for organizational intelligence system based on information retrieval techniques / Ahmad Syazwan Ahmad Zaki by Ahmad Zaki, Ahmad Syazwan

    Published 2015
    “…In order to overcome this problem, this dissertation will develop an algorithm for the top management to retrieve the important information using information retrieval techniques and method. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Job shop rescheduling using a hybrid artificial immune system and genetic algorithm model by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Yusof, Yuhanis, Mahmuddin, Massudi

    Published 2012
    “…This paper discusses on developing a hybrid model to tackle the problem of changing environment in the job shop scheduling problem.The main idea is to develop building blocks of partial schedules using the model developed that can be used to provide backup solutions when disturbances occur during production.This model hybridizes genetic algorithm (GA) with artificial immune systems (AIS) techniques to generate these partial schedules.Each partial schedule, also known as antibody, is assigned a fitness value for the selection of final population of best partial schedules. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION by Nor Akmal, Abdul Aziz

    Published 2005
    “…Am Colony Optimisation (ACO) was chosen to solve this problem. Specifically. this thesis is intended to develop a system that can display the shortest path by the used of two algorithm in ACO which were Ant System (AS) and Ant Colony System (ACS). …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD