Solving bi-objective flow shop problem with multi-objective path relinking algorithm.
Rong-Qiang ZengMing-Sheng ShangPublished in: ICNC (2014)
Keyphrases
- bi objective
- multi objective
- optimization algorithm
- computational complexity
- dynamic programming
- scheduling problem
- path relinking
- benchmark problems
- particle swarm optimization
- computationally efficient
- shortest path problem
- knapsack problem
- ant colony optimization
- tabu search
- objective function
- worst case
- combinatorial optimization
- np hard
- cost function
- search space
- optimal solution
- genetic programming
- simulated annealing
- computational efficiency
- search procedure
- evolutionary algorithm
- efficient solutions
- artificial bee colony
- max min