By Topic

An Ant Colony Algorithm with Tabu Search and its Application

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)
Wei Zhang-liang ; Gansu Normal Coll. for Nat., Hezuo, China ; Li Yue-guang

The study aims at Supermarket Distribution Problem, a mathematical model is constructed and an ant colony algorithm with tabu search is put forward. The algorithm is tested in combination with Supermarket Distribution Problem. The experimental results indicated that the algorithm solves Supermarket Distribution Problem effectively with quick convergence, avoids local optimum, high precision solution characteristics.

Published in:

Intelligent Computation Technology and Automation (ICICTA), 2011 International Conference on  (Volume:2 )

Date of Conference:

28-29 March 2011