Research on MPI-Based Parallel Max-Min Ant System

Yu Liu; Guo Dong Wu

doi:10.4028/www.scientific.net/AMM.198-199.1321

Paper Titles

Design and Study on the Automatic Extrusion Device for Curved Chassis of Vibratory Feeder
p.1298

Design of Measuring System of Sewage in Pipeline
p.1302

Design of a WiMedia/MBOA 0.13μm CMOS Front-End
p.1306

Differential Autoregressive of Cycle Prediction Model and its Application
p.1315

Research on MPI-Based Parallel Max-Min Ant System
p.1321

Research on Optimization Method of S&T Projects Base on Fuzzy AHP
p.1327

A Multi-Classification Method Based on Gaussian Processes
p.1333

A New Global Guides Selecting Strategy in Pareto Based MOPSO
p.1338

Finding Out Biological Terms from Texts with CRFs for Reinforcement Learning
p.1345

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 198-199Research on MPI-Based Parallel Max-Min Ant System

Research on MPI-Based Parallel Max-Min Ant System

Abstract:

When solving large scale combinatorial optimization problems, Max-Min Ant System requires long computation time. MPI-based Parallel Max-Min Ant System described in this paper can ensure the quality of the solution, as well as reduce the computation time. Numerical experiments on the multi-node cluster system show that when solving the traveling salesman problem, MPI-based Parallel Max-Min Ant System can get better computational efficiency.

You might also be interested in these eBooks

Applied Mechanics, Mechatronics Automation & System Simulation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 198-199)

Pages:

1321-1326

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.198-199.1321

Citation:

Cite this paper

Online since:

September 2012

Authors:

Yu Liu, Guo Dong Wu

Keywords:

Ant Colony Algorithm (ACA), Message Passing Interface (MPI), Parallel Max-Min Ant System (PMMAS), Traveling Salesman Problem (TSP)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M. Dorigo, L.M. Gambardella: IEEE Transcations on Volutionary Computation, Vol. 1 (1997), p.53.

Google Scholar

[2] T. Stuetzle, H. Hoos: Future Generation Computer Systems, Vol. 16 (2000), No. 19, p.889.

Google Scholar

[3] Dong Liu, Jing Chang, Wenhong Wei and Jie Zhao: Journal of Guangdong University of Technology, Vol. 25 (2008), No. 1, p.38 (In Chinese).

Google Scholar

[4] Caiyun Liu, Zhong Chen, Jie Xiong: Computer Engineering, Vol 36 (2010), No. 19, p.200 (In Chinese).

Google Scholar

[5] S. Benkner, K.F. Doerner, R.F. Hartl, G. Kiechle and M. Lucka: Proc. of PAR'04 Workshop on State-of-the-art in Scientific Computing (Lyngby, Denmark, June 20-23, 2004), p.3.

Google Scholar

[6] Lei Wang, Han Cao and Changying Wang: Computer Engineering, Vol. 37 (2011), No. 12, p.170 (In Chinese).

Google Scholar

[7] M. Middendorf, F. Reischel and H. Schmech: Journal of Heuristics, Vol. 8 (2002), No. 3, p.305.

Google Scholar

[8] Yunshi Xiao, Binyu Li and Qidi Wu: Control and Decision, Vol. 19 (2004), No. 8, p.885 (In Chinese).

Google Scholar

[9] Lei Deng, Yongli Zhu and Lei Zhang: Electric Power Science and Engineering, Vol. 27 (2011), No. 3, p.18 (In Chinese).

Google Scholar

[10] Wusheng Zhang, Wei Xue, Jianjiang Li and Weiming Zheng: Example Tutorial of MPI Parallel Programming, Beijing, (Tsinghua Unversity Press, China 2009) (In Chinese).

Google Scholar