• Home
  • Ant Colony Algorithm
    • List of Articles Ant Colony Algorithm

      • Open Access Article

        1 - Context-Based Expert Finding in Online Communities Using Ant Colony Algorithm
        Mojtaba Sharifian Neda Abdolvand Saeedeh Rajaee Harandi
        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

        2 - 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

        3 - 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

        4 - Optimization of Query Processing in Versatile Database Using Ant Colony Algorithm
        hasan Asil
        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