Title: Simulated Annealing
1Simulated Annealing
An Alternative Solution Technique for Spatially
Explicit Forest Planning Models
Sonney George
2Acknowledgement
- Dr. Marc E. McDill
- PA DCNR Bureau of Forestry
3Introduction
LP based Models
Xij acres allotted to the prescription from age
class i in period j and Cij, the corresponding
contribution to objective function
4Disadvantage
- Solution will not give the geographic location.
- E.g. harvest 350 acres from initial age class
60-70 in Period 1
- Violate clear cut restrictions
- Spatial constraints are difficult to model
5Spatially Explicit Models
Advantages
- Maximum clear-cut size
- Wildlife habitat requirements.
- Dynamic corridors
- Minimum patch size
- Incorporation of road building
6Spatially Explicit Model
Xij is binary
Adjacency
Singularity
Return
Harvest target
7Disadvantage
- Standard solution method is by using branch and
bound algorithm
- Solution time is too long
- Ranges from a few hours to infinity even on the
fastest computer
8Heuristic Solution Techniques
- Random search.
- Simulated annealing
- Great deluge algorithm
- Threshold accepting
- Tabu search with 1-opt moves
- Tabu search with 1-opt and 2-opt moves
- Genetic algorithm
- Hybrid tabu search / genetic algorithm
9Advantages and Disadvantages
Disadvantages
- Sub-optimality
- Constraints by penalty functions
- Infeasibility
10Random Search Algorithm
Go to Model
New
Current
11Disadvantage
12The Simulated Annealing Algorithm
- Analogy of the annealing process
- Allows nonlinear and discontinuous constraints
and objectives
13The Physical Annealing Process
High temperature
Elements move freely
Slow cooling(Annealing)
System crystallizes into a state of minimal
energy
14Flow Chart
Add new random stand at random period
no
yes
no
yes
Accept new Solution
P(delta) ? 1 when c is very high. P(delta) ? 0
when c is very small rand ?(0,1)
no
yes
15Basis for future research
- Spatially explicit modeling is a promising
technique for modeling non-timber objectives and
constraints
- Finding real time solutions to spatially explicit
models is a challenging task
- Simulated annealing is a promising heuristic
solution technique
- Comparison between simulated annealing and CPLEX?
results not been reported
16Comparing With CPLEX?
Drawback Comparison of feasible solution from
CPLEX? with infeasible one from SA
Deviation from optimum
Solution Make CPLEX? solutions compatible with SA
by using penalty functions in both
Solution time
17Time for Questions