Pitfalls and potential of particle swarm optimization for contemporary spatial forest planning
Abstract
We describe here an example of applying particle swarm optimization (PSO) — a population-based heuristic technique — to maximize the net present value of a contemporary southern United States forest plan that includes spatial constraints (green-up and adjacency) and wood flow constraints. When initiated with randomly defined feasible initial conditions, and tuned with some appropriate modifications, the PSO algorithm gradually converged upon its final solution and provided reasonable objective function values. However, only 86% of the global optimal value could be achieved using the modified PSO heuristic. The results of this study suggest that under random-start initial population conditions the PSO heuristic may have rather limited application to forest planning problems with economic objectives, wood-flow constraints, and spatial considerations. Pitfalls include the need to modify the structure of PSO to both address spatial constraints and to repair particles, and the need to modify some of the basic assumptions of PSO to better address contemporary forest planning problems. Our results, and hence our contributions, are contrary to earlier work that illustrated the impressive potential of PSO when applied to stand-level forest planning problems or when applied to a high quality initial population.
Downloads
References
Baskent EZ, Jordan GA. 2002. Forest landscape management modeling using simulated annealing. For Ecol Manage 165, 29-45.
Bettinger P, Boston K, Kim Y.-H, Zhu J. 2007. Landscapelevel optimization using tabu search and stand densityrelated forest management prescriptions. Eur J Oper Res 176, 1265-1282.
http://dx.doi.org/10.1016/j.ejor.2005.09.025
Bettinger P, Chung W. 2004. The key literature of, and trends in, forest-level management planning in North America, 1950-2001. Int For Rev 6, 40-50.
Bettinger P, Graetz D, Boston K, Sessions J, Chung W. 2002. Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems. Silva Fennica 36, 561-584.
Bettinger P, Johnson DL, Johnson KN. 2003. Spatial forest plan development with ecological and economic goals. Ecol Mod 169, 215-236. http://dx.doi.org/10.1016/S0304-3800(03)00271-0
Bettinger P, Sessions J, Boston K. 1997. Using Tabu search to schedule timber harvests subject to spatial wildlife goals for big game. Ecol Mod 94, 111-123. http://dx.doi.org/10.1016/S0304-3800(96)00007-5
Bettinger P, Sessions J, Boston K. 2009. A review of the status and use of validation procedures for heuristics used in forest planning. Math Comp For & Nat Res Sci 1, 26-37.
Bettinger P, Zhu J. 2006. A new heuristic method for solving spatially constrained forest planning problems based on mitigation of infeasibilities radiating outward from a forced choice. Silva Fennica 40, 315-333.
Bi X-J, Liu G-A, Li J. 2008. Improved particle swarm optimization algorithm based on statistical laws and dynamic learning factors. Proceedings of the 16th IASTED International Conference Artificial Intelligence and Applications, Gammerman, E. (ed.). Innsbruck, Austria, February 11-13, 2008. ACTA Press, Calgary, Alberta.
Boston K, Bettinger P. 2002. Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. For Sci 48, 35-46.
Brooks PW, Potter WD. 2011. Forest planning using particle swarm optimization with a priority representation. In Proceedings of the 24th International Conference on In dustrial Engineering and Other Applications of Applied Intelligent Systems, Part II, Mehrotra, K.G., Mohan, C.K., Oh JC, Varshney PK and Ali M. (eds.). Springer, New York. pp. 312-318.
Carlisle A, Dozier G. 2001. An off-the-shelf PSO. Proceedings of the 2001 Workshop on Particle Swarm Optimization. Purdue School of Engineering and Technology. Indianapolis, Indiana, April 6-7, 2001. pp. 1-6.
PMid:11299046 PMCid:31343
Cieszewski CJ, Zasada M, Borders BE, Lowe RC, Zawadzki J, Clutter ML, Daniels RF. 2004. Spatially explicit sustainability analysis of long-term fiber supply in Georgia, USA. For Ecol Manage 187, 345-359.
Constantino M, Martins I, Borges JG. 2008. A new mixed integer programming model for harvest scheduling subject to maximum area restrictions. Operations Research 56, 542-551.
http://dx.doi.org/10.1287/opre.1070.0472
Cooren Y, Clerc M, Siarry P. 2011. MO-TRIBES, an adaptive multiobjective particle swarm optimization algorithm. Comp Opt App 49, 379-400. http://dx.doi.org/10.1007/s10589-009-9284-z
Cui GZ, Qin LM, Liu S, Wang YF, Zhang XC, Cao XH. 2008. Modified PSO algorithm for solving planar graph coloring problem. Prog Nat Sci 18, 353-357. http://dx.doi.org/10.1016/j.pnsc.2007.11.009
Dueck G, Scheuer T. 1990. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J Comp Physics 90, 161-175. http://dx.doi.org/10.1016/0021-9991(90)90201-B
Eberhart RC, Shi Y. 2001. Tracking and optimizing dynamic systems with particle swarms. Proceedings of the Congress on Evolutionary Computation. Institute of Electrical and Electronics Engineers, Piscataway, New Jersey. Seoul, South Korea, May 27-30, 2001. 1, 94-100.
Eberhart RC, Shi Y. 2007. Computational intelligence: Concepts to implementations. Morgan Kaufmann Publishers, Burlington, MA.
Eberhart RC, Simpson PK, Dobbins RW. 1996. Computational Intelligence PC Tools. Academic Press, Boston, MA.
Falcão AO, Borges JG. 2001. Designing an evolution program for solving integer forest management scheduling models: An application in Portugal. For Science 47(2), 158-168.
Falcão AO, Borges JG. 2002. Combining random and systematic search heuristic procedures for solving spatially constrained forest management scheduling models. For Science 48(3), 608-621.
Folegatti BS, Smidt MF, Dubois MR. 2007. Cost and cost trends for forestry practices in the South. For Landowner 66(5), 11-16. Fores Tech International, 2006. SiMS 2006. ForesTech International, LLC, Watkinsville, GA.
Garcia-Gonzalo J, Pukkala T, Borges JG (in press). Integrating fire risk in stand management scheduling. An application to Maritime pine stands in Portugal. Annals of Operations Research.
Glover F. 1989. Tabu search — Part I. ORSA J Comp 1, 190-206.
Hassan R, Cohanim B, Cohanim B, Weck OD, Venter G. 2005. A comparison of particle swarm optimization and the genetic algorithm. Proceedings of the 46th AIAA/ ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference. American Institute of Aeronautics and Astronautics, Inc., Reston, VA. Austin, Texas, April 18-21, 2005.
Holland JH. 1975. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI.
Kennedy J, Eberhart RC. 1995. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks. Institute of Electrical and Electronics Engineers, Piscataway, New Jersey. Perth, Australia, Nov 27-Dec 1, 1995. 4, 1942-1948.
Li XY, Tian P, Hua J, Zhong, N. 2006. A hybrid discrete particle swarm optimization for the traveling salesman problem. In: Simulated Evolution and Learning, Wang, T-D, X Li and X Wang (eds.). Springer, Berlin. 4247, 181-188.
Lindo Systems, Inc. 2002. Industrial Lindo / PC, Release 6.1. Lindo systems, Inc., Chicago, IL.
McDill ME, Braze J. 2000. Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions. For Sci 46, 423-436.
Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E. 1953. Equation of state calculations by fast computing machines. J Chem Physics 21, 1087-1101.
http://dx.doi.org/10.1063/1.1699114
Murray AT. 1999. Spatial restrictions in harvest scheduling. For Sci 45, 45-52.
Omran MGH. 2004. Particle swarm optimization methods for pattern recognition and image processing. Doctoral thesis. University of Pretoria, Pretoria, South Africa.
Pan QK, Wang L. 2008. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. Int J Adv Manuf Tech 39, 796- 807. http://dx.doi.org/10.1007/s00170-007-1252-0
Parsopoulos KE, Vrahatis MN. 2002. Recent approaches to global optimization problems through Particle Swarm Optimization. Nat Comp 1, 235-306. http://dx.doi.org/10.1023/A:1016568309421
Potter WD, Drucker E, Bettinger P, Maier F, Martin M, Luper D, Watkinson M, Handy G, Hayes C. 2009. Diagnosis, configuration, planning, and pathfinding: Experiments in nature-inspired optimization. In: Natural Intelligence for Scheduling, Planning and Packing Problems (Chiong, R., Dhakal S., eds.). Springer, Berlin. pp. 267- 294. http://dx.doi.org/10.1007/978-3-642-04039-9_11 PMid:20044528
Pugh J, Martinoli A. 2006. Discrete multi-valued particle swarm optimization. Proceedings of IEEE Swarm Intelligence Symposium. Institute of Electrical and Electronics Engineers, Piscataway, New Jersey. Indianapolis, Indiana, May 12-14, 2006. 1, 103-111.
Pukkala T. 2009. Population-based methods in the optimization of stand management. Silva Fennica 43, 261-274.
Richards EW, Gunn EA. 2003. Tabu search design for difficult forest management optimization problems. Can J For Res 33, 1126-1133. http://dx.doi.org/10.1139/x03-039
Salman A, Ahmad I, Al-Madani S. 2002. Particle swarm optimization for task assignment problem. Microproc Microsystems 26, 363-371. http://dx.doi.org/10.1016/S0141-9331(02)00053-4
Shan Y. 2010. Examining the potential of particle swarm optimization for spatial forest planning and developing a solution quality index for heuristics techniques. Doctoral thesis. University of Georgia, Athens, GA.
Shi Y, Eberhart RC. 2000. Experimental study of particle swarm optimization. Proceedings of the 4th World Multi-Conference on Systematics, Cybernetics and Informatics. International Institute of Informatics and Systemics, Caracas, Venezuela. Orlando, Florida, July 23-26, 2000.
Zhao F, Zhang Q, Yu D, Chen X, Yang Y. 2005. A hybrid algorithm based on PSO and simulated annealing and its applications for partner selection in virtual enterprise. Lec Notes Comp Sci 3644, 380-389. http://dx.doi.org/10.1007/11538059_40
Zhu J, Bettinger P, Li R. 2007. Additional insight into the performance of a new heuristic for solving spatially constrained forest planning problems. Silva Fennica 41, 687- 698.
© CSIC. Manuscripts published in both the printed and online versions of this Journal are the property of Consejo Superior de Investigaciones Científicas, and quoting this source is a requirement for any partial or full reproduction.
All contents of this electronic edition, except where otherwise noted, are distributed under a “Creative Commons Attribution 4.0 International” (CC BY 4.0) License. You may read here the basic information and the legal text of the license. The indication of the CC BY 4.0 License must be expressly stated in this way when necessary.
Self-archiving in repositories, personal webpages or similar, of any version other than the published by the Editor, is not allowed.
