Search Results - (( java implementation path algorithm ) OR ( based optimization window algorithm ))

Refine Results
  1. 1

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  2. 2

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  5. 5

    Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

    Published 2014
    “…This paper proposes an optimal method to suppress the noise with high density properly based on a nonlinear filter and decision-based approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Simulation for dynamic patients scheduling based on many objective optimization and coordinator by Mahmed, Ali Nader, Mohd Nizam, Mohmad Kahar

    Published 2024
    “…Taking both aspects, optimization and dynamic utilization, we propose a simulation for dynamic patient scheduling based on multi-objective optimization, window, and coordinator. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

    Published 2022
    “…The second part proposes an optimized flexible window-overlapping scheduling (OFWOS) algorithm that optimizes the offset difference ( ) between the samepriority TT windows in the adjacent nodes. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Enhanced local disparity map algorithm segment-side window-based cost aggregation and refinement by Kadmin, Ahmad Fauzan, Al-Asbahi, Monther Yousef Abdulwasea Mohammed, Hamzah, Rostam Affendi, A Aziz, Khairul Azha, Zainal, Nasharuddin, Jazlan, Nabil Jazli

    Published 2025
    “…This paper introduces a Segment-Side Window based (SSW) stereo matching algorithm that combines Truncated Absolute Difference (TAD), Gradient Magnitude (GM), and Census Transform (CT) to build a robust cost volume. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

    Published 2016
    “…This signifies that the training was successful based on the fitted values of the window size. Thus the proposed model trained with the CS algorithm provides a high convergence rate to the true global minimum and a better optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

    Published 2024
    “…Further more, an improved non-dominated sorting genetic algorithm with an elite strategy II (IMNSGA-II) has been developed to solve the two bi-objective models, surpassing existing literature’s algorithms such as Pareto Envelope-based Selection Algorithm II (PESA-II) and NSGA-II. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Second, propose an Optimized Time Sliding Window based Three Colour Marker. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Local Stereo Matching Algorithm Using Small-Color Census Spared Adaptive Support Weight by Nayan, M Yunus

    Published 2011
    “…This work is still on process, to test the algorithm; it will use the Middlebury benchmark. According to analysis of each step of the algorithms, the proposed SCCADSW can achieve good performance among stereo methods that rely on local optimization…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks by Shalghum, Khaled M., Noordin, Nor K., Sali, Aduwati, Hashim, Fazirulhisyam

    Published 2022
    “…In this paper, a worst-case end-to-end delay (WCD) for AVB traffic under overlapping-based TT windows (AVB-OBTTW) algorithm is proposed. …”
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    QTCP: an optimized and improved congestion control algorithm of high-speed TCP networks by Qureshi, Barkatullah, Othman, Mohamed, K. Subramaniam, Shamala, Abdul Hamid, Nor Asilah Wati

    Published 2011
    “…To overcome these problems Quick Transport Control Protocol (QTCP) algorithm based on optimizations of HS-TCP slow start algorithm and Additive Increase and Multiplicative Decrease (AIMD) algorithm have been proposed. …”
    Get full text
    Get full text
    Conference or Workshop Item