Search Results - (( initial solution waste algorithm ) OR ( _ distribution function algorithm ))

Search alternatives:

Refine Results
  1. 1
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    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
    Save to List
    Saved in:
  2. 2
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    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
    Save to List
    Saved in:
  3. 3
    Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem

    Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem

    Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC).Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel speeds. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities

    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
    “…A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Nearest greedy for solving the waste collection vehicle routing problem: A case study

    Nearest greedy for solving the waste collection vehicle routing problem: A case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza, Wibowo, Antoni

    Published 2017
    “…This technique has been widely used to devise initial solutions for issues concerning vehicle routing. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    An internet of things based for smart recycle waste classification / Akmal Md Nasir

    An internet of things based for smart recycle waste classification / Akmal Md Nasir by Md Nasir, Akmal

    Published 2023
    “…With a high accuracy rate for waste classification, the ResNet algorithm proved to be effective. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem

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

    Published 2025
    “…The improved PCO incorporates a Nearest Greedy (NG) algorithm for initial solution construction, dynamic parameter adjustment, and two additional neighborhood operators. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Cr(VI) adsorption from aqueous solution by an agricultural waste based carbon

    Cr(VI) adsorption from aqueous solution by an agricultural waste based carbon by Khan, T., Isa, M.H., Ul Mustafa, M.R., Yeek-Chia, H., Baloo, L., Binti Abd Manan, T.S., Saeed, M.O.

    Published 2016
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    An empirical study of density and distribution functions for ant swarm optimized rough reducts

    An empirical study of density and distribution functions for ant swarm optimized rough reducts by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah

    Published 2011
    “…The density and distribution functions are two common types of Gaussian distribution representation. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  11. 11
    Embedded parallel distributed artificial intelligent processors for adaptive beam forming in WCDMA system

    Embedded parallel distributed artificial intelligent processors for adaptive beam forming in WCDMA system by Krishnan P.S., Kiong T.S., Koh J., Yap D.

    Published 2023
    Subjects:
    Conference paper
    Save to List
    Saved in:
  12. 12
    Firefly analytical hierarchy algorithm for optimal allocation and sizing of distributed generation in radial distribution network

    Firefly analytical hierarchy algorithm for optimal allocation and sizing of distributed generation in radial distribution network by Bujal, Noor Ropidah

    Published 2022
    “…The simulations of single and multi-objective function optimisations have been carried out using MATLAB for meta-heuristic techniques on the IEEE 33-bus and 69-bus radial distribution networks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Levy tunicate swarm algorithm for solving numerical and real-world optimization problems

    Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    A review of the optimal allocation of distributed generation: Objectives, constraints, methods, and algorithms

    A review of the optimal allocation of distributed generation: Objectives, constraints, methods, and algorithms by Pesaran H.A M., Huy P.D., Ramachandaramurthy V.K.

    Published 2023
    “…Circuit theory; Energy efficiency; Optimization; Dg siting; Dg sizings; Distributed generators; Distributed resources; Objective functions; Optimal allocation; Optimal DG allocation; Optimization algorithms; Distributed power generation…”
    Review
    Save to List
    Saved in:
  15. 15
    Levy slime mould algorithm for solving numerical and engineering optimization problems

    Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Distributed generation allocation to reduce losses and improve voltage profile genetic algorithm: article

    Distributed generation allocation to reduce losses and improve voltage profile genetic algorithm: article by Abdol Azis, Hazriq Syahmie

    Published 2010
    “…Genetic Algorithm (GA) was used as the solving tool, which referring two determined aim the problem is defined and objective function is introduced. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Performance of amidoxime-modified poly(acrylonitrile- Co-acrylic acid) for removal of boron in aqueous solution

    Performance of amidoxime-modified poly(acrylonitrile- Co-acrylic acid) for removal of boron in aqueous solution by Lau, Kia Li

    Published 2019
    “…Batch adsorption was conducted at the physiochemical parameters of pH, adsorbent dosage and initial boron concentration. The isotherms and kinetics of adsorption data were studied at various initial boron concentration. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets

    Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

    Published 2019
    “…Thereafter, a multi-objective hybrid algorithm (MOHA), an extension of the self-adaptive hybrid algorithm is proposed and tested on the established multi-objective (MO) test functions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm: article / Deezex Noor Ainizaa Abdullah

    Offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm: article / Deezex Noor Ainizaa Abdullah by Abdullah, Deezex Noor Ainizaa

    Published 2009
    “…This paper present offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm / Deezex Noor Ainizaa Abdullah

    Offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm / Deezex Noor Ainizaa Abdullah by Abdullah, Deezex Noor Ainizaa

    Published 2009
    “…This paper present offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: