Skip Navigation

The Computer Journal 1968 10(4):347-351; doi:10.1093/comjnl/10.4.347
© 1968 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mitra, G.
Right arrow Articles by Wolfenden, K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A computer technique for optimizing the sites and heights of transmission line towers—a dynamic programming approach*

G. Mitra and K. Wolfenden §

University of London Institute of Computer Science, 44 Gordon Square, London, UK

Given the survey data of a transmission line route and the choice of available towers of suspension type and of angle towers a dynamic programming algorithm is described which chooses and sites the towers (the location and angle of the angle towers being prescribed) in such a way that the overall cost of running the line from one end of the route to the other, subject to all the established design constraints, is a minimum. The EMA program has been successfully run at the University of London Atlas Computer using exacting test data supplied by C.E.G.B.


* This paper was first received on 29 Sept. 1966; the editors regret that it was not published earlier, owing to a misunderstanding.

§ University of London Institute of Computer Science, 44 Gordon Square, London, W.C.1.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.