Search Results - (( parallel distribution impact algorithm ) OR ( using optimization window algorithm ))

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

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

    Published 2022
    “…Our algorithm uses non-fitness evolutionary distributed parallelized adaptive large neighbourhood search (NEDPALNS). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  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

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

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

    Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S., Al-Jumaily A.

    Published 2025
    “…Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout's distributed machine-learning environment. …”
    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
    “…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
  9. 9

    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
    “…Detection is provided by using statistical analysis in each window, then the appropriate replacement for the noisy pixel is conducted from given values inside the current window or adjacent reconstructed pixels based on mean calculation and also, for very high density of noise which density of noise is bigger than 80%, the reconstruction is based on a recursive approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
  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
  12. 12

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

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

    Published 2024
    “…This thesis also aims to solve the low-carbon LIRP model with uncertainty factors such as carbon trading, customer demand, shortages, and soft time windows using advanced algorithms. Three LIRP models involving multiple distribution centers and periods are proposed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

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

    Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN) by Shalghum, Khaled M., Noordin, Nor Kamariah, Sali, Aduwati, Hashim, Fazirulhisyam

    Published 2021
    “…Accordingly, more relaxed scheduling algorithms are required. In this paper, we introduce the flexible window-overlapping scheduling (FWOS) algorithm that optimizes the overlapping among TT windows by three different metrics: the priority of overlapping, the position of overlapping, and the overlapping ratio (OR). …”
    Get full text
    Get full text
    Article
  16. 16

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

    Published 2017
    “…Clean audio signals from AEC are used with proposed feature selection technique called as X-Ant Colony Optimization, that utilizes the concept of Ant Colony Optimization, and can enhance feature extraction. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Published 2011
    “…To derive support weights, Manhattan distances are used for all pixels of the support window to the window’s center point. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  19. 19
  20. 20