Abstract
In this paper, a hybrid Genetic Algorithm (GA) is proposed to solve the Vehicle Routing Problems with Dynamic Requests (VRPDR). The proposed hybrid GA primarily involves the following parts. First, a greedy split is introduced, which is fit for the VRPDR. Second, the adjacent-exchange-based local search is proposed. Third, a novel mutation operator, named the insert mutation, is proposed. The experimental results show that the proposed hybrid GA is effective.
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.
