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

Refine Results
  1. 1

    Development of a motion planning and obstacle avoidance algorithm using adaptive neuro fuzzy inference system for mobile robot navigation by Muslim, Farah Kamil Abid

    Published 2017
    “…The present algorithm exhibits attractive features such as high optimality, high stability, low running cost and zero failure rates. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…Therefore, the implementation ofGA in path optimization can be ascertained offering a compelling result.…”
    Get full text
    Get full text
    Final Year Project
  3. 3

    Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

    Published 2008
    “…In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4
  5. 5

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…Finally, an adaptive neuro-fuzzy inference system (ANFIS) was designed which constructs and optimizes a fuzzy logic controller using a given dataset of input/output variables in order to increase the optimality and stability rates of the proposed path planning algorithm. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Systematic design of chemical reactors with multiple stages via multi-objective optimization approach by Mohd Fuad, Mohd Nazri, Hussain, Mohd Azlan

    Published 2015
    “…Following the identification of path-dependent design variables, several (possibly conflicting) design objectives will be selected and solutions of the corresponding problem will be generated from multi-objective optimization algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8

    A multi-objective parametric algorithm for sensor-based navigation in uncharted terrains by Khaksar W., Sahari K.S.M.

    Published 2023
    “…However, these approaches only focus on one single objective, i.e. path optimality, path safety, efficiency or trajectory smoothness. …”
    Article
  9. 9

    Literature Review of Optimization Techniques for Chatter Suppression In Machining by A. R., Yusoff, Mohamed Reza Zalani, Mohamed Suffian, Mohd Yusof, Taib

    Published 2011
    “…In this paper, it can be observed that for chatter suppression, optimization focuses on spindle design, tool path, cutting process, and variable pitch. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…Here, a routing tree is constructed based on the energy/bit minimization routing (EbMR). This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.…”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Resource Efficient For Hybrid Fiber-Wireless Communications Links In Access Networks With Multi Response Optimization Algorithm by Wong, Adam Yoon Khang, Indra, Win Adiyansyah, Jamil Alsayaydeh, Jamil Abedalrahim, Mohamat Gani, Johar Akbar, M. Idrus, Sevia, Pusppanathan, Jaysuman

    Published 2021
    “…This work proposes a Multi response Optimization (MO) algorithm, named MO-LMMHOWAN that apply in Last Mile Mobile Hybrid Optical Wireless Access Network (LMMHOWAN). …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

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

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

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

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

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

    Network reconfiguration and DG sizing incorporating optimal switching sequence for system improvement / Ola Subhi Waheed Badran by Ola Subhi , Waheed Badran

    Published 2018
    “…This research presents the optimal switching sequence path to minimize power losses during the network switching operation. …”
    Get full text
    Get full text
    Get full text
    Thesis