Paper Info
Title
Two heuristics for the capacitated minimum spanning tree problem with time windows
Abstract
We consider the capacitated minimum spanning tree problem with time windows (CMSTPTW) and propose an enhancement of greedy heuristic for the uncapacitated version of it, showing that our algorithm significantly outperforms Solomon's one based on the R7 test problem. To examine the performance of our approach, we convert the vehicle routing data sets to appropriately model CMSTPTW instances and provide solutions for all of them; in addition, we compare the solutions we reach for the uncapacitated version of all instances and those obtained by Solomon to demonstrate the consistent superiority of the proposed method. Finally, we develop a second solution approach, the local domain priority heuristic, which when applied to the same data sets results in better solutions for the majority of the CMSTPTW instances, without excessive computational effort.
Year
DOI
Venue
2019
10.1080/01605682.2018.1447255
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Keywords
Field
DocType
Spanning tree,heuristics,time windows
Capacitated minimum spanning tree,Data set,Heuristic,Vehicle routing problem,Mathematical optimization,Computer science,Greedy algorithm,Heuristics,Spanning tree,Management science
Journal
Volume
Issue
ISSN
70.0
4.0
0160-5682
Citations 
PageRank 
References 
0
0.34
13
Authors
2
Name
Order
Citations
PageRank
Manolis N. Kritikos192.59
George Ioannou210611.99