HEURISTIC APPROACHES TO ROAD NETWORK OPTIMIZATION

This paper is concerned with the mathematical programming problems which arise in formulating a model to optimize the allocation of investment funds between different proposed improvement schemes in a road network. An account is first given of a number of different formulations which have been suggested and it is shown that the only acceptable models require the use of programming techniques which are not sufficiently powerful to be able to optimize investment when more than a relatively small number of projects are considered. This has led to the development of heuristic algorithms. The remainder of the paper seeks to make the case for more careful consideration of the ways in which heuristic algorithms are employed. Although it is framed in terms of road networks, the argument is one generally applicable to many areas of engineering optimization where heuristics are used. /Author/TRRL/

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/0305215X
• Corporate Authors:

  GORDON AND BREACH SCIENCE PUB.

  AMSTERDAM:
  ,    
• Authors:
  • PEARMAN, A D
• Publication Date: 1974

Language

• English

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 37-49
• Serial:
  • Engineering Optimization
  • Volume: 1
  • Issue Number: 1
  • Publisher: Street NW
  • ISSN: 0305-215X

Subject/Index Terms

• TRT Terms: Algorithms; Digital computers; Heuristic methods; Highway design; Highways; Improvements; Investments; Mathematical models; Networks; Optimization; Roads
• Uncontrolled Terms: Optimum; Road networks
• ITRD Terms: 8673: Digital computer; 2755: Highway; 2855: Highway design; 227: Investment; 6473: Mathematical model
• Subject Areas: Design; Highways; Planning and Forecasting; I10: Economics and Administration; I21: Planning of Transport Infrastructure;

Filing Info

• Accession Number: 00099146
• Record Type: Publication
• Source Agency: Transport and Road Research Laboratory (TRRL)
• Files: ITRD, TRIS
• Created Date: Oct 18 1975 12:00AM