Multi-population binary ant colony optimization algorithm based on the distribution of food quantity

Author

Xiong Weiqing ; Wei Ping

Author_Institution

Inst. of Electron. Commerce & Logistics, Ningbo Univ., Ningbo, China

fYear

2011

fDate

22-24 July 2011

Firstpage

5387

Lastpage

5391

Abstract

Aimed at the binary ant colony optimization algorithm is easy to be trapped into the local optimization region. The multi-population binary ant colony optimization algorithm based on the distribution of food quantity (FMPBACO) is designed. The ant quantity and death of population is decided by the food quantity. Population learns from each other by the means of pheromones mixed. The complexity of the algorithm is analyzed. FMPBACO is applied in the 0/1 multi-knapsack problem, and solving the test set of SAC-94 Suite shows the performance of the algorithm.

Keywords

food technology; knapsack problems; optimisation; 0/1 multiknapsack problem; SAC-94 Suite; ant quantity; food quantity; multipopulation binary ant colony optimization algorithm; pheromones; population death; Algorithm design and analysis; Ant colony optimization; Complexity theory; Electronic mail; Logistics; Optimization; Presses; Binary Ant Colony Optimization Algorithm; Integer Programming; Multi-population; Multiple 0/1 Knapsack Problem; The Distribution of Food Quantity;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference (CCC), 2011 30th Chinese

Conference_Location

Yantai

ISSN

1934-1768

Print_ISBN

978-1-4577-0677-6

Electronic_ISBN

1934-1768

Type

conf

Filename

6000626