Simulation optimization with the linear move and exchange move optimization algorithm

The linear move and exchange move optimization (LEG) 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...

Full description

Saved in:
Bibliographic Details
Published inWSC'99. 1999 Winter Simulation Conference Proceedings. 'Simulation - A Bridge to the Future' (Cat. No.99CH37038) Vol. 1; pp. 806 - 811 vol.1
Main Authors Barretto, M.R.P., Chwif, L., Eldabi, T., Paul, R.J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Computational modeling
Computer simulation
Constraint optimization
Input variables
Job shop scheduling
Low earth orbit satellites
Mechatronics
Optimization methods
Scheduling algorithm
Simulated annealing
Online AccessGet full text

Cover

More Information
Summary:The linear move and exchange move optimization (LEG) 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. We try to apply the LEO algorithm to the problem of optimizing a manufacturing simulation model, based on a steelworks plant. This paper also demonstrates the effectiveness and versatility of this algorithm. We compare the search effort of this algorithm with a genetic algorithm (GA) implementation of the same problem.
ISBN:0780357809
9780780357808
DOI:10.1109/WSC.1999.823267