Search Results - (( based solving waste algorithm ) OR ( java application designing algorithm ))

Refine Results
  1. 1

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  5. 5
  6. 6

    Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud by Shariff, S. Sarifah Radiah, Hud, Hady

    Published 2023
    “…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. …”
    Get full text
    Get full text
    Book Section
  7. 7
  8. 8

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

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…This research explored and developed new heuristics based on GA for solving VRPSD. New algorithms, journal papers and computerized system were also developed. …”
    Get full text
    Get full text
    Monograph
  10. 10
  11. 11
  12. 12

    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
    “…In this problem there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of homogeneous vehicles based at a single depot.Empty vehicles leave the depot and collect waste from customers, emptying themselves at the waste disposal facilities as and when necessary.Vehicles return to the depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework by Asaad Aref, Ibrahim

    Published 2004
    “…Java Media Framework library and the RTP protocol for audio transmission were used as development tools.The developed system designed in this thesis together with experimental results proved that the system could be implemented successfully. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16
  17. 17

    Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

    Published 2008
    “…Tabu Search (TS) is a heuristic method based on the use of prohibition-based techniques and basic heuristics algorithms like local search. …”
    Get full text
    Get full text
    Monograph
  18. 18

    Network game (Literati) / Chung Mei Kuen by Chung, Mei Kuen

    Published 2003
    “…The main aspect of this thesis is to produce a networked gaming system, which process players. requested to play the game and enabling users to play the graphical game with people through the network. The algorithm design and implementation method must not only be workable, but also highly efficient in terms of execution speed and response time. …”
    Get full text
    Get full text
    Thesis
  19. 19

    SANAsms: Secure short messaging system for secure GSM mobile communication by Anuar, N.B., Azlan, I.M., Wahid, A.W.A., Zakaria, O.

    Published 2008
    “…The application is designed to satisfy the user friendly interfaces and intent to be used by the end user without having the advanced knowledge in mobile security. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem by Fazlini, Hashim

    Published 2025
    “…To integrate this constraint, an enhanced Partial Comparison Optimization (PCO) algorithm is proposed. PCO is a single-solution-based metaheuristic previously shown to be effective in solving Vehicle Routing Problems (VRP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis