Abstract
This paper focuses on the time windows factor in vehicle routing problem with simultaneous pickups and deliveries. In vehicle routing problem with time windows and simultaneous pickups and deliveries (VRPTWSPD), vehicles must wait and can not start service immediately if they arrive earlier ahead of the time when pickup goods are ready. Meanwhile, tardiness may cause penalty cost. We propose a mathematical model for VRPTWSPD and develop a genetic algorithm to solve it. The results for the numerical experiments validate the effectiveness of the algorithm proposed in this paper, and demonstrate the significance of introducing time windows. Moreover, we discuss the algorithm performance under varying penalty values of tardiness through sensitivity analysis.
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.
