Parallel Max-Min Ant System Using MapReduce
Ant colony optimization algorithms have been successfully applied to solve many problems. However, in some large scale optimization problems involving large amounts of data, the optimization process may take hours or even days to get an excellent solution. Developing parallel optimization algorithms is a common way to tackle with this issue. In this paper, we present a MapReduce Max-Min Ant System (MRMMAS), a MMAS implementation based on the MapReduce parallel programming model. We describe MapReduce and show how MMAS can be naturally adapted and expressed in this model, without explicitly addressing any of the details of parallelization. We present benchmark travelling salesman problems for evaluating MRMMAS. The experimental results demonstrate that the proposed algorithm can scale well and outperform the traditional MMAS with similar running times.
KeywordsAnt colony optimization MMAS Parallel MMAS Travelling salesman problem MapReduce Hadoop
Unable to display preview. Download preview PDF.
- 4.Bernd, B., Gabriel, E.K., Christine, S.: Parallel Strategies for the Ant System. University of Vienna, Vienna (1997)Google Scholar
- 5.Jeffrey, D., Sanjay, G.: MapReduce: Simplified Data Processing on Large Clusters. Communications of the ACM 51, 107–113 (2008)Google Scholar
- 7.Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Harlow (2003)Google Scholar