Abstract
With the emphasis of the exhaust gas emission of the transportation vehicles, the mode of picking up and delivering products simultaneously has become a challenging issue in the vehicle routing problem (VRP). To remedy this issue, we investigate a special VRP with realistic constraints including product classification, pickup-delivery, and time window (PC-VRPSPDTW). Then, a hybrid algorithm combining tabu search and artificial immune algorithm (TS-AIA) is proposed. In the proposed algorithm, the earliest time and residual capacity (ETRC) heuristic is designed to generate the initial population. Then, two metaheuristics including variable neighborhood search and large neighborhood search are cooperated to balance the exploration and exploitation abilities. Besides, a new crossover operator is designed to increase the population diversity. Finally, a series of comparative experiments on the extension version of the Solomon’s benchmarks are performed to verify the effectiveness of the proposed algorithm.
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.
