Advanced Search
MyIDEAS: Login to save this article or follow this journal

Price planning for time-definite less-than-truckload freight services

Contents:

Author Info

  • Lin, Cheng-Chang
  • Lin, Dung-Ying
  • Young, Melanie M.
Registered author(s):

    Abstract

    Price planning simultaneous determines the service demand (with associated prices) and an operational plan to maximize a carrier's profit. We modeled this integral-constrained concave program in the link formulation and proposed an implicit enumeration embedded with Lagrangian Relaxation upper bounds to determine the optimal prices. Computations on Taiwan's time-definite less-than-truckload freight market showed that the carrier needs to simultaneously re-evaluate its network capacity while determining prices. The common practice of distance-based pricing that sets price by a base rate over direct shipment distance underestimates operating cost, specifically operating losses for short distance shipments.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S1366554509000040
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.

    Volume (Year): 45 (2009)
    Issue (Month): 4 (July)
    Pages: 525-537

    as in new window
    Handle: RePEc:eee:transe:v:45:y:2009:i:4:p:525-537

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
    Web: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic

    Related research

    Keywords: Pricing Logistics Hub-and-spoke network Lagrangian Relaxation Implicit enumeration;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Campbell, James F., 2013. "A continuous approximation model for time definite many-to-many transportation," Transportation Research Part B: Methodological, Elsevier, vol. 54(C), pages 100-112.
    2. Lin, Cheng-Chang & Lee, Shwu-Chiou, 2010. "The competition game on hub network design," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 618-629, May.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:45:y:2009:i:4:p:525-537. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.