Search Results - (( parameter destination based algorithm ) OR ( _ distribution centre algorithm ))*

Modified K-Nearest Neighborhood Algorithm For Optimal Selection Of Distribution Centre In The Disaster Relief Operation by Siti Nabilah Basarang

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

“…In this project, this sensor-based algorithm is known as the Obstacle Avoidance Algorithm. …”
Get full text
Get full text

Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

“…The evaluation is based on node speed and packet size topology parameters. …”
Get full text
Get full text

Smart grid: Bio-inspired algorithms energy distributions for data centers by Woo, Yu Hang

Get full text
Get full text

Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine by Jalaluddin, Mohammad Fariduddin, Kamaru-Zaman, Ezzatul Akmal, Abdul Rahman, Shuzlina, Mutalib, Sofianita

“…The problem is caused by the delivery process that is not synchronized due to the problem of finding the best route of distribution. Distributors are unable to plan their distribution path with the minimal distance.Furthermore distributors are only able to reach each district distribution centre once a day and revisit the distribution centre will increase the time spent and operation cost. …”
Get full text
Get full text
Get full text

Relay suitability based routing protocol for video streaming in vehicular ad-hoc network by Omar Abdulmaged, Hammood

“…In the RESP, this protocol takes routing decisions based on vehicle proximity to the destination, the expected transmission count (ETX), density-aware collision probability, and relative velocity-based link stability measurement. …”
Get full text
Get full text

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…Subsequently, both algorithms were applied to the test environments. Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
Get full text
Get full text

Staff scheduling for a courier distribution centre using evolutionary algorithm by Mohd Yusoh, Zeratul Izzah, Pua, Si Ying

Get full text
Get full text
Get full text

Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

“…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
Get full text
Get full text
Get full text

Collision avoidance mechanisms using artificial potential field for UAVs by Abdul Azis, Fadilah, Tan, Jie Sim, Md Ghazaly, Mariam, Mohamad Hanif, Noor Hazrin Hany

“…The APF algorithm, based on the combination of attractive and repulsive potential functions, is modeled and simulated in MATLAB to guide UAVs toward target destinations while avoiding obstacles. …”
Get full text
Get full text
Get full text

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…Then, timetabling process is performed to identify a set of departure times at both origin and destination based on predefined parameters. The multiobjective set covering model is used by including some real-world restrictions to find number of buses and drivers as it can represent the problem clearly for implementation. …”
Get full text
Get full text

Improving resource management with multi-instance broker scheduling algorithm in hierarchical grid computing by Yahaya, Bakri

“…This research addresses the performance issue of grid computing based on resource management, resource broker, resource scheduling and algorithm for middleware in the grid environment. …”
Get full text
Get full text
Get full text

Multi-Robot Path-Planning algorithm for automated parcel sorting centre with ring road layout by Jong, Qian Biao

“…Since the automated warehouses and sorting centres are usually large and contain hundreds of robots, the recent algorithms with the simple grid layout assumption are doubted to be efficient in the real world. …”
Get full text
Get full text

Performance evaluation of load balancing algorithm for virtual machine in data centre in cloud computing by Parmesivan, Yuganes, Hasan, Sazlinah, Muhammed, Abdullah

“…Cloud computing has become biggest buzz in the computer era these days.It runs entire operating systems on the cloud and doeverything on cloud to store data off-site.Cloud computing is primarily based on grid computing, but it’s a new computational model.Cloud computing has emerged into a new opportunity to further enhance way of hosting data centre and provide services.The primary substance of cloud computing is to deal the computing power,storage,different sort of stages and services which assigned tothe external users on demand through the internet.Task scheduling in cloud computing is vital role optimisation and effective dynamic resource allocation for load balancing.In cloud, the issue focused is under utilisation and over utilisation of the resources to distribute workload of multiple network links for example,when cloud clients try to access and send request tothe same cloud server while the other cloud server remain idle at that moment, leads to the unbalanced of workload on cloud data centers.Thus, load balancing is to assign tasks to the individual cloud data centers of the shared system so that no single cloud data centers is overloaded or under loaded.A Hybrid approach of Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm is combined in order to get effective response time.The proposed hybrid algorithm has been experimented by using CloudSim simulator.The result shows that the hybrid load balancing algorithm improves the cloud system performance by reducing the response time compared to the Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm.…”
Get full text
Get full text
Get full text

Dynamic replication algorithm in data grid: Survey by K. Madi, Mohammed, Hassan, Suhaidi

Get full text
Get full text
Get full text

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

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

A power saver scheduling algorithm using DVFS and DNS techniques in cloud computing data centres by Atiewi S., Yussof S., Rusli M.E.B., Zalloum M.

Performance enhancement of adaptive cluster formation and routing protocols in wireless networks by Khalaf, Osamah Ibrahem

“…ESRSBRP selects the highly stable route in term of energy as well as mobility of nodes for the individual data transmission between the source and destination. An enhanced algorithm which is used to improve the video quality was proposed, namely, Effective Broadcast Control Routing algorithm (EBCRA). …”
Get full text
Get full text
Get full text

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text

A coalition model for efficient indexing in wireless sensor network with random mobility / Hazem Jihad Ali Badarneh by Hazem Jihad , Ali Badarneh

“…The proposed model consists of Dynamic-Coalition framework, Static-Coalition algorithm, and Coalition-Based Index-Tree framework. …”
Get full text
Get full text
Get full text