Systems and Means of Informatics
2015, Volume 25, Issue 4, pp 31-51
APPROXIMATE OPTIMIZATION OF RESOURCE ALLOCATION STRATEGY: THE CASE OF BANK UNDERWRITING SYSTEM
- M. G. Konovalov
- R. V. Razumchik
Abstract
Consideration is given to the problem of risk assessment process optimization in commercial underwriting. The process is modeled by a dispatching queueing system with multiple single-server queues, several input regenerative flows of jobs with deadlines, complex job structure, two-stage job service process and partial availability of resources. One is interested in maximization of percent of jobs served in time (i.e., within deadline). The paper proposes the optimization method which requires development of the simulation model and further application of adaptive optimization algorithms on simulated paths. Based on numerical examples, it is shown that the approach allows one to find the most efficient strategy in a given set of heuristic strategies. The methodology is also applicable in general cases of resource allocation problems, which are not analytically tractable and which arise frequently when one needs to take into consideration multistage job service process, unpredictability of load and service times, and human factors.
[+] References (17)
- Crovella, M.E., M. Harchol-Balter, and C.D. Murta. 1998. Task assignment in a distributed system: Improving performance by unbalancing load. SIGMETRICS'98 Proceedings. Madison, Wi. 268-269.
- Harchol-Balter, M., M.E. Crovella, and C.D. Murta. 1999. On choosing a task assignment policy for a distributed server system. J. Parallel Distr. Com. 59:204-228.
- Krishnan, K. R., and T. J. Ott. 1986. State-dependent routing for telephone traffic: Theory and results. IEEE Conference on Decision and Control 25:2124-2128.
- Krishnan, K. R. 1990. Markov decision algorithms for dynamic routing. IEEE Com- mun. Mag. 28(10):66-69.
- Krishnan, K. R. 1990. Joining the right queue: A state-dependent decision rule. IEEE Trans. Automat. Contr. 35 (1): 104-108.
- Sassen, S.A.E., H. C. Tijms, and R. D. Nobel. 1997. A heuristic rule for routing customers to parallel servers. Stat. Neerl. 51(1): 107-121.
- Van Leeuwaarden, J., S. Aalto, and J. Virtamo. 2001. Load balancing in cellular networks using first policy iteration. Helsinki: Helsinki University of Technology, Networking Laboratory. Technical Report.
- Bhulai, S. 2006. On the value function of the M/Cox(r)/1 queue. J. Appl. Probab. 43(2):363-376.
- Hyytia, E., J. Virtamo, S. Aalto, and A. Penttinen. 2011. M/M/1-PS queue and size-aware task assignment. Perform. Evaluation 68(11): 1136-1148.
- Hyytia, E., A. Penttinen, and S. Aalto. 2012. Size- and state-aware dispatching problem with queue-specific job sizes. Eur. J. Oper. Res. 217(2):357-370.
- Hyytia, E., S. Aalto, and A. Penttinen. 2012. Minimizing slowdown in heterogeneous size-aware dispatching systems. ACM SIGMETRICS Perform. Eval. Rev. 40:29-40.
- Hyytia, E., T. Spyropoulos, and J. Ott. 2015. Offload (only) the right jobs: Robust offloading using the Markov decision processes. IEEE Symposium (International) on a World of Wireless, Mobile and Multimedia Networks (WoWMoM). Boston, MA. 1-9.
- Hyytia, E. 2013. Lookahead actions in dispatching to parallel queues. Perform. Eval. 70(10):859-872.
- Hyytia, E. 2013. Optimal routing of fixed size jobs to two parallel Servers. INFOR: Inform. Syst. Oper. Res. 51(4):215-224.
- Konovalov, M., and R. Razumchik. 2014. Simulation of task distribution in parallel processing systems. ICUMT-2014: 6th Congress (International) on Ultra Modern Telecommunications and Control Systems Proceedings. St. Petersburg. 657-663.
- Konovalov, M. G. 2014. Postroenie imitatsionnoy modeli dlya resheniya zadach planirovaniya vychislitel'nykh resursov [Building a simulation model for solving scheduling problems of computing resources]. Sistemy i Sredstva Informatiki - Systems and Means of Informatics 24(4):45-62.
- Konovalov, M. G. 2007. Metody adaptivnoy obrabotki informatsii i ikh prilozheniya [Methods of acaptive information processing and their applications]. Moscow: IPI RAN. 212 p.
[+] About this article
Title
APPROXIMATE OPTIMIZATION OF RESOURCE ALLOCATION STRATEGY: THE CASE OF BANK UNDERWRITING SYSTEM
Journal
Systems and Means of Informatics
Volume 25, Issue 4, pp 31-51
Cover Date
2015-09-30
DOI
10.14357/08696527150403
Print ISSN
0869-6527
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
controlled queueing system; simulation model; adaptive strategy
Authors
M. G. Konovalov
and R. V. Razumchik ,
Author Affiliations
Institute of Informatics Problems, Federal Research Center "Computer Science
and Control", Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Peoples' Friendship University, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
|