Abstract
The dynamic vehicle routing problem is an extension of conventional routing problems whose particularities are that information can change after initial routes have been constructed or that not all the information is known when the routing process takes place. The main interest of this type of problem is that it corresponds to many real word applications (repair services, courier mail services, taxi cab services). In this paper, we study the particular case of the dynamic vehicle routing problem with time windows (DVRPTW) in which occurrences of new customers appear over time. We propose an original resolution approach based on a genetic algorithm adapted to this dynamic optimisation context. Taguchi's tables have been used in order to adjust the parameters of our genetic algorithm. Experimental results based on the modified Solomon benchmarks show the efficacy of our approach as compared to other meta-heuristic approaches
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.
