A genetic algorithm with the heuristic procedure to solve the multi-line layout problem.
Amir SadrzadehPublished in: Comput. Ind. Eng. (2012)
Keyphrases
- genetic algorithm
- mixed integer program
- genetic algorithm to solve
- tabu search
- produce high quality solutions
- simulated annealing
- feasible solution
- branch and bound procedure
- evolutionary algorithm
- multidimensional knapsack problem
- genetic programming
- optimal solution
- search algorithm
- line segments
- mixed integer
- job shop scheduling problem
- mathematical programming
- optimization method
- multi objective
- constraint satisfaction
- finding an optimal solution
- lagrangian relaxation
- genetic operators
- data sets
- genetic algorithm ga
- artificial neural networks
- neural network