Abstract
The Vehicle Routing Problem with Hard Time Window(VRPHTW) is a kind of Vehicle Routing Problem(VRP) which has a lot of applications.The existing heuristics of this problem hold shortcomings such as complex structure,lots of parameters and low efficiency.Therefore,Time Difference Insertion Heuristics(TDIH) for VRPHTW was proposed.The algorithm introduced the concept of Time Difference(TD),and took TD as a heuristic rule evaluation indicator.Compared to other classic heuristics,the algorithm was characterized with fewer parameters and simpler structure.The computational results on the benchmark problems show that the algorithm is better than the Solomon's insertion heuristics and Potvin's parallel insertion heuristics.
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.
