New heuristic algorithm for capacitated p-median proble

Author

Li, You-Mei ; Cao, Fei-Long

Author_Institution

Dept. of Comput. Sci., Shaoxing Coll. of Arts & Sci.

Volume

1

fYear

2006

fDate

16-18 Oct. 2006

Firstpage

1129

Lastpage

1131

Abstract

It is known that ant colony optimization (ACO) algorithm has been successfully applied to solve many combinatorial optimization problems, but for p-median problem little has been reported. In this article, a new heuristic is proposed for capacitated p-median problem. This algorithm adopts pheromone mechanism to learn the probability in which an object belongs to a median. Also a suitable classification method is designed based on the problem´s characteristics. At last, 10 benchmark problems are used to demonstrate the global optimization ability of the algorithm. The obtained results show that our algorithm is feasible and efficient

Keywords

combinatorial mathematics; optimisation; ant colony optimization; capacitated p-median problem; combinatorial optimization; heuristic algorithm; pheromone mechanism; Ant colony optimization; Art; Computer science; Design methodology; Educational institutions; Heuristic algorithms; Learning systems; Pattern classification; Portable media players; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on

Conference_Location

Jinan

Print_ISBN

0-7695-2528-8

Type

conf

DOI

10.1109/ISDA.2006.205

Filename

4021597