skip to main content
10.1145/1570256.1570301acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
technical-note

Using performance fronts for parameter setting of stochastic metaheuristics

Published:08 July 2009Publication History

ABSTRACT

In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multi-objective problem. The so-called "performance fronts" presented in this work are a collection of non-dominated parameters sets, satisfying both a speed and a precision objective. Experiments are conducted using a multi-objective evolutionary algorithm, in order to: (i) set a parameter of several continuous metaheuristics, and (ii) set parameters of an hybrid algorithm for temporal planning.

Our results suggest that the performance fronts are well suited for setting the parameters of stochastic metaheuristics. The relative position, in the objective space, of several parameter fronts also permits to compare metaheuristics on a given problem. Moreover, this approach give insights on the algorithm behaviour.

References

  1. ]]T. Bartz-Beielstein. Experimental Research in Evolutionary Computation: The New Experimentalism. Natural Computing Series. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. ]]T. Bartz-Beielstein, C. W. G. Lasarczyk, and M. Preuss. Sequential parameter optimization. volume 1, pages 773--780, 2005.Google ScholarGoogle Scholar
  3. ]]M. Birattari, T. Stutzle, L. Paquete, and K. Varrentrapp. A racing algorithm for configuring metaheuristics. In GECCO '02: Proceedings of the Genetic and Evolutionary Computation Conference, pages 11--18, San Francisco, CA, USA, 2002. Morgan Kaufmann Publishers Inc.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. ]]S. Cahon, N. Melab, and E. G. Talbi. Paradiseo: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics, 10(3):357--380, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. ]]J. Clune, S. Goings, B. Punch, and E. Goodman. Investigations in meta-gas: panaceas or pipe dreams? In GECCO '05: Proceedings of the 2005 workshops on Genetic and evolutionary computation, pages 235--241, New York, NY, USA, 2005. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. ]]J. Dreo. Multi-criteria meta-parameter tuning for mono-objective stochastic metaheuristics. In 2nd International Conference on Metaheuristics and Nature Inspired Computing, October 2008.Google ScholarGoogle Scholar
  7. ]]J. Dreo, J.-P. Aumasson, W. Tfaili, and P. Siarry. Adaptive learning search, a new tool to help comprehending metaheuristics. International Journal on Artificial Intelligence Tools, 16(3), june 2007.Google ScholarGoogle Scholar
  8. ]]J. Dreo and P. Siarry. Stochastic metaheuristics as sampling techniques using swarm intelligence. I-Tech Education and Publishing, December 2007.Google ScholarGoogle ScholarCross RefCross Ref
  9. ]]F. G. Lobo, C. F. Lima, and Z. Michalewicz, editors. Parameter Setting in Evolutionary Algorithms, volume 54 of Studies in Computational Intelligence. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. ]]D. Long and M. Fox. The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20:1--59, 2003. Google ScholarGoogle ScholarCross RefCross Ref
  11. ]]V. Nannen, S. K. Smit, and A. E. Eiben. Costs and benefits of tuning parameters of evolutionary algorithms. In Proceedings of the 10th international conference on Parallel Problem Solving from Nature, pages 528--538, Berlin, Heidelberg, 2008. Springer-Verlag.Google ScholarGoogle ScholarCross RefCross Ref
  12. ]]M. Schoenauer, P. Saveant, and V. Vidal. Divide-and-evolve: A new memetic scheme for domain-independent temporal planning. pages 247--260. 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. ]]H.-P. P. Schwefel. Evolution and Optimum Seeking: The Sixth Generation. John Wiley & Sons, Inc., New York, NY, USA, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Using performance fronts for parameter setting of stochastic metaheuristics

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
      July 2009
      1760 pages
      ISBN:9781605585055
      DOI:10.1145/1570256

      Copyright © 2009 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 July 2009

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • technical-note

      Acceptance Rates

      Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader