Search Results - optimal ((window algorithm) OR (_ algorithm))

Search alternatives:

Refine Results
  1. 1

    Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

    Published 2016
    “…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
    Get full text
    Get full text
    Get full text
    Article
  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

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

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

    Published 2022
    “…The proposed algorithm was evaluated using benchmark datasets comprising 56 VRPTW instances and 56 Pickup and Delivery Problems with Time Windows (PDPTW). …”
    Get full text
    Get full text
    Thesis
  8. 8

    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 size of window guarantees the image saving with more details and avoiding the image blurring. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

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

    Published 2024
    “…Given the NP-Hard nature of the three models proposed in this thesis, two metaheuristic algorithms have been developed. A hybrid Particle Swarm Optimization-Bacterial Foraging Algorithm is developed for solving the single objective LIRP model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

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

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

    Published 2024
    “…Finally, the role of the coordinator is to select a subset of patients from the window and pass them to the optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

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

    Published 2019
    “…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Design of intelligent Qira’at identification algorithm by Kamarudin, Noraziahtulhidayu

    Published 2017
    “…The process of the SPAP Algorithm is to extend parameters of the Affine Projection Block with two different selections of windowing length that affect the final accuracy on pattern classification. …”
    Get full text
    Get full text
    Thesis
  15. 15

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

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

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

    Optimized processing of satellite signal via evolutionary search algorithm by Hassan, Azmi, Othman, Rusli, Tang, Kieh Ming

    Published 2000
    “…This will take away the constraint resulted from the AS policy in processing the GPS satellites signal. The algorithm also shows its robustness because it does not require a good initial starting point. …”
    Get full text
    Get full text
    Article
  20. 20

    Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

    Published 2023
    “…In any metaheuristic, the parameter values strongly affect the efficiency of an algorithm’s search. This research aims to find the optimal parameter values for the Pareto Ant Colony System (PACS) algorithm, which is used to obtain solutions for the generator maintenance scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Article