Open Access. Powered by Scholars. Published by Universities.®

Business Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Business

A Simulated Annealing Approach To Communication Network Design, Stephen J. Sugden, Marcus Randall, Graham Mcmahon Mar 2009

A Simulated Annealing Approach To Communication Network Design, Stephen J. Sugden, Marcus Randall, Graham Mcmahon

Stephen Sugden

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 …


A Class Of Direct Search Methods For Nonlinear Integer Programming, Stephen J. Sugden Dec 1991

A Class Of Direct Search Methods For Nonlinear Integer Programming, Stephen J. Sugden

Stephen Sugden

This work extends recent research in the development of a number of direct search methods in nonlinear integer programming. The various algorithms use an extension of the well-known FORTRAN MINOS code of Murtagh and Saunders as a starting point. MINOS is capable of solving quite large problems in which the objective function is nonlinear and the constraints linear. The original MINOS code has been extended in various ways by Murtagh, Saunders and co-workers since the original 1978 landmark paper. Extensions have dealt with methods to handle both nonlinear constraints, most notably MINOS/AUGMENTED and integer requirements on a subset of the …