Search Results - (( using solution using algorithm ) OR ( based application customization algorithm ))

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

“…Genetic Algorithm gives a pool of solutions rather than just one. …”
Get full text
Get full text

Enhancing Solutions Of Capacity Vehicle Routing Problem Based On An Improvement Ant Colony System Algorithm by Mutar, Modhi Lafta, Mohd Aboobaider, Burhanuddin, Hameed, Asaad Shakir, Yusof, Norzihani

“…VRP is one of the major important issues have no perfect solutions yet. Several authors over the last only some decades have recognized many types of research and used several algorithms with various methods to solve it. …”
Get full text
Get full text
Get full text

Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong by Lily , Wong

“…The computational results show that the algorithms which implement this new formulation are able to produce better solutions. …”
Get full text
Get full text
Get full text

An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

“…In order to obtain feasible solution which does not violate precedence constraints, a route repair based topological sort technique is used and integrated in the genetic algorithm procedure. …”
Get full text
Get full text
Get full text

Optimised crossover genetic algorithm for capacitated vehicle routing problem by Nazif, Habibeh, Lee, Lai Soon

“…Computational results showed that the proposed algorithm is competitive in terms of the quality of the solutions found.…”
Get full text
Get full text

Dynamic economic dispatch in electricity market using particle swarm optimization algorithm / Nurain Masran by Masran, Nurain

“…This paper presents the application of Particle Swarm Optimization (PSO) algorithm to obtain a solution for Bid-Based Dynamic Economic Dispatch (BBDED) model problem to maximize the social profit in a competitive electricity market. …”
Get full text
Get full text

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.

“…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

Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

“…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). To achieve an optimal solution for VRP with the accompanying targets: (1) To reduce the distance and the time for all paths this leads to speedy the transportation of customers to their locations, (2) To implement the capacitated vehicle routing problem (CVRP) model for optimizing the solutions. …”
Get full text
Get full text
Get full text

Clustering Based on Customers’ Behaviour in Accepting Personal Loan using Unsupervised Machine Learning by Lim, Wai Ping, Goh, Ching Pang

“…Focusing on clustering algorithms, the study employs popular methods like K-Means Clustering, Density-Based Spatial Clustering of Applications with Noise (DBSCAN), Agglomerative Hierarchical Clustering, and Mean Shift Clustering to understand customer characteristics and behaviors. …”
Get full text
Get full text
Get full text
Get full text

Manufacturing process planning optimisation in reconfigurable multiple parts flow lines by Ismail, Napsiah, Musharavati, Farayi, Hamouda, Abdel Magid Salem, Ramli, Abdul Rahman

“…Design/methodology/approach: The genetic algorithm methodology implements a genetic algorithm that is augmented by application specific heuristics in order to guide the search for an optimal solution. …”
Get full text
Get full text
Get full text

A genetic algorithm for two-dimensional bin packing with due dates by Bennell, Julia A., Lee, Lai Soon, Potts, Chris N.

“…We propose a genetic algorithm for searching the solution space, which uses a new placement heuristic for decoding the gene based on the best fit heuristic designed for the strip packing problems. …”
Get full text
Get full text

Cuckoo Search Approach for Cutting Stock Problem by Shair, Ezreen Farina, Khor, Shen Young, Abdullah, Abdul Rahim, Jaafar, Hazriq Izzuan, Saharuddin, Nur Zawani, Zainal Abidin, Amar Faiz

“…Therefore, many researchers have to turn to metaheuristic algorithms as a solution to the problem which also makes these algorithms become famous. …”
Get full text
Get full text
Get full text

Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

“…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

An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

Subjects: Get full text
Get full text

Genetic algorithm optimization of product design for environmental impact reduction / Julirose Gonzales by Julirose , Gonzales

“…The results using the proposed methodology yields 50 pareto optimal design solutions for every run, allowing the designers the freedom to choose the suitable design. …”
Get full text
Get full text
Get full text

Hybrid Cat Swarm Optimization and Simulated Annealing for Dynamic Task Scheduling on Cloud Computing Environment by Gabi, Danlami, Ismail, Abdul Samad, Zainal, Anazida, Zakaria, Zalmiyah, Al-Khasawneh, Ahmad

“…Meanwhile, the scalability analysis of the proposed algorithm using Isospeed-efficiency scalability metric is also reported. …”
Get full text
Get full text
Get full text

Real-time vehicle counting using custom YOLOv8n and DeepSORT for resource-limited edge devices by Saadeldin, Abuelgasim, Rashid, Muhammad Mahbubur, Shafie, Amir Akramin, Hasan, Tahsin Fuad

“…The system makes use of a custom-built vehicle detection algorithm based on the you only look once version 8 nano (YOLOv8n), combined with a deep association metric (DeepSORT) object tracking algorithm and an efficient vehicle counting method for accurate counting of vehicles in highway scenes. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Vehicle routing problem: models and solutions by Liong, Choong Yeun, Wan Rosmanira Ismail, Khairuddin Omar, Mourad Zirour

Get full text
Get full text
Get full text

Tile-Level Parallelism For H.264/Avc Codec Using Parallel Domain Decomposition Algorithm On Shared Memory Architecture by Eessa, Mohammed F.

“…The theme of this thesis is based on the utilisation of features of the parallel model in the design phase of an algorithm in order to reduce the computational complexity in comparison with the serial algorithm. …”
Get full text
Get full text

Fraud detection in shipping industry based on location using machine learning comparison techniques by Ganesan Subramaniam, Mr.

“…A number of popular existing algorithms were used to execute the model developed in Rapid tool such as Naïve Bayes , Neural Net , Deep Learning, Decision Tree, Logistic Regression, SVM and k-NN. …”