Abstract
In this article a new method to obtain the control parameters values for the Threshold Accepting algorithm is presented, which is independent of the problem domain and size. This approach differs from the traditional methods that require knowing first the problem domain, and then knowing how to select the parameters values to solve specific problem instances. The proposed method is based on a sample of problem instances, whose solution allows us to characterize the problem and to define the parameters. To test the method the combinatorial optimization model called DFAR was solved using the Threshold Accepting algorithm. The experimental results show that it is feasible to automatically obtain the parameters for a heuristic algorithm, which will produce satisfactory results, even though the kind of problem to solve is not known. We consider that the proposed method principles can be applied to the definition of control parameters for other heuristic algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., and Teller, E.: Equation of State Calculations by Fasting Computing Machines. J. Chemical Phys., Vol. 21, (1953).
Ceri, S., Pelagatti, G.: Distributed Databases: Principles & Systems. McGraw-Hill, New York (1984).
Dueck, G., Scheuer, T.: Threshold Accepting: a General Purpose optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational Physics, Vol. 90 (1990) 161–175.
Beasley, J.F., Dowsland, K., Glover, F., Laguna, M.: Modern Heuristic Techniques for Combinatorial Problems. Colin R. Reeves, New York (1993).
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: optimization by Simulated Annealing. Science 220 (1983) 671–680.
March, S.T., Rho, S.: Allocating Data and operations to Nodes in Distributed Database Design. Transactions on Knowledge and Data Engineering, Vol. 7, No. 2 (1995).
Morales, L., Garduño, R., Romero, D.: The Multiple-Minima Problem in Small Peptides Revisited: the Threshold Accepting Approach. Journal of Biomolecular Structure & Dynamics, Vol. 9, No. 5 (1992)951–957.
Adler, D.: Genetic Algorithms and Simulated Annealing: a Marriage Proposal. IEEE International Conference on Neural Networks (1993) 1104–1109.
Pérez, J., Pazos, R., Frausto, J., Ramírez, S., Reyes, F.: Dynamic Allocation of Vertical Fragments in Distributed Databases Using the Threshold Accepting Algorithm. Proceedings of 10th IASTED International Conference on Parallel and Distributed Computing and Systems, Las Vegas (1998) 210–213.
Telley, H., Liebling, Th.M., Mocellin, A.: Reconstruction of Polycrystalline Structures: a New Application of Combinatorial optimization. Journal Computing, Vol. 38 (1987) 1–11.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joaquín, P., Rodolfo, P., Laura, V., Rodríguez, G. (2002). Automatic Generation of Control Parameters for the Threshold Accepting Algorithm. In: Coello Coello, C.A., de Albornoz, A., Sucar, L.E., Battistutti, O.C. (eds) MICAI 2002: Advances in Artificial Intelligence. MICAI 2002. Lecture Notes in Computer Science(), vol 2313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46016-0_13
Download citation
DOI: https://doi.org/10.1007/3-540-46016-0_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43475-7
Online ISBN: 978-3-540-46016-9
eBook Packages: Springer Book Archive