Guide Objective Assisted Particle Swarm Optimization and Its Application to History Matching | SpringerLink
Skip to main content

Guide Objective Assisted Particle Swarm Optimization and Its Application to History Matching

  • Conference paper
Parallel Problem Solving from Nature - PPSN XII (PPSN 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7492))

Included in the following conference series:

Abstract

As is typical of metaheuristic optimization algorithms, particle swarm optimization is guided solely by the objective function. However, experience with separable and roughly separable problems suggests that, for subsets of the decision variables, the use of alternative ‘guide objectives’ may result in improved performance. This paper describes how, through the use of such guide objectives, simple problem domain knowledge may be incorporated into particle swarm optimization and illustrates how such an approach can be applied to both academic optimization problems and a real-world optimization problem from the domain of petroleum engineering.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. PUNQ-S3 test case. Department of Earth Science and Engineering. Imperial College, London (2010), http://www3.imperial.ac.uk/earthscienceandengineering/research/perm/punq-s3model (retrieved January 7, 2010)

  2. Abdollahzadeh, A., Reynolds, A., Christie, M., Corne, D., Davies, B., Williams, G.: Bayesian optimization algorithm applied to uncertainty quantification. In: SPE EUROPEC/EAGE Annual Conf. and Exhibition, Vienna, Austria (2011)

    Google Scholar 

  3. Abdollahzadeh, A., Reynolds, A., Christie, M., Corne, D., Williams, G., Davies, B.: Estimation of distribution algorithms applied to history matching. In: SPE Reservoir Simulation Symposium, Houston, Texas, U.S.A. (2011)

    Google Scholar 

  4. Barker, J.W., Cuypers, M., Holden, L.: Quantifying uncertainty in production forecasts: Another look at the PUNQ-S3 problem. SPE Journal 6(4), 433–441 (2001)

    Article  Google Scholar 

  5. Erbaş, D., Christie, M.A.: Effect of sampling strategies on prediction uncertainty estimation. In: SPE Reservoir Simulation Symposium, Houston, U.S.A. (2007)

    Google Scholar 

  6. Hajizadeh, Y., Christie, M., Demyanov, V.: Comparative study of novel population-based optimization algorithms for history matching and uncertainty quantification: PUNQ-S3 revisited. In: Abu Dhabi Int. Petroleum Exhibition and Conf. (2010)

    Google Scholar 

  7. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. of the IEEE Int. Conf. on Neural Networks, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  8. Kvasnicka, V., Pelikan, M., Pospichal, J.: Hill climbing with learning (an abstraction of genetic algorithm). Neural Network World 6(5), 773–796 (1995)

    Google Scholar 

  9. Mohamed, L., Christie, M.A., Demyanov, V.: Comparison of stochastic sampling algorithms for uncertainty quantification. SPE Journal 15(1), 31–38 (2010)

    Article  Google Scholar 

  10. Mohammed, L., Christie, M., Demyanov, V.: Reservoir model history matching with particle swarms. In: SPE Oil and Gas India Conf. and Exhibition, Mumbai, India (2010)

    Google Scholar 

  11. Petrovska, I., Carter, J.N.: Estimation of distribution algorithms for history-matching. In: Proc. of the 10th European Conf. on the Mathematics of Oil Recovery. EAGE, Amsterdam (2006)

    Google Scholar 

  12. Romero, C.E., Carter, J.N., Gringarten, A.C., Zimmerman, R.W.: A modified genetic algorithm for reservoir characterisation. In: Int. Oil and Gas Conf. and Exhibition, Beijing, China (2000)

    Google Scholar 

  13. Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function. The Computer Journal 3(3), 175–184 (1960)

    Article  MathSciNet  Google Scholar 

  14. Sultan, A.J., Ouenes, A., Weiss, W.W.: Automatic history matching for an integrated reservoir description and improving oil recovery. In: Proc. of the Permian Basin Oil and Gas Recovery Conf., Midland, Texas, pp. 741–748 (1994)

    Google Scholar 

  15. Yang, C., Nghiem, L., Card, C., Bremeier, M.: Reservoir model uncertainty quantification through computer-assisted history matching. In: SPE Annual Technical Conf. and Exhibition, Anaheim, California, U.S.A. (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reynolds, A.P., Abdollahzadeh, A., Corne, D.W., Christie, M., Davies, B., Williams, G. (2012). Guide Objective Assisted Particle Swarm Optimization and Its Application to History Matching. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds) Parallel Problem Solving from Nature - PPSN XII. PPSN 2012. Lecture Notes in Computer Science, vol 7492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32964-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32964-7_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32963-0

  • Online ISBN: 978-3-642-32964-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics