Search Results - (( development time solution algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1
  2. 2

    Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm by Khoo, Thau Soon

    Published 2022
    “…It is difficult and challenging to develop an algorithm that can produce consistent near-optimal solutions even after many runs, average near-optimal solutions that have the least difference in magnitude, broader Pareto set, and iii achieve near-optimal solutions but highly sought after if it is commercially viable. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

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

    Published 2011
    “…This thesis describes the development of an efficient algorithm for solving nonlinear stochastic optimal control problems in discrete-time based on the principle of model-reality differences. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6
  7. 7

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

    Published 2018
    “…Later, an Iterative-based Sizing Algorithm (ISA) was developed to determine the optimal sizing solution which was later used as benchmark for sizing algorithms using optimization methods. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

    Published 2011
    “…In addition, one of the main challenges has been development of efficient algorithm for solving aforementioned model to find exact feasible optimal solution. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

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

    Published 2015
    “…Therefore, metaheuristic method based genetic algorithm has been developed to obtain feasible and optimal solution with less computation time. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Published 2019
    “…Solution offers by the algorithm has high accuracy and reliable. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…TSPs are known to be NP-hard problems[1] where an increase in the number of vehicles and destinations will significantly increase the computational time required to obtain an optimal solution. Existing works that utilized metaheuristic algorithms have shown their flexibility in solving multiple TSP variants and their capabilities in obtaining near-optimal solutions within a reasonable amount of time. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  15. 15

    Hardware Software Partitioning Using Particle Swarm Optimization (PSO) In Image Processing Application by Tan, Jia Zheng

    Published 2018
    “…The solution for C=681 use 49.7% of the total hardware resources in pure hardware and it is 1.09 times faster than pure hardware and 1.42 times faster than pure software. …”
    Get full text
    Get full text
    Monograph
  16. 16

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Improvement DACS3 Searching Performance using Local Search by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

    Published 2009
    “…The capability of DACS3 is measured based on quality of solution, time taken to reach the solution and algorithm performance. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Dynamic Economic Dispatch For Power System by Hussein, Saif Tahseen

    Published 2016
    “…The solution algorithm based on a constraint relaxation and period-by-period is developed and tested. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Development of an integrated scheduling model for handling equipment in automated port container terminals by Sadeghian, Syed Hamidreza

    Published 2014
    “…In addition, results proved that the modified meta-heuristic algorithm is able to find near optimal solutions and on average, the solutions found by the GA algorithm are only 0.2% worse than the optimal solutions and in the worst case in the test cases this difference is 2.3% which is acceptable. …”
    Get full text
    Get full text
    Thesis