IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v6y2002i1d10.1023_a1013337324030.html
   My bibliography  Save this article

A Simulated Annealing Approach to Communication Network Design

Author

Listed:
  • Marcus Randall

    (Bond University)

  • Graham McMahon

    (Bond University)

  • Stephen Sugden

    (Bond University)

Abstract

This paper explores the use of the meta-heuristic search algorithm Simulated Annealing for solving a minimum cost network synthesis problem. This problem is a common one in the design of telecommunication networks. The formulation we use models a number of practical problems with hop-limit, degree and capacity constraints. Emphasis is placed on a new approach that uses a knapsack polytope to select amongst a number of pre-computed traffic routes in order to synthesise the network. The advantage of this approach is that a subset of the best routes can be used instead of the whole set, thereby making the process of designing large networks practicable. Using simulated annealing, we solve moderately large networks (up to 30 nodes) efficiently.

Suggested Citation

  • Marcus Randall & Graham McMahon & Stephen Sugden, 2002. "A Simulated Annealing Approach to Communication Network Design," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 55-65, March.
    • Handle: RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013337324030
    DOI: 10.1023/A:1013337324030
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1013337324030
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1013337324030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Koulamas, C & Antony, SR & Jaen, R, 1994. "A survey of simulated annealing applications to operations research problems," Omega, Elsevier, vol. 22(1), pages 41-56, January.
    2. Connolly, David T., 1990. "An improved annealing scheme for the QAP," European Journal of Operational Research, Elsevier, vol. 46(1), pages 93-100, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dalila B. M. M. Fontes & S. Mahdi Homayouni & Mauricio G. C. Resende, 2022. "Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1284-1322, September.
    2. Konak, Abdullah, 2012. "Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation," European Journal of Operational Research, Elsevier, vol. 218(3), pages 829-837.
    3. Pinar Yildirim & Yanhao Wei & Christophe Bulte & Joy Lu, 2020. "Social network design for inducing effort," Quantitative Marketing and Economics (QME), Springer, vol. 18(4), pages 381-417, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Mu-Chen, 2001. "Tolerance synthesis by neural learning and nonlinear programming," International Journal of Production Economics, Elsevier, vol. 70(1), pages 55-65, March.
    2. Zeinal Hamadani, Ali & Abouei Ardakan, Mostafa & Rezvan, Taghi & Honarmandian, Mohammad Mehran, 2013. "Location-allocation problem for intra-transportation system in a big company by using meta-heuristic algorithm," Socio-Economic Planning Sciences, Elsevier, vol. 47(4), pages 309-317.
    3. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    4. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    5. Moriguchi, Kai & Ueki, Tatsuhito & Saito, Masashi, 2020. "Establishing optimal forest harvesting regulation with continuous approximation," Operations Research Perspectives, Elsevier, vol. 7(C).
    6. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2014. "A Birnbaum-importance based genetic local search algorithm for component assignment problems," Annals of Operations Research, Springer, vol. 212(1), pages 185-200, January.
    7. Yu, Bin & Yang, Zhong-Zhen & Yao, Baozhen, 2009. "An improved ant colony optimization for vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 171-176, July.
    8. P Chen & C-C Wu & W-C Lee, 2006. "A bi-criteria two-machine flowshop scheduling problem with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1113-1125, September.
    9. Burkard, Rainer E. & Cela, Eranda, 1995. "Heuristics for biquadratic assignment problems and their computational comparison," European Journal of Operational Research, Elsevier, vol. 83(2), pages 283-300, June.
    10. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    11. Alkhamis, Talal M. & Hasan, Merza & Ahmed, Mohamed A., 1998. "Simulated annealing for the unconstrained quadratic pseudo-Boolean function," European Journal of Operational Research, Elsevier, vol. 108(3), pages 641-652, August.
    12. Menz, Georg & Schlichting, André & Tang, Wenpin & Wu, Tianqi, 2022. "Ergodicity of the infinite swapping algorithm at low temperature," Stochastic Processes and their Applications, Elsevier, vol. 151(C), pages 519-552.
    13. Tian, Peng & Ma, Jian & Zhang, Dong-Mo, 1999. "Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism," European Journal of Operational Research, Elsevier, vol. 118(1), pages 81-94, October.
    14. LeBlanc, Larry J. & Shtub, Avraham & Anandalingam, G., 1999. "Formulating and solving production planning problems," European Journal of Operational Research, Elsevier, vol. 112(1), pages 54-80, January.
    15. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    16. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    17. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
    18. Thi-Kien Dao & Tien-Szu Pan & Trong-The Nguyen & Jeng-Shyang Pan, 2018. "Parallel bat algorithm for optimizing makespan in job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 451-462, February.
    19. Muppani (Muppant), Venkata Reddy & Adil, Gajendra Kumar, 2008. "Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach," Omega, Elsevier, vol. 36(4), pages 609-618, August.
    20. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013337324030. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.