Abstract
Discrete and stochastic resource allocation problems are difficult to solve because of the combinatorial explosion of feasible search space. Resource management is important area and a significant challenge is encountered when considering the relationship between uncertainty factors and inputs and outputs of processes in the service and manufacturing systems. These problems are unavailable in closed-form expressions for objective function. In this paper, we propose \(\hbox {PSO}_{\mathrm{OTL}}\), a new approach of the hybrid simulation optimization structure, to achieve a near optimal solution with few simulation replications. The basic search algorithm of particle swarm optimization (PSO) is applied for proper exploration and exploitation. Optimal computing budget allocation combined with PSO is used to reduce simulation replications and provide reliable evaluations and identifications for ranking particles of the PSO procedure. Two-sample t tests were used to reserve good particles and maintain the diversity of the swarm. Finally, trapping in local optimum in the design space was overcome by using the local search method to generate new diverse particles when a similar particle exists in the swarm. This study proposed intelligent manufacturing technology, called the \(\hbox {PSO}_{\mathrm{OTL}}\), and compared it with four algorithms. The results obtained demonstrate the superiority of \(\hbox {PSO}_{\mathrm{OTL}}\) in terms of search quality and computational cost reduction.
Similar content being viewed by others
References
Abe, T. (2005). What is service science? Research report no. 246. Fujitsu Research Institute. http://jp.fujitsu.com/group/fri/downloads/en/economic/publications/report/2005/246.pdf. Accessed December 12, 2012.
Ahmed, M. A., & Alkhamis, T. M. (2009). Simulation optimization for an emergency department healthcare unit in Kuwait. European Journal of Operational Research, 198(3), 936–942.
Al-Aomar, R., & Al-Okaily, A. (2006). A GA-based parameter design for single machine turning process with high-volume production. Computers and Industrial Engineering, 50, 317–337.
Badinelli, R. (2010). A stochastic model of resource allocation for service system. Service Science, 2, 76–91.
Bechhofer, R. E., Santner, T. J., & Goldsman, D. M. (1995). Design and analysis of experiments for statistical selection, screening, and multiple comparisons. New York: Wiley.
Belmecheri, F., Prins, C., Yalaoui, F., & Amodeo, L. (2013). Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. Journal of Intelligent Manufacturing, 24, 775–789.
Cabrera, E., Taboada, M., Iglesias, M. L., Epelde, F., & Luque, E. (2011). Optimization of healthcare emergency departments by agent-based simulation. Procedia Computer Science, 4, 1880–1889.
Chakaravarthy, G. V., Marimuthu, S., & Sait, A. N. (2013). Performance evaluation of proposed differential evolution and particle swarm optimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of Intelligent Manufacturing, 24(1), 175–191.
Chen, C. C. (2011). Two-layer particle swarm optimization for unconstrained optimization problems. Applied Soft Computing, 11, 295–304.
Chen, C. H., & Lee, L. H. (2010). Stochastic simulation optimization: An optimal computing budget allocation. Singapore: World Scientific Publishing Co. Ptd. Ltd.
Chen, C. H., Lin, J. Y., Ucesan, E., & Chick, S. E. (2000). Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynamic Systems, 10, 251–270.
Demir, L., Tunali, S., & Eliiyi, D. T. (2014). The state of the art on buffer allocation problem: a comprehensive survey. Journal of Intelligent Manufacturing, 25, 371–392.
Dolgui, A., Eremeev, A., & Sigaev, V. (2007). HBBA: Hybrid algorithm for buffer allocation in tandem production lines. Journal of Intelligent Manufacturing, 18, 411–420.
Hegazy, T., & Kassab, M. (2003). Resource optimization using combined simulation and genetic algorithms. Journal of Construction Engineering and Management, 129, 698–705.
Hemachandra, N., & Eedupuganti, S. K. (2003). Performance analysis and buffer allocations in some open assembly systems. Computers and Operations Research, 30, 695–704.
Hosseini, S., & Al Khaled, A. (2014). A survey on the imperialist competitive algorithm metaheuristic: Implementation in engineering domain and directions for future research. Applied Soft Computing, 24, 1078–1094.
Huang, C. J., Chang, K. H., & Lin, J. T. (2011). Optimal vehicle allocation for an automated materials handling system using simulation optimization. International Journal of Production Research, 50, 1–13.
Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, 4, 1942–1948.
Kim, S. H., & Nelson, B. L., (2003) Selecting the best system: Theory and methods. Proceedings of the 2003 winter simulation conference (pp. 101–112).
Kuo, R. J., & Yang, C. Y. (2011). Simulation optimization using particle swarm optimization algorithm with application to assembly line design. Applied Soft Computing, 11, 605–613.
Lee, Z. J., & Lee, C. Y. (2005). A hybrid search algorithm with heuristics for resource allocation problem. Information Sciences, 173, 155–167.
Lin, J. T., & Chen, C. M. (2015). Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing. Simulation Modelling Practice and Theory, 51, 100–114.
Lin, J. T., & Chiu, C. C. (2014). A PSO-based hybrid approach for buffer allocation problem with uncertainty. Proceedings of the 15th Asia Pacific industrial engineering and management systems conference (APIEMS). Jeju, South Korea.
Lin, J. T., & Huang, C. J. (2014). A simulation-based optimization approach for a semiconductor photobay with automated material handling system. Simulation Modelling Practice and Theory, 46, 76–100.
Liu, X.-J., Yi, H., & Ni, Z.-H. (2013). Application of ant colony optimization algorithm in process planning optimization. Journal of Intelligent Manufacturing, 24, 1–13.
Lu, H., Sriyanyong, P., Song, Y., & Dillon, H. (2010). Experimental study of a new hybrid PSO with mutation for economic dispatch with non-smooth cost function. International Journal of Electrical Power and Energy Systems, 32, 921–935.
Marinakis, Y., Marinaki, M., & Dounias, G. (2010). A hybrid particle swarm optimization algorithm for the vehicle routing problem. Engineering Applications of Artificial Intelligence, 23, 463–472.
Massim, Y., Yalaoui, F., Chatelet, E., Yalaoui, A., & Zeblah, A. (2012). Efficient immune algorithm for optimal allocations in series-parallel continuous manufacturing systems. Journal of Intelligent Manufacturing, 23, 1603–1609.
Massim, Y., Yalaoui, F., Chatelet, E., Yalaoui, A., & Zeblah, A. (2010). Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization. Computer and Operations Research, 37, 611–620.
Nahas, N. (2014). Buffer allocation and preventive maintenance optimization in unreliable production lines. Journal of Intelligent Manufacturing. doi:10.1007/s10845-007-0030-z.
Nahas, N., Ait-Kadi, D., & Nourelfath, M. (2006). A new approach for buffer allocation in unreliable production lines. International Journal of Production Economics, 103, 873–881.
Pan, H., Wang, L., & Liu, B. (2006). Particle swarm optimization for function optimization in noisy environment. Applied Mathematics and Computation, 181, 908–919.
Papadopoulos, H. T., & Vidalis, M. I. (2001). A heuristic algorithm for the buffer allocation in unreliable unbalanced production line. Computers and Industrial Engineering, 41, 261–277.
Prakash, A., Tiwari, M. K., & Shankar, R. (2008). Optimal job sequence determination and operation machine allocation in flexible manufacturing systems: an approach using adaptive hierarchical ant colony algorithm. Journal of Intelligent Manufacturing, 19, 161–173.
Qiu, X., Lau, Y., & Henry, K. (2014). An AIS-based hybrid algorithm for static job shop scheduling problem. Journal of Intelligent Manufacturing, 25, 489–503.
Rinott, Y. (1978). On two-stage selection procedures and related probability inequalities. Communications in Statistics, A7, 799–811.
Shen, Y., Wang, G., & Tao, C. (2009). Positive linear correlation particle swarm optimization. Berlin, Heidelberg: Springer.
Shi, L., & Chen, C. H. (2000). A new algorithm for stochastic discrete resource allocation optimization. Journal of Discrete Event Dynamic Systems: Theory and Applications, 10, 271–294.
Shieh, H. L., Kuo, C. C., & Chiang, C. M. (2011). Modified particle swarm optimization algorithm with simulated annealing behaviour and its numerical verification. Applied Mathematics and Computation, 218, 4365–4383.
Tezcan, T., & Gosavi, A. (2001). Optimal buffer allocation in production lines using an automata search. Proceedings of the institute of industrial engineering conference, Dallas.
Ventura, J., & Yoon, S.-H. (2013). A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. Journal of Intelligent Manufacturing, 24, 1185–1196.
Vouros, G. A., & Papadopoulos, H. T. (1998). Buffer allocation in unreliable production lines using a knowledge-based system. Computers, Operations Research, 25, 1005–1067.
Yin, P. Y., & Wang, J. Y. (2006). A particle swarm optimization approach to the nonlinear resource allocation problem. Applied Mathematics and Computation, 183, 232–242.
Yuzukirmizi, M., & Smith, J. M. (2008). Optimal buffer allocation in finite closed networks with multiple servers. Computers and Operations Research, 35, 2579–2598.
Acknowledgments
The research in this paper was partially supported by the Ministry of Science and Technology of Taiwan under grant NSC102-2221-E-007-124-MY3.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Rights and permissions
About this article
Cite this article
Lin, J.T., Chiu, CC. A hybrid particle swarm optimization with local search for stochastic resource allocation problem. J Intell Manuf 29, 481–495 (2018). https://doi.org/10.1007/s10845-015-1124-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-015-1124-7