COMBINATORIAL OPTIMIZATION IN FOUNDRY PRODUCTION PLANNING


如何引用文章

全文:

详细

The mathematical model of foundry production capacity planning is suggested in the paper. The model is produced in terms of pseudo-Boolean optimization theory. Different search optimization methods were used to solve the obtained problem.

作者简介

I Masich

Email: i-masich@eandex.ru

参考

  1. Aarts, E. H. L. Local Search in Combinatorial Optimizatio n / E. H . L. Aarts, J. K. Le nstra // W ile y -Inte rsc ience Series in Discrete Mathematics and Optimization. England : John Wiley & Sons Ltd, 1997.
  2. A ntamo s hkin, A . N . C o mparativ e e f f ic ie nc y of tw o s che me s of local search for optimization of pseudo-Boolean functions [Electronic resource] / A. N. Antamoshkin, I. S. Masich // Inves tigate d in R uss ia : e lec tro nic j ournal. 2004. 51. P . 544-546. Access mode: <http://zhurnal.ape.relarn.ru/articles/2004/051.pdf>. Title from a display .
  3. Papadimitriou, C. H. Combinatorial Optimization / C. H. Papadimitriou, K. Steiglitz. Prentice-Hall, Englewood Cliff s, NJ, 1982.
  4. A ntam o s hk in, A . N . O p tim izat io n o f unimo dal mo no to ne ps eudobo olean f unc tio ns / A . N. Antamoshkin, V . N. Sar ae v , E. S. S emenkin // K y bernetika. 1990. V ol. 26, № 5. P . 432-441.
  5. Bjцrklund, H. Optimization on Completely Unimodal Hypercubes / H. Bjцrklund, S. Sandberg, S. Vorobjov // T echnical report 2002-018/ May 2002/ ISSN 1404-3203.
  6. Wegener, I. On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics / I. W egene r, C. W itt. T e chnic al R eport. ISS N 1433-3325.
  7. Hammer, P . L. Boolean Methods in Operations Research and Related Areas / P. L. Hammer, S. Rudeanu. Berlin : Springer-V erlag ; New Y ork : Heidelberg, 1968.
  8. Boros, E. Pseudo-Boolean Optimization / E. Boros, P . L. H ammer // Discre te Applied Mathematics. 2002. V ol. 123. P . 155-225.
  9. A lle mand, K . A . P o ly no mial c as e o f unc o ns traine d ze ro - one quadratic optimization / K. Allemand, K. Fukuda, T. M. Liebling, E. Steiner // Math. Program. Ser. A. 2001. V o l. 91. P . 49-52.
  10. Foldes, S. Monotone, Horn and Quadratic Pseudo-Boolean Functions / S. Foldes, P. L. Hammer // Journal of U niv e rsal Co mpute r Sc ie nc e . 2000. V o l. 6, № 1. P . 97-104.
  11. Hammer, P . L. Quadratic functions of binary variables / P . L. Hammer, B. Simeone // Combinatorial Optimization, Lecture Notes in Mathematics ; ed. by B. Simeone. V ol. 1403 Springer, Heidelberg, 1989.
  12. Goldberg, D. E. Genetic algorithms in search, optimization, and machine learning / D. E. Goldberg. Reading, MA : Addison-W esley , 1989.
  13. Schwefel, H.-P. Evolution and Optimum Seeking / H .-P . Schw efel. New Y ork : Whiley Publ., 1995.
  14. A ntamo shkin, A. N . R egular optimization of ps eudo-Boolean functions / A. N. Antamoshkin. Krasnoyarsk: Krasnoyarsk university publ., 1989.
  15. Antamoshkin, A. N. H eur istic sear ch algor ithms for monotone pseudo-boolean function conditional optimization / A. N. Antamoshkin, I. S. Masich // Engineering&automation problems. 2006. V ol. 5, № 1. P . 55-61.
  16. Antamoshkin, A. N. Unimprovable algorithm of conditional optimization of monotonic pseudo-Boolean functions [Electronic resource] / A. N. Antamoshkin, I. S. Masich // Investigated in Russia : electronic journal. 2004. 64. P . 703-708. Access mode: <http://zhurnal.ape.relarn.ru/>artic le s /2004/064.pdf . T itle f ro m a dis play .
  17. Antamoshkin, A. N. Greedy algorithm and local search for conditional pseudo-Boolean optimization [Electronic resource] / A. N. Antamoshkin, I. S. Masich // Investigated in Russia : electronic journal. 2003. 177. P . 2143-2149. Access mode: <http://zhurnal.ape.relarn.ru/articles/2003/177.pdf>. Title from a display.

补充文件

附件文件
动作
1. JATS XML

版权所有 © Masich I.S., 2009

Creative Commons License
此作品已接受知识共享署名 4.0国际许可协议的许可
##common.cookie##