An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes.
Alexander ShulmanPublished in: Oper. Res. (1991)
Keyphrases
- dynamic programming
- location problems
- np hard
- learning algorithm
- cost function
- computational complexity
- search space
- particle swarm optimization
- genetic algorithm
- optimal solution
- bicriteria
- linear programming
- combinatorial optimization
- benchmark problems
- single facility
- shortest path problem
- multiple objectives
- simulated annealing
- worst case
- objective function