Search Results - (( initial solution waste algorithm ) OR ( using optimization sensor algorithm ))

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

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

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

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

A centralized localization algorithm for prolonging the lifetime of wireless sensor networks using particle swarm optimization in the existence of obstacles by Abdulhasan Al-Jarah, Ali Husam

“…Particle Swarm Optimization has been used in the proposed algorithm to minimize the fitness function. …”
Get full text
Get full text
Get full text
Get full text

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

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

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

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

Simulated Kalman Filter optimization algorithm for maximization of wireless sensor networks coverage by Nor Azlina, Ab. Aziz, Zuwairie, Ibrahim, Kamarulzaman, Ab Aziz, Nor Hidayati, Abdul Aziz

“…It had been successfully used for optimization of many engineering problems. …”
Get full text
Get full text
Get full text

Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

“…This study proposed Extended Virtual Force and Cuckoo Search (EVFCS) algorithm with a combination of EVFA and CS algorithm to find an optimal node placement. …”
Get full text
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

Cluster head selection optimization in wireless sensor network via genetic-based evolutionary algorithm by Vincent Chung, Hamzarul Alif Hamzah, Norah Tuah, Kit, Guan Lim, Min, Keng Tan, Kenneth Tze Kin Teo

“…Genetic-based evolutionary algorithms such as Genetic Algorithm (GA) and Differential Evolution (DE) have been popularly used to optimize cluster head selection in WSN to improve energy efficiency for the extension of network lifetime. …”
Get full text
Get full text
Get full text
Get full text

Global optimization method for continuous - Time sensor scheduling by Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan C.

“…We consider a situation in which several sensors are used to collect data for signal processing since operating multiple sensors simultaneously canses system interference, only one sensor can be active at any one time.The problem of scheduling a discrete-valued optimal control problem.This problem cannot be solved using conventional optimization problem.The Transformed problem is then decomposed into a bi-level optimization problem, which is solved using a discreate filled function method in conjunction with a conventional optimal control algorithm.Numerical results show that our algorithm is robust, efficient, and reliable in attaining a near globally optimal solution.…”
Get full text
Get full text
Get full text

Provisioning an energy efficient with maximum coverage WSN through biological inspired sensor node placement by Abidin H.Z., Din N.M.

Whale optimization algorithm based on tent chaotic map for feature selection in soft sensors by AlRijeb, Mothena Fakhri Shaker, Othman, Mohammad Lutfi, Ishak, Aris, Hassan, Mohd Khair, Albaker, Baraa Munqith

“…One of the powerful optimization algorithms that is used for feature selection is the Whale Optimization Algorithm (WOA), which is a nature-inspired metaheuristic optimization algorithm that mimics the social behavior of humpback whales. …”
Get full text
Get full text
Get full text

Optimizing Visual Surveillance Sensor Coverage Using Dynamic Programming by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

“…The main contribution of the paper is to introduce a dynamic programming algorithm, which defines an optimal policy for solving the visual sensor coverage problem. …”
Get full text
Get full text

A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network by Gumaida, Bassam, Abubakar, Adamu

“…Results: Simulation results perfectly showed that the suggested localization algorithm based on NMM can carry out a better performance than that of other localization algorithms utilizing other op- timization approaches, including a particle swarm optimization, ant colony (ACO) and bat algorithm (BA). …”
Get full text
Get full text
Get full text
Get full text

Multi-objective biological mimicry optimization algorithm for WSN sensor node placement by Abidin H.Z., Din N.M., Radzi N.A.M.

A Green Clustering Protocol for Mobile Sensor Network Using Particle Swarm Optimization by ., Nurul Mu’azzah Abdul Latiff NikNoordini, NikAbdMalik Abdul Halim

“…One of the methods that can improve the utilization of sensor nodes batteries is the clustering method. In this paper, we propose a green clustering protocol for mobile sensor networks using particle swarm optimization (PSO) algorithm.…”
Get full text

Multi-mobile agent itinerary planning algorithms for data gathering in wireless sensor networks: a review paper by Qadori, Huthiafa Q., Ahmad Zukarnain, Zuriati, Mohd Hanapi, Zurina, Subramaniam, Shamala

“…The review shows that most of the algorithms used one parameter to find the optimal number of mobile agents in multi-agent itinerary planning without utilizing other parameters. …”
Get full text
Get full text
Get full text

Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

“…This research explores path integration in mobile robot navigation and path optimization technique using vector calculus. A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
Get full text
Get full text
Get full text

Human health status IoT device using data optimization algorithm / Albin Lemuel Kushan ... [et al.] by Kushan, Albin Lemuel, Anuar, Muhammad Hazwan, Mohd Supir, Mohd Hafifi, Ahmad Fadzil, Ahmad Firdaus, Zolkeplay, Anwar Farhan

“…This project aims to produce a device that can be used to identify the current health status of a person using sensor and a data optimization algorithm. …”
Get full text
Get full text

Energy efficient sensor nodes placement using Territorial Predator Scent Marking Algorithm (TPSMA) by Abidin H.Z., Din N.M.

“…This paper proposed a sensor node placement technique that utilizes a new biologically inspired optimization technique that imitates the behavior of territorial predators in marking their territories with their odors known as Territorial Predator Scent Marking Algorithm (TPSMA). …”