Search Results - (( pareto optimization _ 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

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

    Enhanced Micro Genetic Algorithm-Based Models For Multi-Objective Optimization by Tan, Choo Jun

    Published 2014
    “…As such, a set of alternative solutions that is able to satisfy all objectives with respect to the Pareto optimality principle is desired. Besides that, the quality of good MOP solutions needs to strike a balance between convergence and diversity against the true Pareto front (i.e. distribution of the ideal Pareto optimal solutions). …”
    Get full text
    Get full text
    Thesis
  5. 5

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

    Pareto-optimal algorithm in bilateral automated negotiation by Jazayeriy, Hamid, Azmi Murad, Masrah Azrifah, Sulaiman, Md. Nasir, Udzir, Nur Izura

    Published 2011
    “…In this paper we present a Pareto-optimal algorithm in bilateral automated negotiation where the negotiation is modeled by "split the pie" game and alternating-offer protocol. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

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

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

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

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

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Mine blast algorithm for optimization of truss structures with discrete variables by Sadollah, Ali, Bahreininejad, A., Eskandar, Hadi, Abd Shukor, Mohd Hamdi

    Published 2012
    “…In this study a novel optimization method is presented, the so called mine blast algorithm (MBA). …”
    Get full text
    Article
  15. 15
  16. 16
  17. 17

    Optimizing Decentralized Exam Timetabling with a Discrete Whale Optimization Algorithm by Emily Siew, Sing Kiang, Sze, San Nah, Goh, Say Leng

    Published 2025
    “…In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Optimizing decentralized exam timetabling with a discrete whale optimization algorithm by Emily Sing Kiang Siew, San nah sze, Say leng goh

    Published 2025
    “…—In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Multiple scenarios multi-objective salp swarm optimization for sizing of standalone photovoltaic system by Ridha, Hussein Mohammed, Gomes, Chandima, Hizam, Hashim, Mirjalili, Seyedali

    Published 2020
    “…The paper presents a new multiple scenario multi-objective salp swarm optimization (MS-MOSS) algorithm to optimally size a standalone PV system. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    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