Abstract
AbstractThe symmetric vehicle routing problem with simultaneous pickup and deliveries is considered. The current state‐of‐the‐art method to solve this problem employs the idea of a no‐good cut. This article achieves an order of magnitude improvement in the computational time needed to solve difficult problem instances by generalizing the no‐good cuts and developing a way to generate improved no‐good cuts much earlier in a branch‐and‐bound tree. Results are reported on benchmark instances in literature and new difficult instances generated by the authors. Some polyhedral results are presented about the strength of the generalized no‐good cuts for a special case of the problem.
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.
