Skip to main content

Forest Planning Using Particle Swarm Optimization with a Priority Representation

  • Conference paper
Modern Approaches in Applied Intelligence (IEA/AIE 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6704))

Abstract

We examine the poor performance of Discrete Particle Swarm Optimization when applied to forest planning, a combinatorial optimization problem in which the goal is to maintain an even flow of timber from a forested area of multiple plots over several time periods while cutting each plot no more than once and no two adjacent plots within the same period. We suggest an alternative priority representation using Particle Swarm Optimization with real numbers and justify it with experimental results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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.

References

  1. Potter, W.D., Drucker, E., et al.: Diagnosis, configuration, planning, and pathfinding: Experiments in nature-inspired optimization. In: Natural Intelligence for Scheduling, Planning, and Packing Problems, pp. 267–294. Springer, Berlin (2009)

    Chapter  Google Scholar 

  2. Bettinger, P., Zhu, J.: A new heuristic for solving spatially constrained forest planning problems based on mitigation of infeasibilities radiating outward from a forced choice. Silva Fennica 40, 315–333 (2006)

    Article  Google Scholar 

  3. Kennedy, J., Eberthart, R.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  4. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. IEEE Intern. Conf. on Neural Netw., pp. 1942–1948. IEEE Service Center, Piscataway (1995)

    Chapter  Google Scholar 

  5. Bean, J.C.: Genetic Algorithms and Random Keys for Sequencing and Optimization. ORSA Journal on Computing 6, 154–160 (1994)

    Article  MATH  Google Scholar 

  6. Zhang, H., Li, X., et al.: Particle swarm optimization-based schemes for resource-constrained project scheduling. Automation in Construction 14, 393–404 (2005)

    Article  Google Scholar 

  7. Michaelwicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation 4, 1–32 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brooks, P.W., Potter, W.D. (2011). Forest Planning Using Particle Swarm Optimization with a Priority Representation. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21827-9_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21826-2

  • Online ISBN: 978-3-642-21827-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics