Abstract
We describe in this article a new heuristic approach for the capacitated fixed-charge network design problem. This is a well known NP -hard problem that has been extensively studied. We propose to use local branching to tackle it. Local branching is a novel metaheuristic technique presented by Fischetti and Lodi [Local branching. Mathematical Programming Series B 2003;98:23–47] that utilizes a general MIP solver to explore neighborhoods. Our implementation is tested on a large set of benchmark instances. The results show that the method outperforms the best heuristic approaches found in the literature.
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.
