Search Results - (( problem based window algorithm ) OR ( java application optimized 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

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

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  6. 6

    Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…We also have a driver rest period.The problem is solved heuristically.A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

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

    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 first part introduces a flexible window-overlapping scheduling (FWOS) algorithm that allows the TT windows to overlap in GCL implementations. …”
    Get full text
    Get full text
    Thesis
  12. 12

    An enhancement of sliding window algorithm for rainfall forecasting by Azahar, Siti Nor Fathihah, Othman, Mahmod, Saian, Rizauddin

    Published 2017
    “…Therefore, this study proposed a forecasting rainfall method based on sliding window algorithm (SWA), in order to obtain the best rainfall prediction value. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

    Published 2015
    “…On the other hand, agent-based model offers a good method to solve complex computational problems. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

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

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

    Fast method to find conflicts in optical multistage interconnection networks by Abed, Farzaneh, Othman, Mohamed

    Published 2008
    “…In this paper, fast window method based on bitwise operations (BWM) is represented. …”
    Get full text
    Get full text
    Get full text
    Article