Application of Ant Colony Algorithm Based on Optimization Parameters in Equipment Material Transport

2013 ◽  
Vol 756-759 ◽  
pp. 3487-3491
Author(s):  
Xi Li ◽  
Li Yun Chen ◽  
Ai Zhen Liu ◽  
Sen Liu
Keyword(s):  
Genetic Algorithm ◽  
Path Length ◽  
Ant Colony Algorithm ◽  
Computation Time ◽  
Path Selection ◽  
Ant Colony ◽  
Performance Parameters ◽  
Material Transport ◽  
Optimization Parameters

In order to solve the path selection problem in the transport of equipment and materials, while improving the quality of solutions, this paper uses ant colony algorithm based on optimization parameters to achieve. Through genetic algorithm to solve the parameters of ant colony algorithm, resulting in a better performance parameters. The experimental results show that ant colony algorithm based on optimization parameters has been improved on path length and computation time than the traditional ant colony algorithm.

scholarly journals Research on the Uncertainty Decision Model of the Regional Collaborative Innovation System Based on an Improved Ant Colony Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-10
Author(s):  
Xiaona Zhang ◽  
Fayin Wang
Keyword(s):  
Decision Model ◽  
Ant Colony Algorithm ◽  
Innovation System ◽  
Path Selection ◽  
Collaborative Optimization ◽  
Ant Colony ◽  
Evaluation Index System ◽  
Regional Innovation ◽  
Collaborative Innovation ◽  
Improved Ant Colony Algorithm

The regional collaborative innovation system is a nonlinear complex system, which has obvious uncertainty characteristics in the aspects of member selection and evolution. Ant colony algorithm, which can do the uncertainty collaborative optimization decision-making, is an effective tool to solve the uncertainty decision path selection problem. It can improve the cooperation efficiency of each subsystem and achieve the goal of effective cooperation. By analysing the collaborative evolution mechanisms of the regional innovation system, an evaluation index system for the regional collaborative innovation system is established considering the uncertainty of collaborative systems. The collaborative uncertainty decision model is constructed to determine the regional innovation system’s collaborative innovation effectiveness. The improved ant colony algorithm with the pheromone evaporation model is applied to traversal optimization to identify the optimal solution of the regional collaborative innovation system. The collaboration capabilities of the ant colony include pheromone diffusion so that local updates are more flexible and the result is more rational. Finally, the method is applied to the regional collaborative innovation system.

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 A Heuristics-Based Parthenogenetic Algorithm for the VRP with Potential Demands and Time Windows

2016 ◽  
Vol 2016 ◽  
pp. 1-12
Author(s):  
Chenghua Shi ◽  
Tonglei Li ◽  
Yu Bai ◽  
Fei Zhao
Keyword(s):  
Genetic Algorithm ◽  
Time Windows ◽  
Computation Time ◽  
Routing Problem ◽  
Split Delivery ◽  
Soft Time Windows ◽  
Comparison Results ◽  
Potential Demand ◽  
The Cost

We present the vehicle routing problem with potential demands and time windows (VRP-PDTW), which is a variation of the classical VRP. A homogenous fleet of vehicles originated in a central depot serves customers with soft time windows and deliveries from/to their locations, and split delivery is considered. Also, besides the initial demand in the order contract, the potential demand caused by conformity consuming behavior is also integrated and modeled in our problem. The objective of minimizing the cost traveled by the vehicles and penalized cost due to violating time windows is then constructed. We propose a heuristics-based parthenogenetic algorithm (HPGA) for successfully solving optimal solutions to the problem, in which heuristics is introduced to generate the initial solution. Computational experiments are reported for instances and the proposed algorithm is compared with genetic algorithm (GA) and heuristics-based genetic algorithm (HGA) from the literature. The comparison results show that our algorithm is quite competitive by considering the quality of solutions and computation time.

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.

scholarly journals Ant Colony Algorithm for Determining Dynamic Travel Routes Based on Traffic Information from Twitter

2019 ◽  
Vol 125 ◽  
pp. 23012
Author(s):  
Edy Subowo ◽  
Eko Sediyono ◽  
Farikhin
Keyword(s):  
Ant Colony Algorithm ◽  
Fire Suppression ◽  
Computation Time ◽  
Ant Colony ◽  
Training Data ◽  
Traffic Information ◽  
Support Vector ◽  
Weighting Method ◽  
Shortest Distance ◽  
Simple Additive Weighting

Combining the search method for fire suppression routes with ant colony algorithms and methods of analyzing twitter events on the highway is the basis of the problems to be studied. The results of the twitter data feature extraction are classified with Support Vector Machine after it is implemented in the Simple Additive Weighting method in calculating path weights with criteria of distance, congestion, multiple branching, and many holes. Line weights are also used as initial pheromone values. The C-means method is used to group the weights of each path and distance so that the path with the lowest weight and the shortest distance that will be simulated using the Ant Colony. The validation results with cross fold on SVM with linear kernels produce the greatest accuracy value is 97.93% for training data distribution: test data 6: 4. The simulation of the selection of the damkar car path from Feather to Pleburan with Ant Colony obtained 50 seconds of computation time, whereas with Ant Colony with Clustering the computation time was 15, resulting in a reduction in computing of 35. Ant colony with MinMax optimization gives the best computation time of 14.47 seconds with 100 iterations and 10 nodes.

Sign in / Sign up

Export Citation Format

Share Document