List of Articles ant colony

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Multicast computer network routing using genetic algorithm and ant colony
  Mohammad Pourmahmood Aghababa
  Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from More

  Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the optimal routes from the sending source to the corresponding sinks.  Providing an optimal tree for routing is a complicated problem. In this paper, we are looking forward a method for routing of multicast networks with considering some parameters such as the cost and delay. Also, this paper has emphasized the issue that every parameter in routing problem has different value for different packets. And in accordance to these parameters optimal routing multicast trees are proposed. To gain this end, the genetic algorithm and ant colony optimization approaches are adopted. The simulation results show that the presented algorithms are able to produce optimal multicast trees subject to the packets. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Routing of Multipartite Computer Networks Using Ant Genetic Algorithm
  Mohammad Pourmahmood Aghababa amin bahadorani baghbaderani
  With the growth and development of computer networks, the importance of routing has become a thing of the past. The importance of using multi-sectoral networks cannot be ignored today. Many multimedia applications require sending a packet from one source to multiple des More

  With the growth and development of computer networks, the importance of routing has become a thing of the past. The importance of using multi-sectoral networks cannot be ignored today. Many multimedia applications require sending a packet from one source to multiple destinations over a communication network. To support such programs, you need to create an optimal multipart tree , Which indicates the optimal routes to reach from one sender source to several desired destinations. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - Ant Colony Scheduling for Network On Chip
  Neda  Dousttalab Mohammad Ali Jabraeil Jamali Ali Ghaffari
  10.7508/jist.2015.02.004
  The operation scheduling problem in network on chip is NP-hard; therefore effective heuristic methods are needful to provide modal solutions. This paper introduces ant colony scheduling, a simple and effective method to increase allocator matching efficiency and hence n More

  The operation scheduling problem in network on chip is NP-hard; therefore effective heuristic methods are needful to provide modal solutions. This paper introduces ant colony scheduling, a simple and effective method to increase allocator matching efficiency and hence network performance, particularly suited to networks with complex topology and asymmetric traffic patterns. Proposed algorithm has been studied in torus and flattened-butterfly topologies with multiple types of traffic pattern. Evaluation results show that this algorithm in many causes has showed positive effects on reducing network delays and increased chip performance in comparison with other algorithms. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  4 - Context-Based Expert Finding in Online Communities Using Ant Colony Algorithm
  Mojtaba Sharifian Neda Abdolvand Saeedeh Rajaee Harandi
  10.29252/jist.8.30.130
  Online communities are the most popular interactive environments on the Internet, which provide users with a platform to share their knowledge and expertise. The most important use of online communities in cyberspace is sharing knowledge. These communities are a great p More

  Online communities are the most popular interactive environments on the Internet, which provide users with a platform to share their knowledge and expertise. The most important use of online communities in cyberspace is sharing knowledge. These communities are a great place to ask questions and find answers. The important challenges of these communities are the large volume of information and the lack of a method to determine their validity as well as expert finding which attracted a lot of attention in both industry and academia in. Therefore, identifying persons with relevant knowledge on a given topic and ranking them according to their expertise score can help to calculate the accuracy of the comments submitted on the internet. In this research, a model for finding experts and determining their domain expertise level by the aid of statistical calculations and the ant colony algorithm in the MetaFilter online community was presented. The WordNet Dictionary was used to determine the relevance of the user’s questions with the intended domain. The proposed algorithm determines the level of people’s expertise in the intended field by using the pheromone section of the Ant colony algorithm, which is based on the similarity of the questions sent by the users and the shared knowledge of the users from their interactions in the online community Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  5 - Using Static Information of Programs to Partition the Input Domain in Search-based Test Data Generation
  Atieh Monemi Bidgoli Hassan haghighi
  10.29252/jist.8.32.219
  The quality of test data has an important effect on the fault-revealing ability of software testing. Search-based test data generation reformulates testing goals as fitness functions, thus, test data generation can be automated by meta-heuristic algorithms. Meta-heurist More

  The quality of test data has an important effect on the fault-revealing ability of software testing. Search-based test data generation reformulates testing goals as fitness functions, thus, test data generation can be automated by meta-heuristic algorithms. Meta-heuristic algorithms search the domain of input variables in order to find input data that cover the targets. The domain of input variables is very large, even for simple programs, while this size has a major influence on the efficiency and effectiveness of all search-based methods. Despite the large volume of works on search-based test data generation, the literature contains few approaches that concern the impact of search space reduction. In order to partition the input domain, this study defines a relationship between the structure of the program and the input domain. Based on this relationship, we propose a method for partitioning the input domain. Then, to search in the partitioned search space, we select ant colony optimization as one of the important and prosperous meta-heuristic algorithms. To evaluate the performance of the proposed approach in comparison with the previous work, we selected a number of different benchmark programs. The experimental results show that our approach has 14.40% better average coverage versus the competitive approach Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  6 - Combined Subtransmission Substation and Network Expansion Planning Using Genetic Algorithm, Ant Colony algorithm, and hybrid Ant Colony and Genetic Algorithm
  V. Amir H. Seifi S. M. Sepasian g. r. yousefi
  This research presents new algorithms for subtransmission simultaneous substation and network expansion planning. Given an existing system model, the projected load growth in a target year and various system expansion options, the algorithms find the optimal mix of sys More

  This research presents new algorithms for subtransmission simultaneous substation and network expansion planning. Given an existing system model, the projected load growth in a target year and various system expansion options, the algorithms find the optimal mix of system expansion options to minimize the cost function subject to various system constraints and single contingencies on lines and transformers. The system expansion options considered include building new subtransmission lines/substations, the capacity to be upgraded and the service area of HV/MV substations. In this research, Genetic Algorithm (GA) with new coding, Ant Colony algorithm (AC) and hybrid Ant Colony and Genetic Algorithm (AC&GA) methods are employed. The optimization results are compared with successive elimination method to demonstrate the performance improvement. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  7 - Introducing a New Version of Binary Ant Colony Algorithm to Solve the Problem of Feature Selection
  S. Kashef H. Nezamabadi-pour
  The use of metaheuristic algorithms is a good choice for solving optimization problems. In this paper, a novel feature selection algorithm based on Ant Colony Optimization (ACO), called Advanced Binary ACO (ABACO), is presented. This algorithm is an advanced version of More

  The use of metaheuristic algorithms is a good choice for solving optimization problems. In this paper, a novel feature selection algorithm based on Ant Colony Optimization (ACO), called Advanced Binary ACO (ABACO), is presented. This algorithm is an advanced version of binary ant colony optimization, which attempts to solve the problems of ACO and BACO algorithms by combination of these two. The performance of proposed algorithm is compared to the performance of Binary Genetic Algorithm (BGA), Binary Particle Swarm Optimization (BPSO), and some prominent ACO-based algorithms on the task of feature selection on 12 well-known UCI datasets. Simulation results verify that the algorithm provides a suitable feature subset with good classification accuracy using a smaller feature set than competing feature selection methods. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  8 - Improved routing for load balancing in wireless sensor networks on the Internet of things, based on multiple ant colony algorithm
  Farhang Padidaran Moghaddam Hamid Maghsoudi
  An important issue in dynamic computer networks such as Internet networks, where the cost of connections varies continuously, is to create a traffic load balancing and increase the transmission speed of packets in the network, so that data packets are using paths with m More

  An important issue in dynamic computer networks such as Internet networks, where the cost of connections varies continuously, is to create a traffic load balancing and increase the transmission speed of packets in the network, so that data packets are using paths with minimal congestion, as a result, one of the main approaches to solve routing problems and load balancing algorithms is based on ant - based algorithms using a novel approach based on optimization of multiple ant colony optimization, the purpose of this research is to present an appropriate routing algorithm in order to shorten and improve the path due to end - to - end delay parameters, packet loss rate, bandwidth and energy consumption rate, to reach a sense of data on the Internet systems. this method has been implemented in MATLAB software and shows the results of the improvement experiments in the mentioned parameters. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  9 - Optimization of Query Processing in Versatile Database Using Ant Colony Algorithm
  hasan Asil
  10.61186/jist.40851.12.45.20
  Nowadays, with the advancement of database information technology, databases has led to large-scale distributed databases. According to this study, database management systems are improved and optimized so that they provide responses to customer questions with lower co More

  Nowadays, with the advancement of database information technology, databases has led to large-scale distributed databases. According to this study, database management systems are improved and optimized so that they provide responses to customer questions with lower cost. Query processing in database management systems is one of the important topics that grabs attentions. Until now, many techniques have been implemented for query processing in database system. The purpose of these methods is to optimize query processing in the database. The main topics that is interested in query processing in the database makes run-time adjustments of processing or summarizing topics by using the new approaches. The aim of this research is to optimize processing in the database by using adaptive methods. Ant Colony Algorithm (ACO) is used for solving optimization problems. ACO relies on the created pheromone to select the optimal solution. In this article, in order to make adaptive hybrid query processing. The proposed algorithm is fundamentally divided into three parts: separator, replacement policy, and query similarity detector. In order to improve the optimization and frequent adaption and correct selection in queries, the Ant Colony Algorithm has been applied in this research. In this algorithm, based on Versatility (adaptability) scheduling, Queries sent to the database have been attempted be collected. The simulation results of this method demonstrate that reduce spending time in the database. According to the proposed algorithm, one of the advantages of this method is to identify frequent queries in high traffic times and minimize the time and the execution time. This optimization method reduces the system load during high traffic load times for adaptive query Processing and generally reduces the execution runtime and aiming to minimize cost. The rate of reduction of query cost in the database with this method is 2.7%. Due to the versatility of high-cost queries, this improvement is manifested in high traffic times. In the future Studies, by adapting new system development methods, distributed databases can be optimized. Manuscript profile