×

A resource portfolio planning model using sampling-based stochastic programming and genetic algorithm. (English) Zbl 1147.91034

Summary: Resource portfolio planning optimization is crucial to high-tech manufacturing industries. One of the most important characteristics of such a problem is intensive investment and risk in demands. In this study, a nonlinear stochastic optimization model is developed to maximize the expected profit under demand uncertainty. For solution efficiency, a stochastic programming-based genetic algorithm (SPGA) is proposed to determine a profitable capacity planning and task allocation plan. The algorithm improves a conventional two-stage stochastic programming by integrating a genetic algorithm into a stochastic sampling procedure to solve this large-scale nonlinear stochastic optimization on a real-time basis. Finally, the tradeoff between profits and risks is evaluated under different settings of algorithmic and hedging parameters. Experimental results have shown that the proposed algorithm can solve the problem efficiently.

MSC:

91B28 Finance etc. (MSC2000)
90C15 Stochastic programming
90B85 Continuous location
68T05 Learning and adaptive systems in artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Alonso, A.; Escudero, L. F.; Ortuño, M. T., Theory and methodology—a stochastic 0-1 program based approach for the air traffic flow management problem, European Journal of Operational Research, 120, 47-62 (2000) · Zbl 0979.90067
[2] Bard, J. F.; Srinivasan, K.; Tirupati, D., An optimization approach to capacity expansion in semiconductor manufacturing facilities, International Journal of Production Research, 37, 15, 3359-3382 (1999) · Zbl 0948.90524
[3] Barut, M.; Sridharan, V., Production, manufacturing and logistics— design and evaluation of a dynamic capacity apportionment procedure, European Journal of Operational Research, 155, 112-133 (2004) · Zbl 1044.90041
[4] Bashyam, T. C.A., Competitive capacity expansion under demand uncertainty, European Journal of Operational Research, 95, 1, 89-114 (1996) · Zbl 0955.90024
[5] Chambers, L., Practical Handbook of Genetic Algorithms: Applications, Vol. 1 (1995), Chapman & Hall/CRC Press: Chapman & Hall/CRC Press Boca Raton, FL, pp. 106-113
[6] Chang, T. J.; Meade, N.; Beasley, J. E.; Sharaiha, Y. M., Heuristic for cardinality constrained portfolio optimization, Computer & Operation Research, 27, 1271-1302 (2000) · Zbl 1032.91074
[7] Chang, K. H.; Chen, H. J.; Liu, C. H., A stochastic programming model for portfolio selection, Journal of the Chinese Institute of Industrial Engineers, 19, 31-41 (2002)
[8] Chen, Z. L.; Li, S.; Tirupati, D., A scenario-based stochastic programming approach for technology and capacity planning, Computer & Operations Research, 29, 781-806 (2002) · Zbl 0995.90053
[9] David, E., Genetic Algorithm in Search, Optimization and Machine Learning (1953), Addison Wesley Publishing Company, Inc., pp. 1-57
[10] Ehrgott, M.; Klamroth, K.; Schwehm, C., Decision aiding an MCDM approach to portfolio optimization, European Journal of Operational Research, 155, 752-770 (2004) · Zbl 1043.91016
[11] Gen, M.; Cheng, R., Genetic Algorithms and Engineering Optimization (2000), John Wiley & Sons, Inc.
[12] Gritsevskyi, A.; Nakićenović, N., Modeling Uncertainty of Induced Technological Change, Policy, 20, 907-921 (2000)
[13] Haupt, R. L.; Haupt, S. E., Practical Genetic Algorithms (1998), John Wiley & Sons: John Wiley & Sons Canada · Zbl 0940.68107
[14] Higgins, A.; David, I., A simulation model for capacity planning in sugarcane transport, Computer and Electronics in Agriculture, 47, 85-102 (2005)
[15] Higle, J. L.; Sen, S., Stochastic Decomposition (1996), Kluwer Academic Publishers.: Kluwer Academic Publishers. Dordrecht
[16] Holland, J. H., Adaptation in Natural and Artificial Systems (1975), University of Michigan Press: University of Michigan Press Detroit MI
[17] Hung, Y. F.; Leachman, R. C., A production planning methodology for semiconductor manufacturing based on interactive simulation and linear programming calculations, IEEE Transactions on Semiconductor manufacturing, 9, 2, 257-269 (1996)
[18] Hung, Y. F.; Wang, Q. Z., A new formulation technique for alternative material planning – an approach for semiconductor bin allocation planning, Computer and Industrial Engineering, 32, 2, 281-297 (1997)
[19] Ip, W. H.; Li, Y.; Man, K. F.; Tang, K. S., Multi-product planning and scheduling using genetic algorithm approach, Computer and Industrial engineering, 38, 283-296 (2000)
[20] Lee, J. H., Artificial intelligence-based sampling planning system for dynamic manufacturing process, Expert Systems with Application, 22, 117-133 (2002)
[21] Li, Y.; Ip, W. H.; Wang, W. H., Genetic algorithm approach to earliness and tardiness production scheduling and planning problem, Computer and Industrial Engineering, 54, 65-76 (1998)
[22] Merkle, D.; Middendorf, M.; Schmeck, H., Ant colony optimization for resource-constrained project scheduling, IEEE Transactions on Evolutionary Computation, 6, 4, 333-346 (2002)
[23] Mitsuo, G.; Runwei, C., Genetic Algorithms and Engineering Optimization (2000), A Wiley-Interscience Publication
[24] Neslihan, A., Notes on the merger strategy of high versus low-tech industries: complementarities and moral hazard, Economics Bulletin, 12, 7, 1-12 (2002)
[25] Papadimitriou, C., Computational complexity. Computational complexity, Chapter 11: Randomized Computation (1993), Spring · Zbl 0557.68033
[26] Pongcharoen, P.; Hicks, C.; Braiden, P. M., The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure, European Journal of Operational Research, 152, 215-225 (2004) · Zbl 1045.90031
[27] Rajagopalan, S., Capacity expansion with alternative technology choices, European Journal of Operational Research, 392-402 (1994) · Zbl 0809.90068
[28] Swaminathan, J. M., Tool capacity planning for semiconductor fabrication facilities under demand uncertainty, European Journal of Operational Research, 120, 545-558 (2000) · Zbl 0985.90030
[29] Tempo, R.; Calafiore, G.; Dabbene, F., Randomized Algorithms for Analysis and Control of Uncertain Systems (2005), Springer-Verlag: Springer-Verlag London · Zbl 1079.93002
[30] Tiwari, M. K.; Vidyarth, N. K., Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach, International Journal of Production Research, 38, 14, 3357-3384 (2000) · Zbl 1094.90548
[31] Wang, K. J.; Hou, T. C., Modeling and resolving the joint problem of capacity expansion and allocation with multiple resources and limited budget in semiconductor testing industry, International Journal of Production Research, 41, 14, 3217-3235 (2003)
[32] Wang, K. J.; Lin, S. H., Capacity expansion and allocation for a semiconductor testing facility with a constrained budget, Production Planning and Control, 13, 5, 429-437 (2002)
[33] Wang, S.-M., Chen, J., Wang, K.-J., in press. Resource portfolio planning of make-to-stock products using a constraint programming based genetic algorithm. Omega-International Journal of Management Science.; Wang, S.-M., Chen, J., Wang, K.-J., in press. Resource portfolio planning of make-to-stock products using a constraint programming based genetic algorithm. Omega-International Journal of Management Science.
[34] Wikipedia, 2006. The Free Encyclopedia. <http://en.wikipedia.org/wiki/Genetic_algorithm>; Wikipedia, 2006. The Free Encyclopedia. <http://en.wikipedia.org/wiki/Genetic_algorithm>
[35] Xia, Y.; Liu, B.; Wang, S.; Lai, K. K., A model for portfolio selection with order of expected returns, Computers & Operations Research, 27, 409-422 (2000) · Zbl 1063.91519
[36] Xia, Y.; Wang, S.; Deng, X., Theory and methodology: a compromise solution to mutual funds portfolio selection with transaction Costs, European Journal of Operation Research, 134, 564-581 (2001) · Zbl 1004.91030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.