Abstract
This paper presents a modification of the well-known Solomon (1987) sequential insertion heuristic I1 for the Vehicle Routing Problem with Time Windows (VRPTW). VRPTW involves servicing customers within a pre-specified service time window by homogeneously capacitated vehicles from a single depot. By using two new measures for the additional time needed to insert a customer in the route, significantly better solutions are obtained for relatively short routes compared to the original Solomon (1987) sequential insertion heuristic I1. Because high-quality initial heuristics often allow local searches and metaheuristics to achieve better solutions more quickly, the new approach is likely to help generating better solutions to practical routing problems.
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.
