scholarly journals Research on Optimal Matching Scheme of Public Resource Management Based on the Computational Intelligence Model

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Linna Li ◽  
Renjun Liu
Keyword(s):  
Genetic Algorithm ◽  
Human Resources ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Time Consumption ◽  
Public Resource ◽  
Public Resources ◽  
Benefit Function ◽  
The Cost ◽  
Better Than

The management of public resources means that people’s governments at all levels and other public administrative subjects should use certain means and methods, follow certain principles, rationally allocate and utilize public resources, and maximize their functions and benefits. Under the background of limited human resources, this study adheres to the principle of maximizing the benefits of human resources and rationally allocates the use of human resources. In this study, this kind of resource allocation problem is regarded as a linear programming problem by specifying the benefit function, and then, genetic algorithm, ant colony algorithm, and hybrid genetic-ant colony algorithm are used to solve the problem; the cost and time consumption of different algorithms under different scales are evaluated. Finally, it is found that genetic algorithm is superior to ant colony algorithm when the task scale is small and the effect of genetic algorithm is lower than ant colony algorithm with the expansion of task scale, whereas the improved hybrid genetic-ant colony algorithm is better than ordinary algorithm in general.

An Improved Ant Colony Optimization Algorithm for Solving the TSP Problem

2010 ◽  
Vol 26-28 ◽  
pp. 620-624 ◽  
Author(s):  
Zhan Wei Du ◽  
Yong Jian Yang ◽  
Yong Xiong Sun ◽  
Chi Jun Zhang ◽  
Tuan Liang Li
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Convergence Time ◽  
Ant Colony Optimization Algorithm ◽  
Data Set ◽  
Research Attention ◽  
Simply Supported ◽  
Source Data

This paper presents a modified Ant Colony Algorithm(ACA) called route-update ant colony algorithm(RUACA). The research attention is focused on improving the computational efficiency in the TSP problem. A new impact factor is introduced and proved to be effective for reducing the convergence time in the RUACA performance. In order to assess the RUACA performance, a simply supported data set of cities, which was taken as the source data in previous research using traditional ACA and genetic algorithm(GA), is chosen as a benchmark case study. Comparing with the ACA and GA results, it is shown that the presented RUACA has successfully solved the TSP problem. The results of the proposed algorithm are found to be satisfactory.

Simulation of English text recognition model based on ant colony algorithm and genetic algorithm

2021 ◽  
pp. 1-12
Author(s):  
Fei Long
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Text Recognition ◽  
English Text ◽  
Recognition Model ◽  
Central Node ◽  
Model Based ◽  
Characteristic Points

The difficulty of English text recognition lies in fuzzy image text classification and part-of-speech classification. Traditional models have a high error rate in English text recognition. In order to improve the effect of English text recognition, guided by machine learning ideas, this paper combines ant colony algorithm and genetic algorithm to construct an English text recognition model based on machine learning. Moreover, based on the characteristics of ant colony intelligent algorithm optimization, a method of using ant colony algorithm to solve the central node is proposed. In addition, this paper uses the ant colony algorithm to obtain the characteristic points in the study area and determine a reasonable number, and then combine the uniform grid to select some non-characteristic points as the central node of the core function, and finally use the central node with a reasonable distribution for modeling. Finally, this paper designs experiments to verify the performance of the model constructed in this paper and combines mathematical statistics to visually display the experimental results using tables and graphs. The research results show that the performance of the model constructed in this paper is good.

scholarly journals Clustering Control of Multi-Objective Problems with Application to E-commerce

2018 ◽  
Vol 1 (1) ◽  
pp. 41
Author(s):  
Liang Chen ◽  
Xingwei Wang ◽  
Jinwen Shi
Keyword(s):  
Ant Colony Algorithm ◽  
Time Window ◽  
Ant Colony ◽  
Distribution Area ◽  
Routing Problem ◽  
Logistics Distribution ◽  
Multi Objective ◽  
The Cost ◽  
Vehicle Capacity ◽  
Cost Of Transportation

In the existing logistics distribution methods, the demand of customers is not considered. The goal of these methods is to maximize the vehicle capacity, which leads to the total distance of vehicles to be too long, the need for large numbers of vehicles and high transportation costs. To address these problems, a method of multi-objective clustering of logistics distribution route based on hybrid ant colony algorithm is proposed in this paper. Before choosing the distribution route, the customers are assigned to the unknown types according to a lot of customers attributes so as to reduce the scale of the solution. The discrete point location model is applied to logistics distribution area to reduce the cost of transportation. A mathematical model of multi-objective logistics distribution routing problem is built with consideration of constraints of the capacity, transportation distance, and time window, and a hybrid ant colony algorithm is used to solve the problem. Experimental results show that, the optimized route is more desirable, which can save the cost of transportation, reduce the time loss in the process of circulation, and effectively improve the quality of logistics distribution service.

A Kind of Network Intrusion Detection Method Using Improved Support Vector Machine Based on Ant Colony Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2995-2998
Author(s):  
Xiaoqin Zhang ◽  
Guo Jun Jia
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Feature Extraction ◽  
Ant Colony Algorithm ◽  
Small Sample ◽  
Ant Colony ◽  
Support Vector ◽  
Algorithm Selection ◽  
Data Set ◽  
Network Intrusion

Support vector machine (SVM) is suitable for the classification problem which is of small sample, nonlinear, high dimension. SVM in data preprocessing phase, often use genetic algorithm for feature extraction, although it can improve the accuracy of classification. But in feature extraction stage the weak directivity of genetic algorithm impact the time and accuracy of the classification. The ant colony algorithm is used in genetic algorithm selection stage, which is better for the data pretreatment, so as to improve the classification speed and accuracy. The experiment in the KDD99 data set shows that this method is feasible.

The Research on VRP Based on Max-Min Ant Colony Algorithm

2011 ◽  
Vol 219-220 ◽  
pp. 1285-1288 ◽  
Author(s):  
Chang Min Chen ◽  
Wei Cheng Xie ◽  
Song Song Fan
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Search Time ◽  
Ant Colony ◽  
Local Optimum ◽  
Simulation Data ◽  
Routing Problem ◽  
Np Hard Problem ◽  
The Cost

Vehicle routing problem (VRP) is the key to reducing the cost of logistics, and also an NP-hard problem. Ant colony algorithm is a very effective method to solve the VRP, but it is easy to fall into local optimum and has a long search time. In order to overcome its shortcomings, max-min ant colony algorithm is adopted in this paper, and its simulation system is designed in GUI of MATLAB7.0. The results show that the vehicle routing problem can well achieves the optimization of VRP by accessing the simulation data of database.

Sign in / Sign up

Export Citation Format

Share Document