Achievement of Cost-Effective Datasets Transference in The Cloud Through Ant Colony Optimization

2012 ◽  
Vol 3 (3) ◽  
pp. 122-125
Author(s):  
THAHASSIN C THAHASSIN C ◽  
◽  
A. GEETHA A. GEETHA ◽  
RASEEK C RASEEK C
Keyword(s):  
Ant Colony Optimization ◽  
Cost Effective ◽  
Ant Colony

scholarly journals Cost Effective Ant Colony Optimization in Cloud Computing

2019 ◽  
Vol 8 (10) ◽  
pp. 3016-3020
Keyword(s):  
Cloud Computing ◽  
Ant Colony Optimization ◽  
Task Scheduling ◽  
Direct Interaction ◽  
Cost Effective ◽  
Cloud Services ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Wide Range ◽  
Scheduling Method

Cloud computing is a term for a wide range of developments possibilities. It is rapidly growing paradigm in software technology that offers different services. Cloud computing has come of age, since Amazon's rollouted the first of its kind of cloud services in 2006. It stores the tremendous amount of data that are being processed every day. Cloud computing is a reliable computing base for data-intensive jobs. Cloud computing provide computing resources as a service. It is on-demand availability of computing resources without direct interaction of user. A major focus area of cloud computing is task scheduling. Task scheduling is one among the many important issues to be dealt with. It means to optimize overall system capabilities and to allocate the right resources. Task scheduling referred to NP-hard problem. The proposed algorithm is Cost Effective ACO for task scheduling, which calculates execution cost of CPU, bandwidth, memory etc. The suggested algorithm is compared with CloudSim with the presented Basic Cost ACO algorithm-based task scheduling method and outcomes clearly shows that the CEACO based task scheduling method clearly outperforms the others techniques which are in use into considerations. The task is allotted to the number of VMs based on the priorities (highest to lowest) given by user. The simulation consequences demonstrate that the suggested scheduling algorithm performs faster than previous Ant Colony Optimization algorithm in reference to the cost. It reduces the overall cost as compare to existing algorithm.

Use of Ant Colony Optimization (ACO) for Post-Deployment Replanning of UMTS Networks

2018 ◽  
Vol 9 (2) ◽  
pp. 18-47
Author(s):  
Samir K Sadhukhan ◽  
Chayanika Bose ◽  
Debashis Saha
Keyword(s):  
Ant Colony Optimization ◽  
Cost Effective ◽  
Ant Colony ◽  
Mobility Patterns ◽  
Solution Quality ◽  
Integer Linear Programming Problem ◽  
State Space Search ◽  
Link Cost ◽  
Diurnal Movement ◽  
Umts Networks

Inherent dynamism in user movement demands for post-deployment tuning of UMTS networks to minimize the total cost of ownership (TCO). Conventionally, UMTS operators so far have considered many-to-one mapping of RNCs to MSCs. However, such single-homed networks do not remain cost-effective over the passage of time, typically when subscribers later on begin to show specific mobility patterns such as diurnal movement. This necessitates topological extension of the network in terms of dual-homing of some selected RNCs to two MSCs simultaneously via direct fibre links, resulting in a many-to-two mapping in parts of the network. The aim of such selective dual-homing is to reduce handoff cost maximally at the expense of minimal increase in link cost, thereby reducing the TCO optimally. In this article, the authors have formulated the scenario as an integer linear programming problem, converted it into a state space search and then solved it using Ant Colony Optimization (ACO) technique. Compared to Simulated Annealing (SA) and Tabu Search (TS), ACO exhibits 10% to 15% improvement in solution quality.

Parallel Ant Colony Optimization on the University Course-Faculty Timetabling Problem in MSU-IIT

2012 ◽  
Author(s):  
Earth B. Ugat ◽  
Jennifer Joyce M. Montemayor ◽  
Mark Anthony N. Manlimos ◽  
Dante D. Dinawanao
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Timetabling Problem ◽  
University Course ◽  
The University

The Map-Based Shortest Route Selection by Using Ant Colony Optimization Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 15
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Google Earth ◽  
Ant Colony ◽  
Food Sources ◽  
Shortest Route ◽  
Study Results ◽  
Destination Point

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.

Modeling and optimizing logistics, information, economic and financial intercluster cooperation using the ant colony optimization algorithm

2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Population Decline ◽  
Innovation System ◽  
Federal District ◽  
Original Model ◽  
Ant Colony ◽  
Industrial Agglomeration ◽  
Ant Colony Optimization Algorithm

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district. Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district. Methods. For the study, we used the ant colony optimization algorithm. Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study. Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.

Sign in / Sign up

Export Citation Format

Share Document