Search Results - (( pareto optimization based algorithm ) OR ( discrete optimization method algorithm ))

Refine Results
  1. 1

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…It is also discovered that the hybrid-discrete MOPSO (HD-MOPSO) algorithm manages to obtain higher values in the performance metrics consisting of non-dominance ratio and hypervolume compared to the competing algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Automated bilateral negotiation with incomplete information in the e-marketplace. by Jazayeriy, Hamid

    Published 2011
    “…The MGT algorithm is useful to explore the properties of the Pareto-optimal offers. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling by Shimailawi, Shatha Abdulhadi Muthana

    Published 2022
    “…The IEEE RTS 26, 32 and 36-unit dataset systems were used in the performance evaluation of the PACS algorithm. The performance of PACS algorithm was compared against four benchmark multi-objective algorithms including the Nondominated Sorting Genetic, Strength Pareto Evolutionary, Simulated Annealing, and Particle Swarm Optimization using the metrics grey relational grade (GRG), coverage, distance to Pareto front, Pareto spread, and number of non-dominated solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

    Published 2018
    “…Simulation results reveal the proposed algorithm’s ability to produce real and well-distributed Pareto optimum fronts for all considered multi-objective optimization cases. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. The proposed Discrete-PSO method (DPSO) uses a rescaling equation to convert the continuous-valued positions into discrete-valued variables. …”
    Get full text
    Get full text
    Research Reports
  7. 7

    Hybridization of Strength Pareto Multiobjective Optimization with Modified Cuckoo Search Algorithm for Rectangular Array by Abdul Rani, Khairul Najmi, Abdulmalek, Mohamed Fareq, Rahim, Hasliza, Siew Chin, Neoh, Abd Wahab, Alawiyah

    Published 2017
    “…In addition, the MCS algorithm is hybridized with the particle swarm optimization (PSO) and hill climbing (HC) stochastic techniques along with the standard strength Pareto evolutionary algorithm (SPEA) forming the MCSPSOSPEA and MCSHCSPEA, respectively.All the proposed MCS-based algorithms are examined to perform MO optimization on Zitzler–Deb–Thiele’s (ZDT’s) test functions. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

    Published 2024
    “…Hence, optimization algorithms, consisting of exact and heuristic methods, are crucial for a myriad of real-world applications. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Multi-objective spiral dynamic algorithms-based for a better accuracy and diversity by Ahmad Azwan, Abdul Razak

    Published 2019
    “…This thesis presents two variants of multi-objective type algorithms based on a Spiral Dynamic Algorithm (SDA) with application to optimize a Proportional-Derivative (PD) controller for an Inverted Pendulum System. …”
    Get full text
    Get full text
    Thesis
  10. 10

    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
    “…Several global methods have been proposed for solving discrete optimization problems. …”
    Get full text
    Get full text
    Monograph
  11. 11

    Pareto ensembles for evolutionary synthesis of Neurocontrollers in a 2D maze-based video game by Tse, Guan Tan, Jason Teo, Chin, Kim On, Patricia Anthony

    Published 2013
    “…In this paper, we present a study of evolving artificial neural network controllers for autonomously playing maze-based video game. A system using multi-objective evolutionary algorithm is developed, which is called as Pareto Archived Evolution Strategy Neural Network(PAESNet), with the attempt to find a set of Pareto optimal solutions by simultaneously optimizing two conflicting objectives. …”
    Get full text
    Get full text
    Article
  12. 12

    Solution of optimal power flow using non-dominated sorting multi-objective based hybrid firefly and particle swarm optimization algorithm by Abdullah Khan, Hizam, Hashim, Abdul Wahab, Noor Izzri, Othman, Mohammad Lutfi

    Published 2020
    “…Simulation results were also compared with non-dominated sorting based multi-objective particle swarm optimization (MOPSO) and different optimization algorithms reported in the current literature. …”
    Get full text
    Get full text
    Article
  13. 13

    Evolution of RF-signal cognition for wheeled mobile robots using pareto multi-objective optimization by Chin, Kim On, Teo, Jason Tze Wi

    Published 2009
    “…The elitist Pareto-frontier Differential Evolution (PDE) algorithm is used to generate the Pareto optimal set of ANNs that could optimize two objectives in a single run; (1) maximize the mobile robot homing behavior whilst (2) minimize the hidden neurons involved in the feed-forward ANN. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A modified discrete filled function algorithm for solving nonlinear discrete optimization problems by Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan

    Published 2012
    “…The discrete filled function method is a global optimization tool for searching for best solution amongst multiple local optima.This method has proven useful for solving large-scale discrete optimization problems.In this paper, we consider a standard discrete filled function algorithm in the literature and then propose a modification to increase its efficiency.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Pareto Ensembles for evolutionary Synthesis of Neurocontrollers in a 2D Maze-based video game by Tse, Guan Tan, Jason Teo, Kim, On Chin, Patricia Anthony

    Published 2013
    “…In this paper, we present a study of evolving artificial neural network controllers for autonomously playing maze-based video game. A system using multi-objective evolutionary algorithm is developed, which is called as Pareto Archived Evolution Strategy Neural Network(PAESNet), with the attempt to find a set of Pareto optimal solutions by simultaneously optimizing two conflicting objectives. …”
    Get full text
    Get full text
    Article
  16. 16

    A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks / Salmah Fattah by Salmah , Fattah

    Published 2022
    “…The results obtained are then analysed to assess the proposed solution’s performance in obtaining each deployment objective’s optimal value. Finally, the proposed algorithm’s effectiveness regarding node coverage, energy consumption, Pareto-optimal value, and algorithm execution time is validated using three Pareto-optimal metrics: including inverted generation distance (IGD), hypervolume, and diversity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks by Salmah Fattah

    Published 2022
    “…The results obtained are then analysed to assess the proposed solution's performance in obtaining each deployment objective's optimal value. Finally, the proposed algorithm's effectiveness regarding node coverage, energy consumption, Pareto-optimal value, and algorithm execution time is validated using three Pareto-optimal metrics: including inverted generation distance (IGD), hypervolume, and diversity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    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
    “…From the research results, it can be seen that in genetic algorithms, resetting the population after reaching precocity can maintain the optimization characteristics of the population and have a high probability of obtaining Pareto solutions. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Multi-objective clustering algorithm using particle swarm optimization with crowding distance (MCPSO-CD) by Rashed, Alwatben Batoul, Hamdan, Hazlina, Mohd Sharef, Nurfadhlina, Sulaiman, Md Nasir, Yaakob, Razali, Abubakar, Mansir

    Published 2020
    “…In an attempt to address this problem, the clustering-based method that utilizes crowding distance (CD) technique to balance the optimality of the objectives in Pareto optimal solution search is proposed. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

    Published 2009
    “…These problems are known as discrete-valued optimal control problems. Most practical discrete-valued optimal control problems have multiple local minima and thus require global optimization methods to generate practically useful solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis