Assignment Problem Based on Improved Ant Colony Algorithm

Zhi’e Gao; Gong Jing Zhang

doi:10.4028/www.scientific.net/AMM.55-57.356

Paper Titles

A Methodology of Data Translation for Collaborative Design
p.337

Effect of Blade Numbers on Pressure Drop of Axial Cyclone Separators by CFD
p.343

Effect of Pressure on Microstructure and Properties of High Silicon Electrical Steel by EB-PVD
p.348

Phase Composition and Magnetic Structure of High Silicon Electrical Steel by EB-PVD
p.352

Assignment Problem Based on Improved Ant Colony Algorithm
p.356

Research on Materialized View Selection in the Data Warehouse
p.361

Blind Source Separation of Convolutive Mixtures by Using Time-Delayed Statistics and Exact Diagonalization
p.367

The Dependence of Corrosion Resistance of Ni-Cr-Mo-Cu Alloy to NaOH Solution on 4Cr/ (2Mo+Cu)
p.374

Researched on the Corrosion Resistance of Ni-Cr-Mo-Cu Alloy to Aqueous Change with the APF in Regular Way: an Approach of Quantum Electrochemistry
p.378

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 55-57Assignment Problem Based on Improved Ant Colony...

Assignment Problem Based on Improved Ant Colony Algorithm

Abstract:

Assignment problem is a combinatorial optimization problem.In this paper,a improved ant colony algorithm is proposed to solve the assignment problem.According to the rule of state-shift and strategty of updating pheromone, parameters of the ant colony Algorithm are optimized and changed,the best solution can be found rapidly,the simulative results show that the improvement strategies can well improve convergence speed and quality.

You might also be interested in these eBooks

Recent Trends in Materials and Mechanical Engineering Materials, Mechatronics and Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 55-57)

Pages:

356-360

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.55-57.356

Citation:

Cite this paper

Online since:

May 2011

Authors:

Zhi’e Gao, Gong Jing Zhang

Keywords:

Ant Colony Algorithm (ACA), Assignment Problem, Dynamic Change, Optimize Parameter

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] D.Q. Gu,L. Zuo and T.Q. H: The problem existed and improved method of Hungarian [J]. Computer Development, vo13, no. 4(2003), pp.76-78.

Google Scholar

[2] Akyildiz 1F, Pompili D, Melodia T: Underwater Acoustic Sensor Networks; Research Challenges[J]. Ad Hoc Networks, vol. 3, no. 3. (2005), pp.257-279.

DOI: 10.1016/j.adhoc.2005.01.004

Google Scholar

[3] R. Huang: The Ant Colony Algorithm solving assigment problem[J]. Xi'an Institute of Posts and Telecommunications, vol. 11, no. 3(2006), pp.106-119.

Google Scholar

[4] Renkun Yin, Yang Wu and Jingwei Zhang: Research and Application of the Ant colony algorithm for assignment problem, vo30, no. 4. (2008), pp.43-46.

Google Scholar

[5] Dorigo MCaro G D: The ant colony optimization Metaheuristic[M]/New Ideas in Optimization(1999), pp.1-27.

Google Scholar

[6] Haibing , Duan: The Principle and Application of Ant Colony Algorithm, Science Press. (2006).

Google Scholar

[7] L. E, Fateta B: Diversity and adaptation in populations of clust. ering ants. In: Proceedings of the International Conference on Simulation of Adaptive Behavior: From Animals to Animats, (Chapter 3), MIT Press/Bradford Books, Cambridge, MA(1994).

Google Scholar

[8] S. Y Li, (2009). Ant Colony Algorithm And Its Application [M]. Institute of Ha'erbin Technology Press.

Google Scholar

[9] Zhi-wei Ye and Zhao-bao Zheng. (2008). Research parametersα, β, ρ of Ant colony algorithm[J], Wuhan University Journal of Information Sciences, vol. 7, no. 29, pp.597-601.

Google Scholar