Search Results - (( solution construction based algorithm ) OR ( parallel optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Tool path generation of contour parallel based on ant colony optimisation

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Minimizing machining airtime motion with an ant colony algorithm

    Minimizing machining airtime motion with an ant colony algorithm by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM

    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

    Published 2001
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…This paper investigates the construction phase approach in which the sequential order of the courses/lectures applied several combination of graph heuristics to generate a population of initial solutions in curriculum-based course timetabling (CBCTT).The construction of population of initial solution is a prerequisite in a population-based metaheuristic implementation. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization

    Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization by Kamal Z., Zamli, Alhadawi, Hussam S., Fakhrud Din, .

    Published 2023
    “…This paper introduces a new variant of a recent metaheuristic algorithm based on the Social Network Search algorithm (SNS), which is called the Roulette Wheel Social Network Search algorithm (SNS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors

    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

    Published 2008
    “…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
    thesis::doctoral thesis
    Save to List
    Saved in:
  9. 9
    Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem

    Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem by Tan, Li June, Joe H. Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

    Published 2020
    “…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Harmony annealing algorithm for curriculum-based course timetabling problem

    Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics

    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2016
    “…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Enhancing the Sorting Layers in the Initial Stage of High School Timetabling

    Enhancing the Sorting Layers in the Initial Stage of High School Timetabling by Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza

    Published 2020
    “…KHE is an algorithm that generates initial solution of HSTP. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    A sports tournament scheduling problem: Exploiting constraint-based algorithm and neighborhood search for the solution

    A sports tournament scheduling problem: Exploiting constraint-based algorithm and neighborhood search for the solution by Razamin, Ramli, Soong, Cai Juan, Haslinda, Ibrahim

    Published 2012
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Sequential Constructive Algorithm incorporate with Fuzzy Logic for Solving Real World Course Timetabling Problem

    Sequential Constructive Algorithm incorporate with Fuzzy Logic for Solving Real World Course Timetabling Problem by Tan, Li June, Joe Henry Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

    Published 2020
    “…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  15. 15
    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems

    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

    Published 2011
    “…In this work, a simplified model-based optimal control model with adjustable parameters is constructed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Constructing population of initial solutions for curriculum – based course timetabling problem

    Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Automated multi-agent negotiation framework for the construction domain

    Automated multi-agent negotiation framework for the construction domain by Mahmoud M.A., Ahmad M.S., Yusoff M.Z.M., Idrus A.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  18. 18
    An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179)

    An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179) by Ahmad, Nazihah, Ibrahim, Haslinda

    Published 2021
    “…As a result, the constructed algorithm has successfully demonstrated the solutions for the arbitrary FFSME, with minimum complexity of the fuzzy operations. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  19. 19
    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
    “…Moreover, the WCVRP solutions were improved by using PPA. Both models were tested on a WCVRP benchmark problem and a case-based scenario in Kubang Pasu, Kedah. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Development of a Negotiation Support Model for Value Management in Construction

    Development of a Negotiation Support Model for Value Management in Construction by UTOMO, CHRISTIONO

    Published 2009
    “…It consists of developing the appropriate research approach, methodology of negotiation and agent-based negotiation in VM. The research objectives are to find a theoretical basis and research approach for negotiation support methodology on VM, to develop a decision model for technical solution options in a satisfying function/cost preferences, to investigate negotiation style and outcome and analyze the correlation between them for the basis of scenarios on the agent system, to develop a model for agreement options and coalition algorithms on value-based decision, to validate the coalition algorithms and introduce an initial model of Negotiation Support for Value Management (NSVM). …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:

Search Tools: