scholarly journals Ant Colony Optimization with Three Stages for Independent Test Cost Attribute Reduction

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Zilong Xu ◽  
Hong Zhao ◽  
Fan Min ◽  
William Zhu
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Optimization ◽  
Heuristic Algorithms ◽  
Information Gain ◽  
Attribute Reduction ◽  
Ant Colony ◽  
Test Cost ◽  
Cost Attribute ◽  
Three Stages ◽  
Filtration Stage

Minimal test cost attribute reduction is an important problem in cost-sensitive learning. Recently, heuristic algorithms including the information gain-based algorithm and the genetic algorithm have been designed for this problem. However, in many cases these algorithms cannot find the optimal solution. In this paper, we develop an ant colony optimization algorithm to tackle this problem. The attribute set is represented as a graph with each vertex corresponding to an attribute and weight of each edge to pheromone. Our algorithm contains three stages, namely, the addition stage, the deletion stage, and the filtration stage. In the addition stage, each ant starts from the initial position and traverses edges probabilistically until the stopping criterion is satisfied. The pheromone of the traveled path is also updated in this process. In the deletion stage, each ant deletes redundant attributes. Two strategies, called the centralized deletion strategy and the distributed deletion strategy, are proposed. Finally, the ant with minimal test cost is selected to construct the reduct in the filtration stage. Experimental results on UCI datasets indicate that the algorithm is significantly better than the information gain-based one. It also outperforms the genetic algorithm on medium-sized dataset Mushroom.

FAST RANDOMIZED ALGORITHM FOR MINIMAL TEST COST ATTRIBUTE REDUCTION

2014 ◽  
Vol 21 (06) ◽  
pp. 1450028
Author(s):  
JINGKUAN LI ◽  
FAN MIN ◽  
WILLIAM ZHU
Keyword(s):  
Heuristic Algorithms ◽  
Information Gain ◽  
Attribute Reduction ◽  
Randomized Algorithm ◽  
Mining Machine ◽  
Test Cost ◽  
Cost Attribute ◽  
Preprocessing Technique ◽  
Two Parameters ◽  
Np Hardness

Attribute reduction is a key data preprocessing technique, and has been widely studied in data mining, machine learning, and granular computing. Minimal test cost attribute reduction is one of important parts researched in cost-sensitive learning. The backtracking algorithm can obtain an optimal reduct, however on only small datasets due to the NP-hardness of the problem. Heuristic algorithms, such as the genetic one and the information gain based one, are employed to deal with this problem. In this paper, we propose the Fast Randomized Algorithm to obtain a satisfactory reduct more efficiently. The focus of the algorithm is a randomization mechanism that deals with attributes addition and deletion. There are two important parameters in the addition stage, namely the selecting probability of attributes and the number of selected attributes per batch. We obtain some appropriate parameter settings through experiments in a variety of datasets. Results show that the optimal settings of two parameters rarely change on different datasets. Our algorithm is more stable and significantly more efficient than existing heuristic ones.

Ant Colony Optimization for Factory Layout

2012 ◽  
Vol 591-593 ◽  
pp. 758-761
Author(s):  
Xiu Zeng ◽  
Qian Li Ma
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Ant Colony Optimization ◽  
Heuristic Algorithms ◽  
Mean Value ◽  
Ant Colony ◽  
Logistics Cost ◽  
The Mean ◽  
Factory Layout ◽  
Np Problem

Factory layout is NP problem[1]. There are many methods to solve it ,such as engineering diagram, flow chart method, various heuristic algorithms, SA( simulated annealing) and GA(genetic algorithm) [2].ACO (ant colony optimization) is used to solve it in this paper. The logistics costs exist between two workshops that are treated as pheromone that guides ants to search the best solution. Smaller logistics cost is, stronger the two workshops of relation is. In the process of optimization theworkshop with low logistics cost is more likely to be chosen, which minimizes the system logistics cost. Compared with GA, ACO has the advantage in speed. The mean value of the solution, the best solution, the worst solution is better too. More the number of workshop is, more obvious the superiority is.

scholarly journals Ant Colony Optimization and Genetic Algorithm for Fuzzy Stochastic Production-Distribution Planning

2018 ◽  
Vol 8 (11) ◽  
pp. 2042 ◽  
Author(s):  
Umit Sami SAKALLI ◽  
Irfan ATABAS
Keyword(s):  
Genetic Algorithm ◽  
Mathematical Model ◽  
Ant Colony Optimization ◽  
Heuristic Algorithms ◽  
Ant Colony ◽  
Route Optimization ◽  
Test Problems ◽  
Np Hard ◽  
Distribution Planning ◽  
Production Distribution

In this paper, a tactical Production-Distribution Planning (PDP) has been handled in a fuzzy and stochastic environment for supply chain systems (SCS) which has four echelons (suppliers, plants, warehouses, retailers) with multi-products, multi-transport paths, and multi-time periods. The mathematical model of fuzzy stochastic PDP is a NP-hard problem for large SCS because of the binary variables which determine the transportation paths between echelons of the SCS and cannot be solved by optimization packages. In this study, therefore, two new meta-heuristic algorithms have been developed for solving fuzzy stochastic PDP: Ant Colony Optimization (ACO) and Genetic Algorithm (GA). The proposed meta-heuristic algorithms are designed for route optimization in PDP and integrated with the GAMS optimization package in order to solve the remaining mathematical model which determines the other decisions in SCS, such as procurement decisions, production decisions, etc. The solution procedure in the literature has been extended by aggregating proposed meta-heuristic algorithms. The ACO and GA algorithms have been performed for test problems which are randomly generated. The results of the test problem showed that the both ACO and GA are capable to solve the NP-hard PDP for a big size SCS. However, GA produce better solutions than the ACO.

Sign in / Sign up

Export Citation Format

Share Document