Abstract
This paper studies an unpaired pickup and delivery vehicle routing problem allowing for multi-visit. The problem consists of two interacted decisions: the pairing of supply and demand and the vehicle routing. Given the complexity of the problem, a novel unified model is formulated to decouple the interactions between the two decisions. Based on the unified model, some valid inequalities are derived and a tabu search algorithm is proposed. The computational results show that the tabu search algorithm can provide high quality solutions to the problem under investigation and the closely related problem studied in Chen et al. (2014).
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 callMore From: Transportation Research Part E: Logistics and Transportation Review
Disclaimer: 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.
