IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v13y1979i1p81-90.html
   My bibliography  Save this article

The structure of the solution set to network optimisation problems

Author

Listed:
  • Pearman, A. D.

Abstract

This paper argues that both heuristic and non-heuristic algorithms for the road network optimisation problem would benefit from a greater understanding of the structure of the set of feasible solutions to such problems. In order to provide this, a comparative study of a number of spatial combinatorial problems was undertaken. The results show that the road network optimisation problem is rich in good sub-optimal solutions. The implications of this finding for the development of optimising and heuristic algorithms are discussed, and some suggestions made as to where future research on network optimisation problems could most fruitfully be directed.

Suggested Citation

  • Pearman, A. D., 1979. "The structure of the solution set to network optimisation problems," Transportation Research Part B: Methodological, Elsevier, vol. 13(1), pages 81-90, March.
    • Handle: RePEc:eee:transb:v:13:y:1979:i:1:p:81-90
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(79)90008-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:eee:transb:v:13:y:1979:i:1:p:81-90. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.