A mixed-integer program and a Lagrangian-based decomposition algorithm for the supply chain network design with quantity discount and transportation modes
作者：
Highlights：
• We study facility location-allocation in a two-echelon supply chain network design.
• We incorporate quantity discounts and transportation mode selection into our problem.
• We develop a mixed-integer program and a Lagrangian relaxation to solve this problem.
• The mixed-integer model solves 42% of large instances with an average gap of 65%.
• The Lagrangian relaxation solves all large instances with an average gap of 1.78%.
摘要
•We study facility location-allocation in a two-echelon supply chain network design.•We incorporate quantity discounts and transportation mode selection into our problem.•We develop a mixed-integer program and a Lagrangian relaxation to solve this problem.•The mixed-integer model solves 42% of large instances with an average gap of 65%.•The Lagrangian relaxation solves all large instances with an average gap of 1.78%.
论文关键词：Multi-echelon supply chain network,Facility location,All-unit quantity discount,Multi-mode transportation,Lagrangian relaxation
论文评审过程：Received 24 March 2019, Revised 26 June 2019, Accepted 2 July 2019, Available online 4 July 2019, Version of Record 26 July 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.07.004
