PROBLEM AND ALGORITHM FINE-TUNING - A Case of Study using Bridge Club and Simulated Annealing

Nelson Rangel-Valdez, Jose Torres-Jimenez, Josue Bracho-Rios, Pedro Quiz-Ramos

2009

Abstract

Sometimes, it is difficult to cope with a good set of values for the parameters of an algorithm that solves an specific optimization problem. This work presents a methodology for fine-tuning the parameters of a Simulated Annealing (SA) algorithm solving the Bridge Club (BC) problem. The methodology uses Covering Arrays as a tool that evaluates a set of values for the parameters of the SA so that it achieves its best performance when solving BC. The results in the experiments performed show that, using this methodology, the SA reached the optimal solution of the BC problem with a relatively small number of evaluations, in comparison with other strategies that solves BC.

References

  1. Barr, R., Golden, B., Kelly, J., Resende, M., W.R., and Jr., S. (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1(1):9-32.
  2. Díaz, B. A. and Laguna, M. (2006). Fine-tuning of algorithms using fractional experimental designs and local search. Operations Research, 54(1):99-114.
  3. Elenbogen, B. and Maxim, B. (1992). Scheduling a bridge club (a case study in discrete optimization). Mathematics Magazine, 65(1):18-26.
  4. Fidanova, S., Alba, E., and Molina, G. (2009). Memetic simulated annealing for the gps surveying problem. pages 281-288.
  5. Fink, A. and S., V. (2002). Optimization Software Class Libraries. Operations Research/Computer Science Interfaces Series. Boston, Massachusetts.
  6. Kirkpatrick, S. (1983). Optimization by simulated annealing. Science, 220(4598):671-680.
  7. Kreher, D., Royle, G., and Wallis, W. (1996). A family of resolvable regular graph designs. Discrete Math., 156(1-3):269-275.
  8. Laarhoven, P. J. M. and Aarts, E. H. L., editors (1987). Simulated annealing: theory and applications. Kluwer Academic Publishers, Norwell, MA, USA.
  9. Lopez-Escogido, D., Torres-Jimenez, J., Rodriguez-Tello, E., and Rangel-Valdez, N. (2008). Strength two covering arrays construction using a sat representation. In LNCS 5317/2008, pages 44-53.
  10. Morales, L. (1997). Scheduling a bridge club by tabu search. Mathematics Magazine, 70(4):287-290.
  11. Simpson, R. (1997). Scheduling a bridge club using a genethic algorithm. Mathematics Magazine, 70(4):281-286.
  12. Taguchi, G. (1994). Taguchi Methods: Design of Experiments. American Supplier Institute.
Download


Paper Citation


in Harvard Style

Rangel-Valdez N., Torres-Jimenez J., Bracho-Rios J. and Quiz-Ramos P. (2009). PROBLEM AND ALGORITHM FINE-TUNING - A Case of Study using Bridge Club and Simulated Annealing . In Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009) ISBN 978-989-674-014-6, pages 302-305. DOI: 10.5220/0002321303020305


in Bibtex Style

@conference{icec09,
author={Nelson Rangel-Valdez and Jose Torres-Jimenez and Josue Bracho-Rios and Pedro Quiz-Ramos},
title={PROBLEM AND ALGORITHM FINE-TUNING - A Case of Study using Bridge Club and Simulated Annealing},
booktitle={Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)},
year={2009},
pages={302-305},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002321303020305},
isbn={978-989-674-014-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)
TI - PROBLEM AND ALGORITHM FINE-TUNING - A Case of Study using Bridge Club and Simulated Annealing
SN - 978-989-674-014-6
AU - Rangel-Valdez N.
AU - Torres-Jimenez J.
AU - Bracho-Rios J.
AU - Quiz-Ramos P.
PY - 2009
SP - 302
EP - 305
DO - 10.5220/0002321303020305