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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
