Mixed Tabu machine for portfolio optimization problem

References

• E.H.L. Aarts and J.H.M. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, Wiley, New York, 1989.
   Google Scholar
• E.H.L. Aarts, J.H.M. Korst, and P.J. Zwietering, Deterministic and randomized local search, in Mathematical Perspectives on Neural Networks, P. Smolensky, M. Mozer, and D.E. Rumelhart, eds., Lawerence Erlbaum, Mahwah, NJ, 1996, pp. 143–224.
   Google Scholar
• S.V.B. Aiyer, M. Niranjan, and F. Fallside, A theoretical investigation into the performance of the Hopfield model, IEEE Trans. Neural Netw. 1(2) (1990), pp. 204–215. doi: 10.1109/72.80232
   PubMedGoogle Scholar
• R. Battiti and G. Tecchiolli, Training neural nets with the reactive tabu search, IEEE Trans. Neural Netw. 6(5) (1995), pp. 1185–1200. doi: 10.1109/72.410361
   PubMed Web of Science ®Google Scholar
• T.-J. Chang, N. Meade, J.E. Beasley, and Y.M. Sharaiha, Heuristics for cardinality constrained portfolio optimisation, Comput. Oper. Res. 27(13) (2000), pp. 1271–1302. doi: 10.1016/S0305-0548(99)00074-X
   Web of Science ®Google Scholar
• T. Cui, S. Cheng, and R. Bai, A combinatorial algorithm for the cardinality constrained portfolio optimization problem, 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, 2014, pp. 491–498.
   Google Scholar
• T. Cura, Particle swarm optimization approach to portfolio optimization, Nonlinear Anal. Real World Appl. 10(4) (2009), pp. 2396–2406. doi: 10.1016/j.nonrwa.2008.04.023
   Web of Science ®Google Scholar
• Z. Dostál, Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities, Springer, New York, 2009.
   Google Scholar
• A. Fernandez and S. Gomez, Portfolio selection using neural networks, Comput. Oper. Res. 34(4) (2007), pp. 1177–1191. doi: 10.1016/j.cor.2005.06.017
   Web of Science ®Google Scholar
• G. Galan-Marin and J. Munoz-Perez, Design and analysis of maximum Hopfield networks, IEEE Trans. Neural Netw. 12(2) (2001), pp. 329–339. doi: 10.1109/72.914527
   PubMed Web of Science ®Google Scholar
• F. Glover and M. Laguna, Tabu search, in Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, ed., Blackwell, Scientific Publications, Oxford, 1993, pp. 70–150.
   Google Scholar
• G.E. Hinton and T.J. Sejnowski, Optimal perceptual inference, IEEE Conference on Computer Vision and Pattern Recognition, Washington, DC, 1983, pp. 448–453.
   Google Scholar
• J.J. Hopfield and D.W. Tank, ‘Neural’ computation of decisions in optimization problems, Biol. Cybern. 52(3) (1985), pp. 141–152.
   PubMed Web of Science ®Google Scholar
• B. Kamgar-Parsi and B. Kamgar-Parsi, On problem solving with Hopfield neural networks, Biol. Cybern. 62(5) (1990), pp. 415–423. doi: 10.1007/BF00197648
   Web of Science ®Google Scholar
• T. Kawamura, Y. Horio, and M. Hasegawa, Mutual information analyses of neuron selection techniques in synchronous exponential chaotic tabu search for quadratic assignment problems, IEEJ Trans. Electron. Inf. Syst. 131(3) (2011), pp. 592–599.
   Google Scholar
• G.M. Lee, N.N. Tam, and N.D. Yen, Quadratic Programming and Affine Variational Inequalities: A Qualitative Study, Springer, New York, 2005.
   Google Scholar
• D.G. Luenberger and Y. Ye, Linear and Nonlinear Programming, Springer, New York, 2008.
   Google Scholar
• H.M. Markowitz, Portfolio selection, J. Finance 7(1) (1952), pp. 77–91.
   Web of Science ®Google Scholar
• H. Muhlenbein and G. Paaß, From recombination of genes to the estimation of distributions, Lecture Notes in Comput. Sci. 1411 (1996), pp. 178–187. doi: 10.1007/3-540-61723-X_982
   Google Scholar
• R. Ruiz-Torrubiano and A. Suárez, Hybrid approaches and dimensionality reduction for portfolio selection with cardinality constraints, IEEE Comput. Intell. Mag. 5(2) (2010), pp. 92–107. doi: 10.1109/MCI.2010.936308
   Web of Science ®Google Scholar
• S. Salcedo-Sanz, E.G. Ortiz-Garcia, A.M. Perez-Bellido, A. Portilla-Figueras, and F. Lopez-Ferreras, On the performance of the LP-guided Hopfield network-genetic algorithm, Comput. Oper. Res. 36(7) (2009), pp. 2210–2216. doi: 10.1016/j.cor.2008.08.012
   Web of Science ®Google Scholar
• S. Salcedo-Sanz and Y. Yao, A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem, IEEE Trans. Syst. Man Cyber. B (2004), pp. 2343–2353. doi: 10.1109/TSMCB.2004.836471
   PubMed Web of Science ®Google Scholar
• Y. Sawaragi, H. Nakayama, and T. Tanino, Theory of multiobjective optimization, in Mathematics in Science and Engineering, R. Bellman, ed., Vol. 176, Academic Press, New York, 1985.
   Google Scholar
• K.A. Smith, D. Abramsonb, and D. Duke, Hopfield neural networks for timetabling: Formulations, methods, and comparative results, Comput. Ind. Eng. 44 (2003), pp. 283–305. doi: 10.1016/S0360-8352(02)00180-8
   Web of Science ®Google Scholar
• M. Sun and H.R. Nemati, Tabu machine: A new neural network solution approach for combinatorial optimization problems, J. Heuristics (9) (2003), pp. 5–27. doi: 10.1023/A:1021849410328
   Web of Science ®Google Scholar
• Y. Takefuji and Y.-C. Lee, A parallel algorithm for tiling problems, IEEE Trans. Neural Netw. 1(1) (1990), pp. 143–145. doi: 10.1109/72.80215
   PubMedGoogle Scholar
• S. Vaithyanathan, L.I. Burke, and M.A. Magent, Massively parallel analog Tabu search using neural networks applied to simple plant location problems, European J. Oper. Res. 93(2) (1996), pp. 317–330. doi: 10.1016/0377-2217(96)00047-1
   Web of Science ®Google Scholar
• F. Valdez, P. Melin, and O. Castillo, Evolutionary method combining particle swarm optimisation and genetic algorithms using fuzzy logic for parameter adaptation and aggregation: the case neural network optimisation for face recognition, Int. J. Artif. Intell. Soft Comput. 2(1/2) (2010), pp. 77–102. doi: 10.1504/IJAISC.2010.032514
   Google Scholar
• F. Valdez, P. Melin, and O. Castillo, Modular neural networks architecture optimization with a new nature inspired method using a fuzzy combination of particle swarm optimization and genetic algorithms, Inf. Sci. 270 (2014), pp. 143–153. doi: 10.1016/j.ins.2014.02.091
   Web of Science ®Google Scholar
• J. Wang, Hopfield neural network based on estimation of distribution for two-page crossing number problem, IEEE Trans. Circuits Syst. II, Exp. Briefs. 55(8) (2008), pp. 797–801. doi: 10.1109/TCSII.2008.922373
   Web of Science ®Google Scholar
• J. Wang, Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem, Expert Syst. Appl. 37(8) (2010), pp. 5758–5774. doi: 10.1016/j.eswa.2010.02.032
   Web of Science ®Google Scholar
• J. Wang, Y. Zhou, and J. Yin, Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem, Expert Syst. Appl. 38(12) (2011), pp. 14870–14881. doi: 10.1016/j.eswa.2011.05.060
   Web of Science ®Google Scholar
• G.V. Wilson and G.S. Pawley, On the stability of the travelling salesman problem algorithm of Hopfield and tank, Biol. Cybern. 58(1) (1988), pp. 63–70. doi: 10.1007/BF00363956
   PubMed Web of Science ®Google Scholar
• M. Woodside-Oriakhi, C. Lucas, and J.E Beasley, Heuristic algorithms for the cardinality constrained efficient frontier, European J. Oper. Res. 213(3) (2011), pp. 538–550. doi: 10.1016/j.ejor.2011.03.030
   Web of Science ®Google Scholar