Price planning for time-definite less-than-truckload freight services
AbstractPrice 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 InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.
Volume (Year): 45 (2009)
Issue (Month): 4 (July)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
If references are entirely missing, you can add them using this form.