Simulation optimization with the linear move and exchange move optimization algorithm

Marcos Ribeiro Pereira Barretto, Leonardo Chwif, Tillal Eldabi, Ray J. Paul
1999 Proceedings of the 31st conference on Winter simulation Simulation---a bridge to the future - WSC '99  
The Linear Move and Exchange Move Optimization (LEO) is an algorithm based on a simulated annealing algorithm (SA), a relatively recent algorithm for solving hard combinatorial optimization problems. The LEO algorithm was successfully applied to a facility layout problem, a scheduling problem and a line balancing problem. In this paper we will try to apply the LEO algorithm to the problem of optimizing a manufacturing simulation model, based on a Steelworks Plant. This paper also demonstrates
more » ... e effectiveness and versatility of this algorithm. We compare the search effort of this algorithm with a Genetic Algorithm (GA) implementation of the same problem.
doi:10.1145/324138.324505 fatcat:bj4ceikdonduhgwder6u3bowhi