A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Simulation optimization with the linear move and exchange move optimization algorithm
1999
Proceedings of the 31st conference on Winter simulation Simulation---a bridge to the future - WSC '99
Preserved Fulltext
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
doi:10.1145/324138.324505
fatcat:bj4ceikdonduhgwder6u3bowhi