A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem

Mandal, Akshaya Kumar; Dehuri, Satchidananda

doi:10.1007/978-3-030-39033-4_9

Cited by 13 publications

(14 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…No caso a primeira, algoritmo muito popular que faz a selec ¸ão da máquina virtual através de rodízio entre os Hosts, distribuindo de forma equilibrada as quantidades de máquinas. Enquanto a segunda, é uma meta-heurística que consiste em um aperfeic ¸oamento do Ant System, e possui um desempenho notadamente superior e aplicabilidade a problemas de tamanhos mais consideráveis, pois envolve uma parte determinística, ou exploratória, e uma parte probabilística, ou desbravadora [CLOUDSIM 2016, Mandal andDehuri 2019].…”

Section: Execuc ¸ãO Do Cloudsim Plusunclassified

Relações do Consumo Energético nas Execuções de Tarefas em Computação em Nuvem Verde

Reis¹,

Teixeira²,

Neto³

2022

Anais Da X Escola Regional De Computação Do Ceará, Maranhão E Piauí (ERCEMAPI 2022)

View full text Add to dashboard Cite

A computação em nuvem já faz parte do cotidiano das pessoas e empresas, bem como a preocupação com a questão ambiental. A união dessas duas realidades oportuniza o surgimento da Computação em Nuvem Verde com novas propostas, abordagens e métricas, no sentido de tornar os datacenters mais eficientes, principalmente em termos energéticos, de forma a reduzir a emissão de CO2 e o impacto ambiental. Conhecer as métricas que podem ser utilizadas para medir o custo energético e o impacto ambiental de um datacenter bem como as principais categorias e áreas de ação são pontos fundamentais na Computação Verde. Este artigo apresenta um estudo das relações entre o consumo energético com os tempos de execução, arquitetura e custos de ambiente em nuvem. Por meio da utilização de simuladores foi possível comprovar a melhoria da eficiência energética acima de 60% e redução nos tempos de processamento em no mínimo 29%, com a adoção de algoritmos, de problemas complexos, no escalonamento de Máquinas Virtuais.

show abstract

Section: Execuc ¸ãO Do Cloudsim Plusunclassified

Relações do Consumo Energético nas Execuções de Tarefas em Computação em Nuvem Verde

Reis¹,

Teixeira²,

Neto³

2022

Anais Da X Escola Regional De Computação Do Ceará, Maranhão E Piauí (ERCEMAPI 2022)

View full text Add to dashboard Cite

show abstract

“…in equation (1). But in ACS model, ants follow a pseudo-random-proportional rule as shown in equation (11), to select the index of the next node , where is a random number uniformly distributed and is a parameter that determines the percentage of exploitation and exploration for generating new solutions; if , it is totally exploitation, and if , it is totally exploration. is a random variable representing the next node selected according to equation (1).…”

Section: State Transition Rulementioning

confidence: 99%

“…Only a few review articles focus on solving a scheduling problem by using the ant method in general. Even in the article [11] the scheduling issue did not inserted, although the survey was about using the ant colony algorithm for solving some NP-Hard problems.…”

Section: Introductionmentioning

confidence: 99%

A Review of Implementing Ant System Algorithms on Scheduling Problems

Kashef

Elshaer

2021

The Egyptian International Journal of Engineering Sciences and

View full text Add to dashboard Cite

The ant system (AS) and scheduling problem are well-known concepts in literature. Ant algorithms have been known to be an effective tool for solving combinatorial optimization problems. Elitist AS (EAS), rank-based AS (RAS), ant colony system (ACS), and max-min AS (MMAS) are the variants of the AS algorithm; they are triggered by the different ways of updating the pheromone trail τ, computing the visibility η, and/or other parameters in the basic AS model. The main contribution of this article is twofold. First, the basic AS and its controlled parameters are presented, the key variants of the ant algorithms are explained, and major changes of each variant from the basic model are tracked. Second, sixty papers are collected between 2015 and 2020 based on a search strategy for tracking the implementation of different AS variants in solving scheduling problems. Numerous findings based on a statistical analysis of the collected papers are reported and discussed. This study will allow the researcher to understand the essence of the ant algorithm, recognize the fundamental differences in its five systems, and determine how each of them can be implemented. Tracking a sample of articles that apply an ant algorithm for a specific case study gives researchers new ideas on how to adjust the original model to fit their problem.

show abstract

“…The Traveling Salesman Problem (TSP) is the task of finding the shortest route among a group of cities, starting from one city [1][2][3], visiting all others exactly once, and returning to the starting city, with the aim of discovering the most efficient path in terms of minimizing distance or cost. It is represented using a complete weighted graph where each edge denotes the distance between two cities.…”

Section: Introductionmentioning

confidence: 99%

A Step-by-Step Mathematical Derivation of Ant Colony Optimization Algorithm for Solving the Traveling Salesman Problem

2023

IRJMETS

View full text Add to dashboard Cite

In this comprehensive exploration, the article takes a journey through the intricate realms of optimization algorithms, focusing specifically on the Traveling Salesman Problem. Delving into the subtleties of the Ant Colony Optimization (ACO) algorithm, a meticulous and step-by-step mathematical derivation is presented. From foundational concepts to the intricacies of problem-solving, the narrative navigates through the algorithm's evolution, elucidating its application in efficiently solving the Traveling Salesman Problem. Undertaking an intellectual journey, the intricacies of ACO are deciphered, exposing its mathematical underpinnings and its adeptness in addressing one of the most formidable combinatorial optimization problems.

show abstract

A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem

Cited by 13 publications

References 38 publications

Relações do Consumo Energético nas Execuções de Tarefas em Computação em Nuvem Verde

Relações do Consumo Energético nas Execuções de Tarefas em Computação em Nuvem Verde

A Review of Implementing Ant System Algorithms on Scheduling Problems

A Step-by-Step Mathematical Derivation of Ant Colony Optimization Algorithm for Solving the Traveling Salesman Problem

Contact Info

Product

Resources

About