A simulated annealing algorithm with neighbourhood list for capacitated dynamic lot-sizing problem with returns and hybrid products.
Pakayse KokenHyesung SeokSang Won YoonPublished in: Int. J. Comput. Integr. Manuf. (2018)
Keyphrases
- computational efficiency
- simulated annealing algorithm
- simulated annealing
- genetic algorithm
- test data generation
- search algorithm
- lot sizing
- multi source
- routing problem
- annealing algorithm
- facility location problem
- network design problem
- metaheuristic
- np hard
- genetic programming
- facility location
- multi period
- neural network
- vehicle routing problem
- hybrid algorithm
- setup cost
- upper bound
- lower bound