Abstract
In this work, an ordinal optimization-based evolution algorithm (OOEA) is proposed to solve a problem for a good enough target inventory level of the assemble-to-order (ATO) system. First, the ATO system is formulated as a combinatorial optimization problem with integer variables that possesses a huge solution space. Next, the genetic algorithm is used to select N excellent solutions from the solution space, where the fitness is evaluated with the radial basis function network. Finally, we proceed with the optimal computing budget allocation technique to search for a good enough solution. The proposed OOEA is applied to an ATO system comprising 10 items on 6 products. The solution quality is demonstrated by comparing with those obtained by two competing methods. The good enough target inventory level obtained by the OOEA is promising in the aspects of solution quality and computational efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Xiao Y, Chen J, Lee CY (2010) Optimal decisions for assemble-to-order systems with uncertain assembly capacity. Int J Prod Econ 123(1):155–165
Fu K, Hsu VN, Lee CY (2011) Approximation methods for the analysis of a multicomponent, multiproduct assemble-to-order system. Nav Res Logist 58(7):685–704
Zhao Y (2009) Analysis and evaluation of an assemble-to-order system with batch ordering policy and compound Poisson demand. Eur J Oper Res 198(3):800–809
ElHafsi M (2009) Optimal integrated production and inventory control of an assemble-to-order system with multiple non-unitary demand classes. Eur J Oper Res 194(1):127–142
Hong LJ, Nelson BL (2006) Discrete optimization via simulation using COMPASS. Oper Res 54(1):115–129
Ho YC, Zhao QC, Jia QS (2007) Ordinal optimization: soft optimization for hard problems. Springer, New York
Horng SC, Lin SS (2009) An ordinal optimization theory based algorithm for a class of simulation optimization problems and application. Expert Syst Appl 36(5):9340–9349
Horng SC, Lin SS (2011) Optimal cyclic service of the centralized broadband wireless networks with k-limited discipline. Simul Model Pract Theory 19(1):382–392
Horng SC (2011) Ordinal optimization based approach to the optimal resource allocation of grid computing system. Math Comput Model 54(1–2):519–530
Park J, Sandberg IW (1991) Universal approximation using radial-basis-function networks. Neural Comput 3(2):246–257
Goldberg DE, Sastry K (2010) Genetic algorithms: the design of innovation, 2nd edn. Springer, New York
Chen CH, Lee LH (2010) Stochastic simulation optimization: an optimal computing budget allocation. World Scientific, New Jersey
Acknowledgments
This research work is supported in part by the National Science Council in Taiwan, ROC, under grant NSC 100-2221-E-324-006.
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Horng, SC., Yang, FY. Optimal base-stock policy of the assemble-to-order systems. Artif Life Robotics 17, 47–52 (2012). https://doi.org/10.1007/s10015-012-0013-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-012-0013-9