Abstract
The integration of multiple constraints of the vehicle routing problem (VRP) variants is computationally expensive. Although VRPs have been well researched, variants are typically treated in isolation, whereas industry requires integrated solutions. The concept of time window compatibility is introduced in this paper in order to improve the initial solution algorithm when combining variants such as a heterogeneous fleet, double scheduling, and multiple time windows. The paper also reports on the algorithm's results when benchmark test data is used. Results relate to both the computational burden of the algorithm, as well as to the quality of the initial solution.
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.
