Search Results - (( initial solution waste algorithm ) OR ( parameter optimization max algorithm ))

Refine Results
  1. 1

    Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

    Published 2016
    “…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  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

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

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…The last objective of this thesis is to optimize the parameter settings of the best performing ant algorithm with local search. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

    Published 2009
    “…This thesis proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Prediction and multi-criteria-based schemes for seamless handover mechanism in mobile WiMAX networks by Mubarak, Mohammed Awadh Ahmed Ben

    Published 2013
    “…It reduces the number of handovers by 29.7% and 26.9%, respectively, compared to the conventional RSSI based handover algorithm and the previous worked, mobility improved handover (MIHO) algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

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

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

    Electric vehicle battery state of charge estimation using metaheuristic-optimized CatBoost algorithms by Mohd Herwan, Sulaiman, Zuriani, Mustaffa, Ahmad Salihin, Samsudin, Amir Izzani, Mohamed, Mohd Mawardi, Saari

    Published 2025
    “…A comprehensive data preprocessing pipeline was implemented, including missing value treatment, outlier removal, and feature normalization using Min-Max scaling. Three distinct metaheuristic algorithms were investigated: Barnacles Mating Optimizer (BMO), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Whale Optimization Algorithm (WOA), each integrated with CatBoost to optimize critical parameters including learning rate, tree depth, regularization, and bagging temperature. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12

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

    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
  14. 14
  15. 15

    Design Optimization of a Gas Turbine Engine for Marine Applications: Off-Design Performance and Control System Considerations by Machmudah, A., Lemma, T.A., Solihin, M.I., Feriadi, Y., Rajabi, A., Afandi, M.I., Abbasi, A.

    Published 2022
    “…Meta-heuristic optimizations, namely a genetic algorithm (GA) and a whale optimization algorithm (WOA), are applied to optimize the designed control system. …”
    Get full text
    Get full text
    Article
  16. 16

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

    DC Motor Control using Ant Colony Optimization by Amr Mansour, Sara

    Published 2011
    “…Since 1995 various other extended versions of AS have been developed, induding Ant Colony System (ACS) and MAX-MIN Ant System (MMAS). In 1999 Dorigo proposed the Ant Colony Optimization (ACO) meta-heuristic that became the most successful and recognized algorithm based on ant behaviour [1]. …”
    Get full text
    Get full text
    Final Year Project
  20. 20

    Robust PID anti-swing control of automatic gantry crane based on Kharitonov's stability by Solihin, Mahmud Iwan, Martono, Wahyudi, Legowo, Ari, Akmeliawati, Rini

    Published 2009
    “…The proposed method employs Genetic Algorithm (GA) in min-max optimization to find the stable robust PID. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper