Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 37, Issue 1, 2007, Pages 166-175

  Granmo, Ole Christoffer ^a   Oommen, B John ^a,b   Myrer, Svein Arild ^c   Olsen, Morten Goodwin ^a  

^a UNIVERSITY OF AGDER   (Norway)

^b CARLETON UNIVERSITY   (Canada)

^c Bouvet ASA   (Norway)

Author keywords

Game playing; Learning automata (LA); Nonlinear knapsack problem; Resource allocation; Stochastic optimization

Indexed keywords

GAME THEORY; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; RESOURCE ALLOCATION; SAMPLING;

LEARNING AUTOMATA (LA); LEARNING AUTOMATA-BASED SOLUTIONS; NONLINEAR FRACTIONAL KNAPSACK; OPTIMAL RESOURCE ALLOCATION;

AUTOMATA THEORY;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; GAME; METHODOLOGY; NONLINEAR SYSTEM; RESOURCE ALLOCATION; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; GAME THEORY; MODELS, THEORETICAL; NONLINEAR DYNAMICS; RESOURCE ALLOCATION;

EID: 33847613520     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2006.879012     Document Type: Article

References (21)

1. NIST, The Fractional Knapsack Problem, 2004. [Online]. Available: http://www.nist.gov/dads/HTML/fractionalKnapsack.html
2. G. K. Bhattacharyya and R. A. Johnson, Statistical Concepts and Methods. Hoboken, NJ: Wiley, 1977.
3. K. M. Bretthauer and B. Shetty, "The nonlinear knapsack problem-algorithms and applications," Eur. J. Oper. Res., vol. 138, no. 3, pp. 459-472, May 2002.
4. C. Castillo, "Effective web crawling," Ph.D. dissertation, Univ. Chile, Santiago, 2004.
5. B. C. Dean, M. X. Goemans, and J. Vondrdk, "Approximating the stochastic knapsack problem: The benefit of adaptivity," in Proc. 45th Annu. IEEE Symp. Found. Comput. Sci., 2004, pp. 208-217.
6. B. Fox, "Discrete optimization via marginal analysis," Manage. Sci., vol. 13, no. 3, pp. 211-216, 1966.
7. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Berlin, Germany: Springer-Verlag, 2004.
8. K. S. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction. Englewood Cliffs, NJ: Prentice-Hall, 1989.
9. D. Ng, B. J. Oommen, and E. R. Hansen, "Adaptive learning mechanisms for ordering actions using random races," IEEE Trans. Syst., Man, Cybern. A, Syst., vol. 23, no. 5, pp. 1450-1465, Sep./Oct. 1993.
10. B. J. Oommen, "Stochastic searching on the line and its applications to parameter learning in nonlinear optimization," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 27, no. 4, pp. 733-739, Aug. 1997.
11. B. J. Oommen and L. Rueda, "Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments," Pattern Recognit., vol. 39, pp. 328-341, 2006.
12. S. Pandey, K. Ramamritham, and S. Chakrabarti, "Monitoring the dynamic web to respond to continuous queries," in Proc. 12th Int. World Wide Web Conf., 2003, pp. 659-668.
13. K. W. Ross and D. H. K. Tsang, "The stochastic knapsack problem," IEEE Trans. Commun., vol. 37, no. 7, pp. 740-747, Jul. 1989.
14. M. Snaprud, N. Ulltveit-Moe, O.-C. Granmo, M. Rafoshei-Klev, A. Wiklund, and A. Sawicka, "Quantitative assessment of public web sites accessibility-some early results," in Proc. Accessibility All Conf., 2003.
15. E. Steinberg and M. S. Parks, "A preference order dynamic program for a knapsack problem with stochastic rewards," J. Oper. Res. Soc., vol. 30, no. 2, pp. 141-147, 1979.
16. M. A. L. Thathachar and P. S. Sastry, Networks of Learning Automata: Techniques for Online Stochastic Optimization. Norwell, MA: Kluwer, 2004.
17. M. L. Tsetlin, Automaton Theory and Modeling of Biological Systems. New York: Academic, 1973.
18. J. L. Wolf, M. S. Squillante, J. Sethuraman, and K. Ozsen, "Optimal crawling strategies for web search engines," in Proc. 11th Int. World Wide Web Conf., 2002, pp. 136-147.
19. Z. Xiaoming, "Evaluation and enhancement of web content accessibility for persons with disabilities," Ph.D. dissertation, Univ. Pittsburgh, Pittsburgh, PA, 2004.
20. Q. Zhu and B. J. Oommen, "Some fundamental results on optimal search with unknown target distributions," in Proc. 17th Int. Conf. Chilean Comput. Sci. Soc., Valparaiso, Chile, Nov. 1997.
21. G. Zipf, Human Behavior and the Principle of Least Effort. Reading, MA: Addison-Wesley, 1949.