SOME SPECIAL HEURISTICS FOR DISCRETE OPTIMIZATION PROBLEMS

Boris Melnikov, Alexey Radionov, Viktor Gumayunov

Abstract

In previous paper we considered some heuristic methods of decision-making for various discrete optimization problems; all these heuristics should be considered as the combination of them and form a common multi-heuristic approach to the various problems. And in this paper, we begin to consider local heuristics, which are different for different problems. At first, we consider two problems of minimization: for nondeterministic finite automata and for disjunctive normal forms. Our approach can be considered as an alternative to the methods of linear programming, multi-agent optimization, and neuronets.

References

  1. Belozyorova, A., and Melnikov, B., 2005. “Applying the set of heuristics in the problem of constructing scheme of nuclear transformations”, 2nd Conference “Methods and instrument of the information processing”, Russia, Moscow State Univ. Ed. (2005) 208-212 (in Russian).
  2. Birkhoff, G., and Bartee, T., 1999. Modern Applied Algebra, McGraw-Hill, N.Y., 1999.
  3. Dorigo, M., and Gambardella, L., 1997. “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”, IEEE Transactions on Evolutionary Computation, Vo.1, No.1 (1997) 53-66.
  4. Hromkovic, J., 2003. Algorithms for Hard Problems, Springer, 2003.
  5. Jiang, T., and Ravikumar, B., 1993. “Minimal NFA Problems are Hard”, SIAM J. Comput., Vo.22 (1993).
  6. Johnson, D., and McGeoch, L., 1997. “The Traveling Salesman Problem: A Case Study in Local Optimization”, in “Local Search in Combinatorial Optimization”, eds E.Aarts, J.Lenstra, John Wiley Ed., 1997, 215-310.
  7. Kameda, T., and Weiner, P., 1970. “On the State Minimization of Nondeterministic Finite Automata”, IEEE Trans.on Computers, C-19 (1970) 617-627.
  8. Lee, E., and Markus, L., 1967. Foundation of Optimal Control Theory. Wiley, 1967.
  9. Melnikov, B., 2000. “Once more about the stateminimization of the nondeterministic finite automata”, The Korean Journal of Computational and Applied Mathematics, Vo.7, No.3 (2000) 655-662.
  10. Melnikov B., and Romanov, N., 2001. “Once more on the heuristics for the traveling salesman problem”, Russia, Saratov State Univ. Ed., “Theoretical informatics and its applying”, Vo.4 (2001) 81-92 (in Russian).
  11. Melnikov, B., 2005. “Discrete Optimization Problems - Some New Heuristic Approaches”, Conference HPCAsia-2005, IEEE Computer Society Press Ed., 2005.
  12. Yablonskiy, S., 1979. Introduction into discrete mathematics, Moscow, Nauka Ed., 1979 (in Russian).
Download


Paper Citation


in Harvard Style

Melnikov B., Radionov A. and Gumayunov V. (2006). SOME SPECIAL HEURISTICS FOR DISCRETE OPTIMIZATION PROBLEMS . In Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-972-8865-42-9, pages 360-364. DOI: 10.5220/0002469803600364


in Bibtex Style

@conference{iceis06,
author={Boris Melnikov and Alexey Radionov and Viktor Gumayunov},
title={SOME SPECIAL HEURISTICS FOR DISCRETE OPTIMIZATION PROBLEMS},
booktitle={Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2006},
pages={360-364},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002469803600364},
isbn={978-972-8865-42-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - SOME SPECIAL HEURISTICS FOR DISCRETE OPTIMIZATION PROBLEMS
SN - 978-972-8865-42-9
AU - Melnikov B.
AU - Radionov A.
AU - Gumayunov V.
PY - 2006
SP - 360
EP - 364
DO - 10.5220/0002469803600364