Abstract
The vehicle routing problem with simultaneous delivery and pickup(VRPSDP) is a general variant of Vehicle Routing Problem(VRP). Although there is a vast literature related to the VRP, little is dealing with the VRPSDP. In this paper, we propose a heuristic algorithm for solving the VRPSDP, based on the Ant Colony System(ACS). In our algorithm, the classical construction phase of the ACS is replaced by an alternative insertion procedure. Numerical experimental results show that our algorithm is effective for solving the VRPSDP, and it gets better solutions than those reported in the literature.
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.
