A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times.
Marco CasertaE. Quiñonez RicoPublished in: Comput. Oper. Res. (2009)
Keyphrases
- multi item
- hybrid algorithm
- setup times
- optimal solution
- lot sizing
- tabu search
- particle swarm optimization
- column generation
- feasible solution
- upper bound
- lower bound
- simulated annealing
- particle swarm optimization pso
- differential evolution
- ant colony optimization
- combinatorial auctions
- genetic algorithm
- branch and bound
- setup cost
- knapsack problem
- search space
- lead time
- reinforcement learning
- single machine scheduling problem
- production cost
- mixed integer
- evolutionary algorithm
- np hard
- branch and bound algorithm
- dynamic programming
- metaheuristic
- neural network
- linear program
- multistage