A path-relinking approach for a bi-criteria disassembly sequencing problem.
Belarmino Adenso-DíazSantiago García CarbajalSurendra M. GuptaPublished in: Comput. Oper. Res. (2008)
Keyphrases
- path relinking
- bicriteria
- tabu search
- scatter search
- metaheuristic
- efficient solutions
- flowshop
- max min
- search procedure
- traveling salesman problem
- integer linear programming
- knapsack problem
- shortest path problem
- combinatorial optimization problems
- scheduling problem
- solution space
- optimization problems
- combinatorial optimization
- heuristic methods
- feasible solution
- simulated annealing
- grasp with path relinking
- optimal solution
- solution quality
- ant colony optimization
- genetic algorithm
- min max
- optimization algorithm
- wireless sensor networks
- np hard
- greedy randomized adaptive search procedure