Scholarly Research Excellence

Digital Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29023


Select areas to restrict search in scientific publication database:
7754
Hybrid of Hunting Search and Modified Simplex Methods for Grease Position Parameter Design Optimisation
Abstract:
This study proposes a multi-response surface optimization problem (MRSOP) for determining the proper choices of a process parameter design (PPD) decision problem in a noisy environment of a grease position process in an electronic industry. The proposed models attempts to maximize dual process responses on the mean of parts between failure on left and right processes. The conventional modified simplex method and its hybridization of the stochastic operator from the hunting search algorithm are applied to determine the proper levels of controllable design parameters affecting the quality performances. A numerical example demonstrates the feasibility of applying the proposed model to the PPD problem via two iterative methods. Its advantages are also discussed. Numerical results demonstrate that the hybridization is superior to the use of the conventional method. In this study, the mean of parts between failure on left and right lines improve by 39.51%, approximately. All experimental data presented in this research have been normalized to disguise actual performance measures as raw data are considered to be confidential.
Digital Object Identifier (DOI):

References:

[1] P. Kanchanasuttisang and P. Luangpaiboon, "Sequential Multiple Response Optimization for Manufacturing Flexible Printed Circuit", Am. J. Applied Sci., vol. 9, No.5, pp. 772-778. DOI: 10.3844/ajassp.2012.772.778, 2012.
[2] P.M. Cann, J.P. Doner, M.N. Webster and V. Wikstrom, "Grease Degradation in Rolling Element Bearings," Tribology Transactions, vol. 44, no. 3, pp. 399-404, 2001.
[3] M.T.V. Zoelen, C.H. Venner and P.M. Lugt, "Free Surface Thin Layer Flow in Bearings Induced by Centrifugal Effects," Tribology Transactions, vol. 53, no. 3, pp. 297-307, 2010.
[4] H. Lin, J.G. Sun and Y.M. Zhang, " Theorem proving based on the extension rule," Journal of Automated Reasoning, vol. 31, pp. 11-21, 2003.
[5] J.G. Zhou, D. Herscovici and C.C. Chen, "Parametric process optimisation to improve the accuracy of rapid prototyped stereo lithography parts," International Journal of Machine Tools and Manufacture, vol. 40, pp. 363-379, 2000.
[6] C.M. Hsu, "An integrated approach to enhance the optical performance of couplers based on neural networks, desirability functions and tabu search,"International Journal of Production Economics, vol. 92, pp. 241-254, 2004.
[7] I. Mukherjee and P.K. Ray, "Optimal process design of two-stage multiple responses grinding processes using desirability functions and metaheuristic technique," Applied Soft Computing, vol. 8, pp. 402-421, 2008.
[8] Q.H. Zhao, D. Urosevic, N. Mladenovic and P. Hansen, "A restarted and modified simplex search for unconstrained optimisation," Computers and Operations Research, vol. 36, 3263-3271, 2009.
[9] A. Kamoun, M. Jaziri and M. Chaabouni, "The use of the simplex method and its derivatives to the on-line optimisation of the parameters of an injection moulding process," Chemometrics and Intelligent Laboratory Systems, vol. 96, pp. 117-122, 2009.
[10] H.C. Kuo, J.R. Chang and K.S. Shyu, "A hybrid algorithm of evolution and simplex methods applied to global optimisation," Journal of Marine Science and Technology, vol. 12, pp. 280-289, 2004.
[11] P. Luangpaiboon, "Variable Neighborhood Simplex Search Methods for Global Optimisation Models", Journal of Computer Science, vol. 8, no. 4, pp. 613-620, 2012.
[12] R. Oftadeh, M.J. Mahjoob and M. Shariatpanahi, "A novel metaheuristic optimisation algorithm inspired by group hunting of animals: Hunting search," Computers and Mathematics with Applications, vol. 60, pp. 2087-2098, 2010.
Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007