The capacitated minimum spanning tree problem with arc time windows
作者:
Highlights:
• Devise a new optimization problem using exact and heuristics methods.
• Heuristics solutions can accelerate MIP methods finding better solutions.
• Adding parts of the heuristics solution improved the exact results.
• The performance of the initial solution in MIP packages should be improved.
• Performance gap of MIP packages at the root and middle nodes.
摘要
•Devise a new optimization problem using exact and heuristics methods.•Heuristics solutions can accelerate MIP methods finding better solutions.•Adding parts of the heuristics solution improved the exact results.•The performance of the initial solution in MIP packages should be improved.•Performance gap of MIP packages at the root and middle nodes.
论文关键词:Capacitated Minimum Spanning Tree,Arc Time Windows,Mixed Integer Programming Formulation,Heuristics
论文评审过程:Received 6 July 2020, Revised 23 November 2020, Accepted 4 March 2021, Available online 10 March 2021, Version of Record 2 April 2021.
论文官网地址:https://doi.org/10.1016/j.eswa.2021.114859