Abstract
Abstract In this paper, we study a non-capacitated Vehicle Routing Problem (VRP) where not necessarily all clients need to be visited and the goal is to minimize the length of the longest vehicle route. An Integer Programming Formulation, a Branch-and-cut (BC) method and a Local Branching (LB) framework that uses BC as the inner solver are presented. Sharper upper bounds are obtained by LB, when the same time limit was imposed on the execution times of both approaches. Our results also suggest that the min-max nature of the objective function combined with the fact that not all vertices need to be visited make such problem very difficult to solve.
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.
