Search Results - (( found allocation problem algorithm ) OR ( java application optimized algorithm ))

Refine Results
  1. 1

    Tackling the berth allocation problem via harmony search algorithm by Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura

    Published 2024
    “…Berth Allocation Problem (BAP) is a renowned difficult combinatorial optimization problem that plays a crucial role in maritime transportation systems. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Meta-scheduler in Grid environment with multiple objectives by using genetic algorithm by Lorpunmanee, Siriluck, Sap, M.N.M, Abdullah, Abdul Hanan, Srinoy, Surat

    Published 2006
    “…The minimization is proposed by using a multiple objective genetic algorithm (GA), because the job scheduling problem is NP-hard problem. …”
    Get full text
    Article
  5. 5

    Development of multi-objective Chaotic Immune Symbiotic Organisms Search (CISOS) algorithm for facts device installation in voltage security control / Mohamad Khairuzzaman Mohamad... by Mohamad Zamani, Mohamad Khairuzzaman

    Published 2019
    “…The proposed CISOS algorithm is subsequently employed to solve the allocation of Flexible AC Transmission System (FACTS) devices for the purpose of multi-objective voltage security problem. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  7. 7

    Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: a dynamic forward approach by Delgoshaei, Aidin, Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah

    Published 2016
    “…The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9
  10. 10

    Optimum tie switches allocation and DG placement based on maximisation of system loadability using discrete artificial bee colony algorithm by Aman, M.M., Jasmon, G.B., Mokhlis, Hazlie, Bakar, Ab Halim Abu

    Published 2016
    “…The obtained results show that with simultaneous optimum DG placement and optimum tie-switch allocation, better results are achieved rather than solving two problems independently. …”
    Get full text
    Get full text
    Article
  11. 11

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…Examination timetabling is one type of scheduling problems faced by academic institutions when allocating examinations into a limited number of time slots and/or rooms. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Modelling of optimal placement and sizing of battery energy storage system using hybrid whale optimization algorithm and artificial immune system for total system losses reduct... by Wong Ling Ai

    Published 2023
    “…Besides, an optimization algorithm with high efficiency is important to ensure the attainment of optimal solutions, where the optimization algorithms like genetic algorithm and particle swarm optimization are known to have high possibility of being trapped in local optimal points. …”
    text::Thesis
  14. 14

    Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai by Annamalai, Muthukkaruppan

    Published 2001
    “…This paper studies a special kind of Constraint Satisfaction Problem (CSP) related to a case of resource allocation. …”
    Get full text
    Get full text
    Article
  15. 15

    Tourist Trip Design Problem with user preference and popularity: a case study of Langkawi Island / Nabilah Anuar Ahmad and Huda Zuhrah Ab. Halim by Anuar Ahmad, Nabilah, Ab. Halim, Huda Zuhrah

    Published 2023
    “…This study proposed enhancement in the greedy algorithm approach (Benjamin et al., 2019). A greedy algorithm solves a problem that selects the most appropriate option based on the current situation. …”
    Get full text
    Get full text
    Book Section
  16. 16

    Firefly analytical hierarchy algorithm for optimal allocation and sizing of distributed generation in radial distribution network by Bujal, Noor Ropidah

    Published 2022
    “…The results showed that the Firefly Algorithm (FA) performs much better for the optimal allocation and sizing of DG compared to the other metaheuristic techniques, particularly based on convergence characteristics and standard deviation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Evaluating the effectiveness of integrated benders decomposition algorithm and epsilon constraint method for multi-objective facility location problem under demand uncertainty by Rahimi, Iman, Tang, Sai Hong, Ahmadi, Abdollah, Ahmad, Siti Azfanizam, Lee, Lai Soon, Sharaf, Adel M.

    Published 2017
    “…One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. …”
    Get full text
    Get full text
    Get full text
    Article