A problem evolution algorithm with linear programming for the dynamic facility layout problem - A general layout formulation.
Yiyong XiaoYue XieSadan Kulturel-KonakAbdullah KonakPublished in: Comput. Oper. Res. (2017)
Keyphrases
- linear programming
- dynamic programming
- times faster
- high accuracy
- optimization algorithm
- improved algorithm
- experimental evaluation
- convergence rate
- np hard
- cost function
- special case
- preprocessing
- iterative procedure
- similarity measure
- learning algorithm
- search space
- probabilistic model
- objective function
- detection algorithm
- matching algorithm
- probabilistic formulation
- bregman divergences
- neural network
- recognition algorithm
- knapsack problem
- convex hull
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- simulated annealing
- worst case
- lower bound
- computational complexity