Search Results - (( initial solving waste algorithm ) OR ( using optimization method algorithm ))

Search alternatives:

Refine Results
  1. 1
    Development of a fuzzy multi-objective mathematical model for hazardous waste location-routing problem

    Development of a fuzzy multi-objective mathematical model for hazardous waste location-routing problem by Hassani, Omid Boyer

    Published 2014
    “…To solve the model a (fast elitist Non-Dominated Sorting Genetic Algorithm (NSGAII)) and also the (weighted sum method (WSM)) were used and their results were compared to each other. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Optimization of Microbial Electrolysis Cell for Sago Mill Wastewater Derived Biohydrogen via Modeling and Artificial Neural Network

    Optimization of Microbial Electrolysis Cell for Sago Mill Wastewater Derived Biohydrogen via Modeling and Artificial Neural Network by Mohamad Afiq, Mohd Asrul

    Published 2023
    “…The model reliability describes the second sub-objective, which is to determine the feasible operating window of the MEC using multiple-objective optimization based on the nonlinear convex method using gradient descent algorithm as the objective function in maximizing the percentage efficiency of the MEC after validating the mathematical model. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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:
  5. 5
    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
    “…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
    Article
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    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
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud

    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
    Save to List
    Saved in:
  9. 9
    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:
  10. 10
    Application of genetic algorithm methods to optimize flowshop sequencing problem

    Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

    Published 2008
    “…Genetic algorithm method was one of the methods that were widely used in solving optimization problem. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  11. 11
    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan

    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

    Published 2018
    “…Later, an Iterative-based Sizing Algorithm (ISA) was developed to determine the optimal sizing solution which was later used as benchmark for sizing algorithms using optimization methods. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    An improved method using fuzzy system based on hybrid boahs for phishing attack detection

    An improved method using fuzzy system based on hybrid boahs for phishing attack detection by Noor Syahirah, Nordin

    Published 2022
    “…Moreover, Butterfly Optimization Algorithm and Harmony Search Algorithm were combined as optimization method led to a new method named BOAHS. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    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:
  14. 14
    Wind farm reactive power optimization by using imperialist competitive algorithm

    Wind farm reactive power optimization by using imperialist competitive algorithm by Soheilirad, Mohammadsoroush, Hizam, Hashim, Farzan, Payam, Hojabri, Mojgan, Fallah, Seyedeh Narjes, Soheilirad, G.

    Published 2013
    “…In this paper a new evolutionary computing method based on imperialist competitive algorithm (ICA) is used for optimization of the reactive power in a wind farm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    SA-EVPS ALGORITHM FOR DISCRETE SIZE OPTIMIZATION OF THE 582-BAR SPATIAL TRUSS STRUCTURE

    SA-EVPS ALGORITHM FOR DISCRETE SIZE OPTIMIZATION OF THE 582-BAR SPATIAL TRUSS STRUCTURE by Paknahad, M., Hosseini, P., Hakim, S.J.S

    Published 2023
    “…Nowadays, approximate optimization methods are widely used. This study utilized the Self Adaptive Enhanced Vibrating Particle System (SA-EVPS) algorithm as an approximate optimization method, since the EVPS algorithm requires experimental parameters. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern

    VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern by Angeline Teoh, Szu Fern

    Published 2012
    “…Two methods of optimization are used for CBLL. They are Cross Entropy and also Genetic Algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Wind Farm Reactive Power Optimization by Using Imperialist Competitive Algorithm

    Wind Farm Reactive Power Optimization by Using Imperialist Competitive Algorithm by Soheilirad, M., Hizam, H., Farzan, P., Hojabri, Mojgan, Fallah, S. N., Soheilirad, G.

    Published 2013
    “…In this paper a new evolutionary computing method based on imperialist competitive algorithm (ICA) is used for optimization of the reactive power in a wind farm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Firefly algorithm for optimal sizing of Standalone Photovoltaic System / Nurizzati Abdul Aziz

    Firefly algorithm for optimal sizing of Standalone Photovoltaic System / Nurizzati Abdul Aziz by Abdul Aziz, Nurizzati

    Published 2016
    “…Therefore, optimization methods are often used in the sizing algorithms for such systems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Firefly algorithm for optimal sizing of stand-alone photovoltaic system / Nur Izzati Abdul Aziz

    Firefly algorithm for optimal sizing of stand-alone photovoltaic system / Nur Izzati Abdul Aziz by Abdul Aziz, Nur Izzati

    Published 2016
    “…Therefore, optimization methods are often used in the sizing algorithms for such systems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Optimization Of Bar Linkage By Using Genetic Algorithms

    Optimization Of Bar Linkage By Using Genetic Algorithms by Ramasamy, Mugilan

    Published 2005
    “…This thesis presents the method of using simple Genetic Algorithms (GAs) in optimizing the size of bar linkage with discrete design variables and continues design variables. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: