Abstract

The network design problems studied in this paper are typically known in the Telecommunications literature as the Concentrator Location, Terminal Assignment and Terminal Layout Problems. These are versions of well-known Operations Research models such as Capacitated Location, Capacitated Assignment, Capacitated Minimum Spanning Tree, and Vehicle Routing. We describe two Simulated Annealing algorithms for solving them and analyze the results obtained through computational testing.

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 call

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.