：In this paper, we propose a new artificial ant algorithm for solving constrained optimization problems in general case. Numerical examples show that it is effective and robust.
：In this paper, we propose a new artificial ant algorithm for solving constrained optimization problems in general case. Numerical examples show that it is effective and robust.
With the rise of leisure tourism and the improvement of attention to rural landscape, the rural areas in the suburbs of metropolis absorb urban resources in the process of development, and have the advantage of develo...
详细信息
This paper proposed an improved ant algorithm with feedback function extension and dynamic pheromone design (dynamicant) for the network traffic management issue. The scheme first mapped the network traffic path delay...
详细信息
ISBN:
(纸本)9781424421077
This paper proposed an improved ant algorithm with feedback function extension and dynamic pheromone design (dynamicant) for the network traffic management issue. The scheme first mapped the network traffic path delay and bandwidth metrics into the parameters of the basic ant algorithm. And then extended the network feedback function to the basic ant algorithm by simulated it as the food smell. By releasing the food smell and the ant pheromone with a dynamic design, the path selection behavior of each ant will be influenced according to their variation. The aim of dynamicant tied in affecting the ants' behavior to make fully use of available paths with avoiding the paths congestion in the network traffic control. Besides analyzing the effective control of the pheromone and its related transfer possibility, compared with basic ant algorithm, simulation experiments illustrate that the proposed algorithm achieved better network traffic performance in network throughput, path delay and. packet loss rate.
Humans are basically curious creatures. We always look for all the latest information through books or news. News usually contain tags or categories to make it easier to find similar news. It can be done manually by h...
详细信息
ISBN:
(数字)9781728154237
ISBN:
(纸本)9781728154244
Humans are basically curious creatures. We always look for all the latest information through books or news. News usually contain tags or categories to make it easier to find similar news. It can be done manually by human or with machine to make it easier. Data mining technique such as clustering and classification can be used to help the categorization process. Clustering is a technique that can be used to grouped news based on their similarity. There is some algorithm that can be used to clustering data. One of it is ant Colony optimization (ACO). ACO is a metaheuristic algorithm that mimics how ants brings food to the colony. ACO also can be used to solve clustering problem. In this paper, we will use the ACO version for clustering to cluster news and find the performance of said method. Then we compare the result with ground truth.
ant algorithm is a new heuristic algorithm which is applicable to solve complex combinatorial optimization problem. The idea of ant algorithm is introduced in this paper and the algorithm is applied to the train enqui...
详细信息
ISBN:
(数字)9781612840888
ISBN:
(纸本)9781612840871
ant algorithm is a new heuristic algorithm which is applicable to solve complex combinatorial optimization problem. The idea of ant algorithm is introduced in this paper and the algorithm is applied to the train enquiry system. The enquiry results show that the shortest path can be found quickly, which illustrates the effectiveness of using the ant algorithm in train inquiry system.
The modification of ant algorithm method for optimizing the transportation route with regard to traffic flow in the street network has been developed in this paper. It was also made possible to confirm the results of ...
详细信息
The modification of ant algorithm method for optimizing the transportation route with regard to traffic flow in the street network has been developed in this paper. It was also made possible to confirm the results of optimization of partly covered distance for calculating a further route when changing the length of links while ant agents traveling on the links of a two-way graph. Besides, the procedure of ant agents’ traffic in the graph was improved so that ant agents can travel both synchronously and asynchronously. The proposed modification of ant algorithm for optimizing the goods delivery route when changing the speed of traffic flow in specific sections of the street network has been approbated, using the example of Kyiv's specific street network within traveling salesman problem. We conducted the quantitative and comparative analysis of solving the problem of optimization of the goods delivery route in the street network, applying ant algorithm method and the respective findings of other existing classical methods. The obtained results of the study show the prospects of applying the proposed modification of ant algorithm for solving routing problems, particularly for transport networks which are characterized by high dimensionality and dynamism of functional parameters.
It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then ...
详细信息
It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then the optimal vehicle distributionroute-division approach of distribution center for given customer array is defined, and the ant colony algorithm for VRP with objective to minimize the delivery time is presented. The research of this paper is based on the information and application case of tobacco network in Hangzhou city. By investigating, we created two different system models. One is division of distribution route of distribution center, and the other is optimization of single vehicle route. The computational example tests and verifys the solution.
To overcome the defects of slow convergence speed, easy precocity and local optimization in the basic ant algorithm, this paper proposes an improved ant algorithm to solve QoS multicast routing problem. It uses ant-me...
详细信息
To overcome the defects of slow convergence speed, easy precocity and local optimization in the basic ant algorithm, this paper proposes an improved ant algorithm to solve QoS multicast routing problem. It uses ant-meeting strategy to quicken search speed, elitist update and adaptive pheromone control strategy to avoid stagnation. Simulation results validate the feasibility and effectiveness of the proposed algorithm.
In this paper, we first analyze the theory of ant algorithm and its mathematic model, and then we put forward a novel approach to solve the shortest-path routing problem with the ant algorithm. Finally we set up an ex...
详细信息
In this paper, we first analyze the theory of ant algorithm and its mathematic model, and then we put forward a novel approach to solve the shortest-path routing problem with the ant algorithm. Finally we set up an experiment to testify the validity and efficiency of our approach.
Blood vessels in ophthalmoscope images play an important role in diagnosis of some serious pathologies on retinal images. Hence, accurate extraction of vessels is becoming a main topic of this research area. Matched f...
详细信息
Blood vessels in ophthalmoscope images play an important role in diagnosis of some serious pathologies on retinal images. Hence, accurate extraction of vessels is becoming a main topic of this research area. Matched filter (MF) implementation for blood vessel detection is one of the methods giving more accurate results. Using this filter alone might not recover all the vessels (especially the capillaries). In this paper, a novel approach (MF/ant algorithm) is proposed to overcome the deficiency of the MF. The proposed method is a hybrid model of matched filter and ant colony algorithm. In this work, the accuracy and parameters of the hybrid algorithm are also discussed. The proposed method shows its success using the well known reference ophthalmoscope images of DRIVE database. (C) 2009 Elsevier Ireland Ltd. All rights reserved.
暂无评论