Search Results - (( total solution based algorithm ) OR ( java implications force algorithm ))

Search alternatives:

Refine Results
  1. 1
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…This research finds the location of facilities in a continuous space to meet the demand of customers which minimize the total cost using Enhanced Cell-based Algorithm (ECBA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Multi-population Genetic Algorithm for Rich Vehicle Routing Problems

    Multi-population Genetic Algorithm for Rich Vehicle Routing Problems by Agany Manyiel, Joseph Mabor

    Published 2020
    “…MPGA-RVRP is applied in RVRP with three objectives:- total route distance, total route duration and total route cost. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  4. 4
    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation

    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

    Published 2022
    “…The proposed algorithm is simulated for simultaneous OPF-based conflicting objectives, respectively. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Genetic Algorithm gives a pool of solutions rather than just one. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  6. 6
    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions

    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions by Nur Azriati, Mat

    Published 2023
    “…The results revealed that a single landfill site (Candidate 4) was the best solution for the case-based scenario, with a 6.74% reduction in total distance travelled. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Dynamic Economic Dispatch For Power System

    Dynamic Economic Dispatch For Power System by Hussein, Saif Tahseen

    Published 2016
    “…The solution algorithm based on a constraint relaxation and period-by-period is developed and tested. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Minimizing the total cost of inventory by using artificial bee colony algorithm / Nurul Syakira Mohd Zin

    Minimizing the total cost of inventory by using artificial bee colony algorithm / Nurul Syakira Mohd Zin by Mohd Zin, Nurul Syakira

    Published 2022
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  9. 9
    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line

    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
    “…As the total objective values in most of problems could not be improved by simulated algorithm, it proved the well performing of proposed intelligence based genetic algorithm in reaching the near optimal solutions.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Development of a multi-objective optimization model for transport and environment in a closed-loop automotive supply chain

    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
    Save to List
    Saved in:
  11. 11
    Network reconfiguration and control for loss reduction using genetic algorithm

    Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

    Published 2010
    “…The network reconfiguration problem is formulated as single objective optimization problem with equality and inequality constraints. The proposed solution to this problem is based on a general combinatorial optimization algorithm known as Genetic Algorithm, and the load flow equations in distribution network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Development of cell formation algorithm and model for cellular manufacturing system

    Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

    Published 2011
    “…Therefore, for this proposes good benchmarked algorithm, bacteria foraging algorithm is selected and developed to solve multiobjective cell formation model and traced constraints satisfaction handling to produce feasible optimal solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  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 reduction.

    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
    “…For all the optimisation work carried out in this study, the objective function was primarily to minimise the total system losses. Lastly, the effectiveness of WOA and WOA-AIS in attaining optimal solutions was validated with other well-known optimisation algorithms, including particle swarm optimisation (PSO) and firefly algorithm (FA). …”
    text::Thesis
    Save to List
    Saved in:
  14. 14
    Variable Neighbourhood Search Algorithm for Vehicle Routing Problem with Backhaul

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

    Published 2023
    “…Past literature showed that heuristic-based solutions could offer feasible solutions that are approximately accurate to the exact solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment

    NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment by Shen, jiazheng, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan, Wang, Xinming

    Published 2024
    “…By comparing the total distance and maximum deviation of multiple robot systems, it is proven that this algorithm can effectively balance the path length of each robot in task allocation. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Nor Zuliiziati Md Jani

    Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Nor Zuliiziati Md Jani by Md Jani, Nor Zuliiziati

    Published 2021
    “…The aim of this research is to determine the flow of the shipment based on volume and to determine the total cost based on the flow of shipment by using Artificial Bee Colony (ABC) algorithm. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  20. 20
    Hybrid flow shop scheduling problem with energy utilization using non-dominated sorting genetic algorithm-III (NSGA-III) optimization

    Hybrid flow shop scheduling problem with energy utilization using non-dominated sorting genetic algorithm-III (NSGA-III) optimization by Muhammad Ammar, Nik Mu’tasim, Mohd Fadzil Faisae, Ab Rashid

    Published 2023
    “…The model was compared with the most sought algorithm and latest multi-objective algorithms, Strength Pareto Evolutionary Algorithm 2 (SPEA -II), Multi-Objective Algorithm Particle Swarm Optimization (MOPSO), Pareto Envelope-based Selection Algorithm II (PESA-II) and Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: