By Topic

A new method for multi-objective optimization problem based on multi-ant-colony algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daohua Liu ; Sch. of Comput. & Inf. Technol., Xinyang Normal Univ., Xinyang, China ; Gongping Chen

In order to improve the solving performance of multi-objective optimization problem, a new method based on multi-ant-colony algorithms is proposed. Aiming to enhance the diversity of pareto solutions, quasi-pareto solutions are constructed by sub-ant-colony algorithm which adopts its own and other sub-ant-colony heuristic information and quasi-pareto solutions obtained by every ant are used for control judgment. The constructed farther-group ants with the quasi-pareto solutions which act as space nodes constitute TSP(Traveling Salesman Problem), and then the solutions of the TSP act as the front of solutions for multi-objective optimization problem, hence lead to the enhancement of the uniform distribution of pareto solutions. Experiment results show that the obtained pareto solutions by multi-ant-colony optimization based on multi-classification methods have many advantages, such as the diversity and uniform distribution of solutions.

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:7 )

Date of Conference:

22-24 Oct. 2010