Collaborative Planning in Supply Chains by Lagrangian Relaxation and Genetic Algorithms.
Lanshun NieXiaofei XuDe-chen ZhanPublished in: Int. J. Inf. Technol. Decis. Mak. (2008)
Keyphrases
- supply chain
- lagrangian relaxation
- genetic algorithm
- supply chain management
- integer programming
- column generation
- lower bound
- feasible solution
- lower and upper bounds
- dynamic programming
- bullwhip effect
- inventory management
- branch and bound algorithm
- linear programming
- neural network
- customer demand
- lead time
- np hard
- production planning
- mixed integer programming
- upper bound
- revenue sharing
- tabu search
- service level
- simulated annealing
- heuristic search
- shortest path
- evolutionary algorithm
- particle swarm optimization
- valid inequalities
- multi objective
- objective function
- decision making