Formulations and branch-and-cut algorithms for multi-product multi-vehicle production routing problems with startup cost
作者：
Highlights：
• MILP models for multi-product multi-vehicle production routing problems with startup.
• Branch-and-cut algorithm with relax-and-fix heuristic.
• Big-bucket versus small-bucket formulation.
• Comparison with multi-product multi-vehicle inventory routing problems.
• Case study for multi-product multi-vehicle production routing problems with startup.
摘要
•MILP models for multi-product multi-vehicle production routing problems with startup.•Branch-and-cut algorithm with relax-and-fix heuristic.•Big-bucket versus small-bucket formulation.•Comparison with multi-product multi-vehicle inventory routing problems.•Case study for multi-product multi-vehicle production routing problems with startup.
论文关键词：Routing,Production planning,Branch-and-cut,Generalized (l, S) inequalities
论文评审过程：Received 12 September 2017, Revised 2 January 2018, Accepted 3 January 2018, Available online 3 January 2018, Version of Record 12 January 2018.
论文官网地址：https://doi.org/10.1016/j.eswa.2018.01.006
