Name
Title | ||
|---|---|---|
Simulation optimization with the linear move and exchange move optimization algorithm |
Abstract | ||
|---|---|---|
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 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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/WSC.1999.823267 | Simulation Conference Proceedings, 1999 Winter |
Keywords | Field | DocType |
facility location,genetic algorithms,industrial plants,scheduling,simulated annealing,simulation,steel industry,combinatorial optimization problems,facility layout,genetic algorithm,line balancing,linear move and exchange move optimization,manufacturing simulation model,scheduling,search,simulated annealing,simulation optimization,steelworks | Push–relabel maximum flow algorithm,Mathematical optimization,Search algorithm,Algorithm design,Simulation,Computer science,Meta-optimization,Assignment problem,Criss-cross algorithm,Optimization problem,Difference-map algorithm | Conference |
Volume | ISBN | Citations |
1 | 0-7803-5780-9 | 6 |
PageRank | References | Authors |
0.60 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcos Ribeiro Pereira Barretto | 1 | 83 | 8.35 |
| Leonardo Chwif | 2 | 6 | 0.60 |
| Tillal Eldabi | 3 | 6 | 0.60 |
| Ray J. Paul | 4 | 6 | 0.60 |