Search Results - (( initial solving waste algorithm ) OR ( parallel optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Tool path generation of contour parallel based on ant colony optimisation

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    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
    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
    Minimizing machining airtime motion with an ant colony algorithm

    Minimizing machining airtime motion with an ant colony algorithm by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM

    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

    Published 2001
    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 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:
  7. 7
    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:
  8. 8
    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:
  9. 9
    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    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:
  11. 11
    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:
  12. 12
    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors

    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

    Published 2008
    “…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
    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
    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:
  15. 15
    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…A tree visualisation was constructed based on its connectivity to enable the generation of formulae for optimal diameter and average optimal path lengths. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques

    Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques by Mustafa, Ahmed Sudad

    Published 2017
    “…In this thesis, a hybrid detection algorithm mechanism has been proposed which combines two detection algorithms based on nodes’ trustworthiness and energy consumption in a parallel manner in order to detect the black hole nodes. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Mixed convection boundary layer flow embedded in porous medium with nanofluids

    Mixed convection boundary layer flow embedded in porous medium with nanofluids by Mat Yasin, Mohd Hafizi

    Published 2013
    “…Shooting method from MAPLE is used to solve the problem. This well-known technique is an iterative algorithm which attempts to identify appropriate initial conditions for a related initial value problem (IVP) that provides the solution to the original boundary value problem (BVP). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Combustion modeling of municipal waste combustor

    Combustion modeling of municipal waste combustor by Hussain, Ahmad, Ani, Farid Nasir, Darus, Amer Nordin, Adnan, Mohammed Fadzil, Surjosatyo, Adi, Mustafa, Azeman, Salema, Arshad A.

    Published 2005
    “…The differential equations were discretized by the Finite Volume Method and were solved by the SIMPLE algorithm. The k-ε turbulence model was employed. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision

    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

    Published 2021
    “…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    DC-based PV-powered home energy system

    DC-based PV-powered home energy system by Sabry, Ahmad H.

    Published 2017
    “…A controller based on an algorithm of one time maximum power point (MPP) is proposed to mitigate those losses. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: