Name
Abstract | ||
|---|---|---|
This paper presents a hybrid genetic algorithm for the simple assembly line problem, SALBP-1. The chromosome representation of the problem is based on random keys. The assignment of the operations to the workstations is based on a heuristic priority rule in which the priorities of the operations are defined by the chromosomes. A local search is used to improve the solution. The approach is tested on a set of problems taken from the literature and compared with other approaches. The computation results validate the effectiveness of the algorithm. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1023/A:1020377910258 | J. Heuristics |
Keywords | Field | DocType |
assembly line,SALBP-1,priority rules,hybrid genetic algorithm,random keys | Heuristic,Mathematical optimization,Computer science,Workstation,Local search (optimization),Genetic algorithm,Line balancing,Computation | Journal |
Volume | Issue | ISSN |
8 | 6 | 1572-9397 |
Citations | PageRank | References |
55 | 3.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José Fernando Gonçalves | 1 | 736 | 37.31 |
| Jorge Raimundo De Almeida | 2 | 55 | 3.34 |