Abstract
In this paper, we present a simulated annealing algorithm for solving multi-objective simulation optimization problems. The algorithm is based on the idea of simulated annealing with constant temperature, and uses a rule for accepting a candidate solution that depends on the individual estimated objective function values. The algorithm is shown to converge almost surely to an optimal solution. It is applied to a multi-objective inventory problem; the numerical results show that the algorithm converges rapidly.
Original language | English (US) |
---|---|
Pages (from-to) | 3029-3035 |
Number of pages | 7 |
Journal | Applied Mathematics and Computation |
Volume | 215 |
Issue number | 8 |
DOIs | |
State | Published - Dec 15 2009 |
Keywords
- Multi-objective simulation optimization
- Simulated annealing
- Simulation optimization
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics