A mixed-integer program and a Lagrangian-based decomposition algorithm for the supply chain network design with quantity discount and transportation modes.
M. KheirabadiB. NaderiA. ArshadikhamsehVahid RoshanaeiPublished in: Expert Syst. Appl. (2019)
Keyphrases
- quantity discount
- decomposition algorithm
- network design
- supply chain
- lagrangian relaxation
- distribution centers
- network design problem
- feasible solution
- supply chain management
- decision making
- integer programming
- mixed integer
- communication networks
- economic order quantity
- network architecture
- np hard
- lead time
- inventory management
- dynamic programming
- facility location
- lower bound
- reverse logistics
- branch and bound algorithm
- mixed integer programming
- optimal solution
- column generation
- linear programming
- transportation problem
- service level
- lower and upper bounds
- special case
- lot sizing
- inventory control
- shortest path
- scheduling problem
- evolutionary algorithm