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

Route selection on freight networks with weight and volume constraints

Author

Listed:
  • Hall, Randolph W.

Abstract

This paper investigates the properties of freight networks where flow is measured with two attributes (weight and volume) and where costs are linear. Two dual variables are associated with each arc, one representing the marginal cost of increasing the weight flow on the arc and the other representing the marginal cost of increasing the volume flow. Optimal routes are determined in two steps: (1) set weight and volume prices and solve shortest path problems, and (2) adjust weight and volume prices in a way that causes the dual objective to increase. Each iteration provides a feasible solution and a bound on the maximum improvement in the objective function. The algorithm is applied to various test problems, to identify the conditions where it is most important to account for multiattribute freight flows.

Suggested Citation

  • Hall, Randolph W., 1991. "Route selection on freight networks with weight and volume constraints," Transportation Research Part B: Methodological, Elsevier, vol. 25(4), pages 175-189, August.
    • Handle: RePEc:eee:transb:v:25:y:1991:i:4:p:175-189
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(91)90002-Z
    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.

    Citations

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


    Cited by:

    1. Popken, Douglas A., 1996. "An analytical framework for routing multiattribute multicommodity freight," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 133-145, April.
    2. Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.

    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:25:y:1991:i:4:p:175-189. 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.