Abstract
We propose an optimization model to minimize the gap between predicted conveyance tension and measured field data for friction coefficients calibration. This is an oracle optimization problem since the objective function relies on a complex numerical computing engine to simulate the downhole context. To tackle the NP-hardness in computation complexity, we introduce an improved formulation by representing the residue as function of friction coefficients to reduce the number of parameters and a new stochastic direction descent (SDD) method to avoid locally optimal solutions. Numerical experiments on various field cases are presented to validate this optimization framework. It shows that SDD method is efficient comparing to grid, bisection, and simplex algorithms. Our study is useful in optimization tasks in complex industrial systems architecture & engineering, where objective functions are very costly or slow to evaluate.
Can Jin, Xin Peng: Authors contributed equally to this work.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Underhill, W.B, Moore, L., et al.: Model-based sticking risk assessment for wireline formation testing tools in the U.S. Gulf Coast. Well Testing (1998)
Kolda, T.G., Lewis, R.M., Torczon, V.: Cable-conveyed well intervention. Paper SPE 71560 presented at the SPE Annual Technical Conference and Exhibition held in New Orleans, Louisiana (2001)
Mohammadpoor, M., Torabi, F.: Big Data analytics in oil and gas industry: an emerging trend. Petroleum (2018)
Lu, H., Guo, L., Azimi, M., Huang, K.: Oil and Gas 4.0 era: a systematic review and outlook. Comput. Ind. 111 (2019)
Wu, T., Mao, Y., Zhao, G.: A model designed for HSE big data analysis in petroleum industry. In: International Petroleum Technology Conference 2019 (IPTC 2019) (2019)
Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308–313 (1965)
Mckinnon, K.I.M.: Convergence of the Nelder-Mead simplex method to a nonstationary point. SIAM J. Optim. 9(1)
Boyd, B., Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)
Beltran, C., Edwards, N.R., Haurie, A.B., et al.: Oracle-based optimization applied to climate model calibration. Environ. Model. Assess. 11(1), 31–43 (2006)
Lewis, R.M, Shepherd, A., Torczon, V.: Implementing Generating Set Search Methods for Linearly Constrained Minimization. Society for Industrial and Applied Mathematics (2005)
Powell, M.J.D.: On search directions for minimization algorithms. Math. Program. 4(1), 193–201 (1973)
Powell, M.J.D.: The BOBYQA algorithm for bound constrained optimization without derivatives (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendinx
Search Methods
Grid search. The grid method is one of the simplest search method that explores the parameter settings using a grid. It can help us visualize function lanscape and is currently the most widely used method for global optimization.
Bisection search. The bisection method is one of reliable, easy to implement, and convergence method. It is well-known in finding real root of non-linear equations and can be extended to solve optimization problem.
Simplex search. Simplex method is a classical derivative-free optimization algorithm which depends on the comparison of function values at a general simplex, followed by the replacement of the worst vertex by another point [8, 9]. It is more efficient than the grid method and bisection method [10,11,12].
Supplementary Figures
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Jin, C. et al. (2021). An Optimization Method for Calibrating Wireline Conveyance Tension. In: Krob, D., Li, L., Yao, J., Zhang, H., Zhang, X. (eds) Complex Systems Design & Management . Springer, Cham. https://doi.org/10.1007/978-3-030-73539-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-73539-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73538-8
Online ISBN: 978-3-030-73539-5
eBook Packages: Computer ScienceComputer Science (R0)