Search Results - (( using optimization method algorithm ) OR ( problem representation using algorithm ))

Refine Results
  1. 1

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
  2. 2

    A review of crossover methods and problem representation of genetic algorithm in recent engineering applications by Zainuddin, Farah Ayiesya, Abd Samad, Md Fahmi

    Published 2020
    “…This paper reviews crossover methods and problem representation, e.g. in the form of binary coded and real coded representation, used by researchers in order to solve engineering operations. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Representation Of Rational Bézier Quadratics Using Genetic Algorithm, Differential Evolution And Particle Swarm Optimization by Yahya, Zainor Ridzuan

    Published 2013
    “…Alternatively, artificial intelligence techniques are widely used for optimization problem with shorter computation time. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

    Published 2023
    “…The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Vehicle routing problem using genetic algorithm / Shamini Nagaratnam by Shamini , Nagaratnam

    Published 2006
    “…This dissertation studies and explores the potential of using Genetic Algorithms to find the shortest path in Vehicle Routing Problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Crossover and mutation operators of real coded genetic algorithms for global optimization problems by Lim, Siew Mooi

    Published 2016
    “…The rationale behind developing algorithms using real encoding of chromosome representations is the limitations of binary encoding. …”
    Get full text
    Get full text
    Thesis
  8. 8

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…Vehicle routing problem is difficult to solve using exact methods especially for large size instances due to computational expensive. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Optimization of RFID network planning using MDB-FA method by Elewe, Adel Muhsin, Hasnan, Khalid, Nawawi, Azli

    Published 2017
    “…The generated data are utilized as an input representation to apply into firefly algorithm based on Density-Based Algorithm (DBSCAN) to find the optimal network solution. …”
    Get full text
    Get full text
    Article
  10. 10

    Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    Published 2009
    “…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

    Published 2022
    “…The experimentations of the proposed algorithm are conducted using existing benchmark instances and a published case study on an energy-efficient job-shop model. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Genetic algorithm based method for optimal location placement of flexible ac transmission system devices for voltage profile improvement by Karami, Mahdi

    Published 2011
    “…The basic structure of FACTS devices and their configuration is described. A heuristic method known as genetic algorithm is used to seek the optimum location and setting of these controllers where there are some works related to this case using various techniques. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…Particularly, swmcan addresses multi-view data noise using the l1-norm and optimizes the objective function through a novel iterative reweighted method. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…In this study, we propose an Optimised Crossover Genetic Algorithm (OCGA) for the problem. The objective is to find a schedule which minimises the maximum lateness of the jobs in the presence of the sequence independent family setup times.In brief, the proposed OCGA uses binary representation to encode the problem. …”
    Get full text
    Conference or Workshop Item
  15. 15

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

    Published 2022
    “…Next, it establishes the research problems by implementing various existing algorithms using comparative analysis. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

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

    Published 2022
    “…Next, it establishes the research problems by implementing various existing algorithms using comparative analysis. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    An Improved Grasshopper Optimization Algorithm Based Echo State Network for Predicting Faults in Airplane Engines by Bala, A., Ismail, I., Ibrahim, R., Sait, S.M., Oliva, D.

    Published 2020
    “…Metaheuristic algorithms are known to be excellent tools for solving optimization problems. …”
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    More on completion time algorithms for intermediate storage tanks in multiproduct batch process scheduling using matrix representation by Shafeeq , A., M.I., Abdul Mutalib, Amminudin , K.A., Muhammad , A.

    Published 2008
    “…In this work, new completion time algorithms for UIS and FIS transfer policies are proposed using matrix representation. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

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

    Published 2013
    “…This intractability is one of the reasons why the problem has been so widely studied. 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