Price planning for time-definite less-than-truckload freight services
Cheng-Chang Lin,
Dung-Ying Lin and
Melanie M. Young
Transportation Research Part E: Logistics and Transportation Review, 2009, vol. 45, issue 4, 525-537
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.
Keywords: Pricing; Logistics; Hub-and-spoke; network; Lagrangian; Relaxation; Implicit; enumeration (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554509000040
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:45:y:2009:i:4:p:525-537
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().