6,537 research outputs found
A Review on Energy Consumption Optimization Techniques in IoT Based Smart Building Environments
In recent years, due to the unnecessary wastage of electrical energy in
residential buildings, the requirement of energy optimization and user comfort
has gained vital importance. In the literature, various techniques have been
proposed addressing the energy optimization problem. The goal of each technique
was to maintain a balance between user comfort and energy requirements such
that the user can achieve the desired comfort level with the minimum amount of
energy consumption. Researchers have addressed the issue with the help of
different optimization algorithms and variations in the parameters to reduce
energy consumption. To the best of our knowledge, this problem is not solved
yet due to its challenging nature. The gap in the literature is due to the
advancements in the technology and drawbacks of the optimization algorithms and
the introduction of different new optimization algorithms. Further, many newly
proposed optimization algorithms which have produced better accuracy on the
benchmark instances but have not been applied yet for the optimization of
energy consumption in smart homes. In this paper, we have carried out a
detailed literature review of the techniques used for the optimization of
energy consumption and scheduling in smart homes. The detailed discussion has
been carried out on different factors contributing towards thermal comfort,
visual comfort, and air quality comfort. We have also reviewed the fog and edge
computing techniques used in smart homes
A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION
Swarm Intelligence(SI) is the emergent collective intelligence of groups of simple agents. Economy is an example of SI. Simulating an economy using Ant Colony algorithms would allow prediction and control of fluctuations in the complex emergent behavior of the simulated system. Such a simulation is far beyond SI's capabilities, which is still in its infancy. This paper presents a distributed approach implementing Ant Colony Optimization(ACO). We present our agent based architecture of ACO and initial experimental results on the Travelling Salesman Problem. The innovation of our work consists of: i)representing network nodes as software agents, ii) representing software agents as software objects that are passed as messages between the nodes according to ACO rules.Swarm Intelligence, Ant Colony Optimization, Multi-Agent, Distributed, Heuristis
GPU accelerated Nature Inspired Methods for Modelling Large Scale Bi-Directional Pedestrian Movement
Pedestrian movement, although ubiquitous and well-studied, is still not that
well understood due to the complicating nature of the embedded social dynamics.
Interest among researchers in simulating pedestrian movement and interactions
has grown significantly in part due to increased computational and
visualization capabilities afforded by high power computing. Different
approaches have been adopted to simulate pedestrian movement under various
circumstances and interactions. In the present work, bi-directional crowd
movement is simulated where an equal numbers of individuals try to reach the
opposite sides of an environment. Two movement methods are considered. First a
Least Effort Model (LEM) is investigated where agents try to take an optimal
path with as minimal changes from their intended path as possible. Following
this, a modified form of Ant Colony Optimization (ACO) is proposed, where
individuals are guided by a goal of reaching the other side in a least effort
mode as well as a pheromone trail left by predecessors. The basic idea is to
increase agent interaction, thereby more closely reflecting a real world
scenario. The methodology utilizes Graphics Processing Units (GPUs) for general
purpose computing using the CUDA platform. Because of the inherent parallel
properties associated with pedestrian movement such as proximate interactions
of individuals on a 2D grid, GPUs are well suited. The main feature of the
implementation undertaken here is that the parallelism is data driven. The data
driven implementation leads to a speedup up to 18x compared to its sequential
counterpart running on a single threaded CPU. The numbers of pedestrians
considered in the model ranged from 2K to 100K representing numbers typical of
mass gathering events. A detailed discussion addresses implementation
challenges faced and averted
Enhancing Facility Layout via Ant Colony Technique (Act)
Cellular manufacturing systems optimization is investigated and manipulated using artificial intelligent (AI) approach combining facility layout and group technology scope. This research applied the ANT COLONY technique (ACT) optimization where this process was inspired by the real ants and how they move and build colonies by avoiding obstacle and simulate the process to get a procedure that can be adopted on this optimization process. In this research the problem goes in two way first the theory that take account the positions of machines inside the plant and its equations of controlling and second is the routing of part during product life cycle then execute results and applying it on factory configuration. The application of Ants system was carried out on industrial factory of electrical motor where all data was taken from the factory depending on the position and sequence of operations took place. Results were carried out in a way that depending on the showing site plan configurations for each stage and studying the iteration curve response to the parameters changes while testing the system during different environments. The results show high flexibility in ACS (Ant colony system) with fast response and high reduction in the distance crossed by the product part that reached 500m. The ratio of the reduction is 0.625. Keyword: Artificial intelligent (AI), Ant colony (AC), pheromone, genetic algorithm, facility layout, cell manufacturing (CM)
An Algorithm for Network and Data-aware Placement of Multi-Tier Applications in Cloud Data Centers
Today's Cloud applications are dominated by composite applications comprising
multiple computing and data components with strong communication correlations
among them. Although Cloud providers are deploying large number of computing
and storage devices to address the ever increasing demand for computing and
storage resources, network resource demands are emerging as one of the key
areas of performance bottleneck. This paper addresses network-aware placement
of virtual components (computing and data) of multi-tier applications in data
centers and formally defines the placement as an optimization problem. The
simultaneous placement of Virtual Machines and data blocks aims at reducing the
network overhead of the data center network infrastructure. A greedy heuristic
is proposed for the on-demand application components placement that localizes
network traffic in the data center interconnect. Such optimization helps
reducing communication overhead in upper layer network switches that will
eventually reduce the overall traffic volume across the data center. This, in
turn, will help reducing packet transmission delay, increasing network
performance, and minimizing the energy consumption of network components.
Experimental results demonstrate performance superiority of the proposed
algorithm over other approaches where it outperforms the state-of-the-art
network-aware application placement algorithm across all performance metrics by
reducing the average network cost up to 67% and network usage at core switches
up to 84%, as well as increasing the average number of application deployments
up to 18%.Comment: Submitted for publication consideration for the Journal of Network
and Computer Applications (JNCA). Total page: 28. Number of figures: 15
figure
Dynamic Task Migration for Enhanced Load Balancing in Cloud Computing using K-means Clustering and Ant Colony Optimization
Cloud computing efficiently allocates resources, and timely execution of user tasks is pivotal for ensuring seamless service delivery. Central to this endeavour is the dynamic orchestration of task scheduling and migration, which collectively contribute to load balancing within virtual machines (VMs). Load balancing is a cornerstone, empowering clouds to fulfill user requirements promptly. To facilitate the migration of tasks, we propose a novel method that exploits the synergistic potential of K-means clustering and Ant Colony Optimization (ACO). Our approach aims to maximize the cloud ecosystem by improving several critical factors, such as the system's make time, resource utilization efficiency, and workload imbalance mitigation. The core objective of our work revolves around the reduction of makespan, a metric directly tied to the overall system performance. By strategically employing K-means clustering, we effectively group tasks with similar attributes, enabling the identification of prime candidates for migration. Subsequently, the ACO algorithm takes the reins, orchestrating the migration process with an inherent focus on achieving global optimization. The multifaceted benefits of our approach are quantitatively assessed through comprehensive comparisons with established algorithms, namely Round Robin (RR), First-Come-First-Serve (FCFS), Shortest Job First (SJF), and a genetic load balancing algorithm. To facilitate this evaluation, we harness the capabilities of the CloudSim simulation tool, which provides a platform for realistic and accurate performance analysis. Our research enhances cloud computing paradigms by harmonizing task migration with innovative optimization techniques. The proposed approach demonstrates its prowess in harmonizing diverse goals: reducing makespan, elevating resource utilization efficiency, and attenuating the degree of workload imbalance. These outcomes collectively pave the way for a more responsive and dependable cloud infrastructure primed to cater to user needs with heightened efficacy. Our study delves into the intricate domain of cloud-based task scheduling and migration. By synergizing K-means clustering and ACO algorithms, we introduce a dynamic methodology that refines cloud resource management and bolsters the quintessential facet of load balancing. Through rigorous comparisons and meticulous analysis, we underscore the superior attributes of our approach, showcasing its potential to reshape the landscape of cloud computing optimization
- …