Abstract
The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem. The static version of this problem has received special attention. However, most real world vehicle routing problems are dynamic, where information relevant to the routing can change after the initial routes have been constructed. The common approach in this scenario is to restart the algorithm when novel information arrives, but this type of restart methods does not use the memory to improve the quality of the final result. In this paper, the hybrid CGH column generation heuristic (Alvarenga et al., 2005) is modified in order to use the routes generated during the optimization process.
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.
