Tuning the performance of the MMAS heuristic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4638 LNCS, Issue , 2007, Pages 46-60

  Ridge, Enda ^a   Kudenko, Daniel ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; TRAVELING SALESMAN PROBLEM;

DESIGN OF EXPERIMENT; MAX-MIN ANT SYSTEM; PERFORMANCE METRICS; RESPONSE SURFACE METHODOLOGY;

HEURISTIC METHODS;

EID: 38049153071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74446-7_4     Document Type: Conference Paper

References (23)

1. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge, MA (2004)
2. Czitrom, V.: One-Factor-at-a-Time versus Designed Experiments. The American Statistician 53(2), 126-131 (1999)
3. Stützle, T., Hoos, H.H.: Max-Min Ant System. Future Generation Computer Systems 16(8), 889-914 (2000)
4. Myers, R.H., Montgomery, D.C.: Response Surface Methodology. Process and Product Optimization Using Designed Experiments. John Wiley and Sons Inc. Chichester (1995)
5. Oehlert, G., Whitcomb, P.: Small, Efficient, Equireplicated Resolution V Fractions of 2K designs and their Application to Central Composite Designs. In: Proceedings of 46th Fall Technical Conference. American Statistical Association (2002)
6. Johnson, D.S.: A Theoretician's Guide to the Experimental Analysis of Algorithms. In: Proceedings of the Fifth and Sixth DIMACS Implementation Challenges (2002)
7. Zlochin, M., Dorigo, M.: Model based search for combinatorial optimization: a comparative study. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature PPSN VII. LNCS, vol. 2439, Springer, Heidelberg (2002)
8. Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming Series B 97(1-2), 91-153 (2003)
9. Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: The Traveling Salesman Problem and Its Variations, Kluwer Academic Publishers, Dordrecht (2002)
10. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, vol. 1, pp. 331-337. Morgan Kaufman, USA (1991)
11. Ridge, E., Kudenko, D.: An Analysis of Problem Difficulty for a Class of Optimisation Heuristics. In: Proceedings of EvoCOP '07. LNCS, vol. 4446, pp. 198-209. Springer, Heidelberg (2007)
12. Ostle, B.: Statistics in Research, 2nd edn. Iowa State University Press (1963)
13. Ridge, E., Kudenko, D.: Analyzing Heuristic Performance with Response Surface Models: Prediction, Optimization and Robustness. In: Proceedings of the Genetic and Evolutionary Computation Conference, ACM Press, New York (2007)
14. Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. Wiley (2005)
15. Derringer, G., Suich, R.: Simultaneous Optimization of Several Response Variables. Journal of Quality Technology 12(4), 214-219 (1980)
16. Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in Pascal: the art of scientific computing. Cambridge University Press (1989)
17. Adenso-Diaz, B., Laguna, M.: Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search. Operations Research 54(1), 99-114 (2006)
18. Coy, S., Golden, B., Runger, G., Wasil, E.: Using Experimental Design to Find Effective Parameter Settings for Heuristics. Journal of Heuristics 7(1), 77-97 (2001)
19. Park, M.W., Kim, Y.D.: A systematic procedure for setting parameters in simulated annealing algorithms. Computers and Operations Research 25(3) (1998)
20. Parsons, R., Johnson, M.: A Case Study in Experimental Design Applied to Genetic Algorithms with Applications to DNA Sequence Assembly. American Journal of Mathematical and Management Sciences 17(3), 369-396 (1997)
21. Birattari, M.: The Problem of Tuning Metaheuristics. Phd, Université Libre de Bruxelles (2006)
22. Gaertner, D., Clark, K.L.: On Optimal Parameters for Ant Colony Optimization Algorithms. In: Proceedings of the 2005 International Conference on Artificial Intelligence, vol. 1, pp. 83-89. CSREA Press (2005)
23. Ridge, E., Kudenko, D.: Sequential Experiment Designs for Screening and Tuning Parameters of Stochastic Heuristics. In: Workshop on Empirical Methods for the Analysis of Algorithms, Reykjavik, Iceland, pp. 27-34 (2006)