Paper Info
Title
The Capacitated Minimum Spanning Tree Problem With Arc Time Windows
Abstract
We consider a new variant of the minimum spanning tree problem, where time windows are associated with the arcs of the underlying graph and capacities relate to the maximum number of vertices that subtrees may incorporate. The problem is referred to as the Capacitated Minimum Spanning Tree with Arc Time Windows (CMSTP_ATW) and emerges in routing situations with flow disruptions across road segments. We devise a Mixed Integer Programming (MIP) formulation to model the problem, which can be solved using CPLEX. To examine the quality of the solutions obtained, we convert the data sets of Solomon (1987) to appropriately capture CMSTP_ATW instances and provide results for the problems with 25, 50 and 100 vertices. Furthermore, we compare the CPLEX built-in heuristic that determines the initial integer solution for the CMSPT_ATW, vis-a-vis a greedy heuristic we have developed that offers high quality solutions in short computational times for the large size test problems. Experimental results show that there is a strong negative correlation between the GAP of CPLEX and the total number of iterations in one-hour performance time, against the no or positive correlation between the GAP of CPLEX and the initial iterations. Finally, we modify the MIP by adding parts of the solution derived, using the greedy heuristic, in the set of problem constraints, and observe that the CPLEX results for the CMSTP_ATW are in general improved, offering evidence that it is a promising solution approach.
Year
DOI
Venue
2021
10.1016/j.eswa.2021.114859
EXPERT SYSTEMS WITH APPLICATIONS
Keywords
DocType
Volume
Capacitated Minimum Spanning Tree, Arc Time Windows, Mixed Integer Programming Formulation, Heuristics
Journal
176
ISSN
Citations 
PageRank 
0957-4174
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Manolis N. Kritikos192.59
George Ioannou210611.99