Search Results - (( variable solution search algorithm ) OR ( java application optimization algorithm ))*

Refine Results
  1. 1

    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

    Published 2023
    “…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

    Published 2023
    “…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Sara, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

    Published 2023
    “…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Variable Neighbourhood Search Algorithm for Vehicle Routing Problem with Backhaul by Siaw Ying Doreen, Sek

    Published 2023
    “…It is one of the most popular solutions to solve a complex problem. Thus, a heuristic approach based on the Variable Neighbourhood Search (VNS) is proposed. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    An improved electromagnetism-like mechanism algorithm for the optimization of maximum power point tracking / Tan Jian Ding by Tan, Jian Ding

    Published 2017
    “…The Electromagnetism-Like Mechanism algorithm (EM) is a meta-heuristic algorithm designed to search for global optimum solutions using bounded variables. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem by Sze, Jeeu Fong, Salhi, S., Wassan, N.

    Published 2016
    “…In this paper, an adaptive variable neighbourhood search (AVNS) algorithm that incorporates large neighbourhood search (LNS) as a diversification strategy is proposed and applied to the capacitated vehicle routing problem. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

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

    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Electricity demand forecasting in Turkey and Indonesia using linear and nonlinear models based on real-value genetic algorithm and extended Nelder-Mead local search by Wahab, Musa

    Published 2014
    “…Hybrid genetic algorithm (GA) and Nelder-Mead local search mode 1 has been used to minimize demand estimation errors. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

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

    Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih by Ahmed Abuluaih, Saajid Akram

    Published 2019
    “…Therefore, most of the recent research in the field is devoted to improving the problem solvers that utilize search strategies and techniques. Since Constraint Satisfaction Problem (CSP) is an NP-complete problem, brute-force search algorithms such as Backtracking algorithm (BT) are required as the guarantee to find a solution, when there is one. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    The use of heuristic ordering and particle swarm optimization for nurse scheduling problem by Mohd Rasip, Norhayati

    Published 2017
    “…The comparison of the result of HOPSO, harmony search algorithm (HSA) and heuristic variable neighborhood search (HVNS) is presented. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A new algorithm for normal and large-scale optimization problems: Nomadic People Optimizer by Alsewari, Abdul Rahman Ahmed, Sinan, Q. Salih

    Published 2019
    “…The proposed and the benchmark algorithms are tested for large-scale optimization problems which are associated with high-dimensional variability. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

    Published 2022
    “…It is also used extensively in experiments to test the performances of metaheuristic algorithms and their hybrids. For example, Tabu Search (TS) has been successfully hybridized with other techniques, including particle swarm optimization (PSO) algorithm and the two-stage TS algorithm to solve MKP. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search by Ismail, Zuhaimy, Irhamah, Irhamah

    Published 2008
    “…Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities resulted…”
    Get full text
    Get full text
    Article