Showing 1 - 20 results of 316 for search '(( agents based algorithm ) OR ((( data scheduling algorithm ) OR ( solved using algorithm ))))', query time: 0.13s Refine Results
  1. 1

    Stochastic Search Algorithms for Exam Scheduling by Mansour, Nashat

    Published 2007
    “…Then, we empirically compare the three proposed algorithms and FESP using realistic data. Our experimental results show that SA and GA produce good exam schedules that are better than those of FESP heuristic procedure. …”
    Get full text
    Get full text
    article
  2. 2
  3. 3

    Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing by Al Sadawi, Alia

    Published 2016
    “…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …”
    Get full text
    doctoralThesis
  4. 4

    Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain by Al Sadawi, Alia

    Published 2021
    “…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …”
    Get full text
    article
  5. 5
  6. 6
  7. 7
  8. 8

    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

    Published 2018
    “…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  9. 9
  10. 10

    Distributed optimal coverage control in multi-agent systems: Known and unknown environments by Mohammadhasan Faghihi (22303057)

    Published 2024
    “…The proposed technique offers an optimal solution with a lower cost with respect to conventional Voronoi-based techniques by effectively handling the issue of agents remaining stationary in regions void of information using a ranking function. …”
  11. 11
  12. 12

    An evolutionary algorithm for solving the geometrically constrained site layout problem by Zouein, P.

    Published 2017
    “…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  13. 13

    Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

    Published 1998
    “…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
    Get full text
    Get full text
    article
  14. 14
  15. 15
  16. 16

    Three-phase simulated annealing algorithms for exam scheduling by Mansour, Nashat

    Published 2003
    “…We empirically compare 3PSA with a 4-phase clustering-based heuristic algorithm using realistic data. Our experimental results show that 3PSA produces good exam schedules, which are better than those of the clustering heuristic procedure.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  17. 17

    Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities by Zouein, P. P.

    Published 2002
    “…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
    Get full text
    Get full text
    Get full text
    article
  18. 18
  19. 19
  20. 20

    Social spider optimization algorithm: survey and new applications by Abualigah, Laith

    Published 2024
    “…Each spider has a weight based on the value of fitness. This algorithm consists of two search spiders called agents: males and females. …”
    Get full text