Abstract
In this paper we propose a parallel tabu search algorithm to solve the problem of the distributed database optimal logical structure synthesis. We provide a reader with information about the performance metrics of our parallel algorithm and the quality of the solutions obtained in comparison with the earlier developed consecutive algorithm and other methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kant, K., Mohapatra, P.: Internet Data Centers. Computer. IEEE Computer Society, Los Alamitos (2004) 0018-9162/04
Babkin, E., Petrova, M.: Application of genetic algorithms to increase an overall performance of artificial neural networks in the domain of synthesis DDBs optimal structures. In: Proc. of The 5th International Conference on Perspectives in Business Informatics Research (BIR 2006), Kaunas University of Technology, Lithuania, October 6-7. Information Techonology and Control, vol. 35(3A), pp. 285–294 (2006) ISSN: 1392-124X
Kulba, V.V., Kovalevskiy, S.S., Kosyachenko, S.A., Sirotyuck, V.O.: Theoretical backgrounds of designing optimum structures of the distributed databases. M.: SINTEG (1999)
Chakrapani, J., Skorin-Kapov, J.: Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research 41, 327–341 (1993)
Fiechter, C.-N.: A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics 51, 243–267 (1994)
Garcia, B.-L., et al.: A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers Ops. Res. 21(9), 1025–1033 (1994)
Porto Stella, C.S., Kitajima Joao Paulo, F.W., Ribeiro Celso, C.: Performance evaluation of a parallel tabu search task scheduling algorithm. Parallel Computing 26, 73–90 (2000)
Babkin, E., Karpunina, M.: Comparative study of the Tabu machine and Hopfield networks for discrete optimization problems. In: Proc. of the 14th International Conference on Information and Software Technologies, IT 2008, Kaunas, Lithuania, April 24-25, pp. 25–41 (2008), ISSN 2029-0020
Babkin, E., Karpunina, M.: The analysis of tabu machine parameters applied to discrete optimization problems. In: Proceedings of 2009 ACS/IEEE International Conference on Computer Systems and Aplications, AICCSA 2009, Rabat, Morocco, May 10-13, pp. 153–160. Sponsored by IEEE Computer Society, Arab Computer Society, and EMI, Morocco (2009) IEEE Catalog Number: CFP09283-CDR. ISBN: 978-1-4244-3806-8. Library of Congress: 200990028, http://www.congreso.us.es/aiccsa2009
Sun, M., Nemati, H.R.: Tabu Machine: A New Neural Network Solution Approach for Combinatorial Optimization Problems. Journal of Heuristics 9, 5–27 (2003)
Babkin, E., Karpunina, M.: About one method of DDBs structure synthesis based on the Hopfield artificial neural networks. In: Prokchorov, A.M. (ed.) Bulleten of Russian Academy of Engineering Science, Applied Mathematics and Mechanics, Moscow − Nizhny Novgorod: NSTU, vol. 12, pp. 37-46 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babkin, E., Karpunina, M., Aseeva, N. (2011). Parallel Tabu Search Algorithm for Data Structure Composition. In: Grabis, J., Kirikova, M. (eds) Perspectives in Business Informatics Research. BIR 2011. Lecture Notes in Business Information Processing, vol 90. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24511-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-24511-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24510-7
Online ISBN: 978-3-642-24511-4
eBook Packages: Computer ScienceComputer Science (R0)