Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/61180
Title: Nonlinear pricing for stochastic container leasing system
Authors: Jiao, W
Yan, H 
Pang, KW 
Keywords: Container leasing
Dynamic mechanism design
Nonlinear pricing problem
Price discrimination
Issue Date: 2016
Publisher: Pergamon Press
Source: Transportation research. Part B, Methodological, 2016, v. 89, p. 1-18 How to cite?
Journal: Transportation research. Part B, Methodological 
Abstract: With the substantial upsurge of container traffic, the container leasing company thrives on the financial benefits and operational flexibility of leasing containers requested by shippers. In practice, container lease pricing problem is different from the consumer product pricing in consideration of the fair value of container, limited customer types and monopolistic supply market. In view of the durability of container and the diversified lease time and quantity, the pricing is a challenging task for the leasing company. This paper examines the monopolist's nonlinear pricing problems in static and dynamic environments. In particular, the leasing company designs and commits a menu of price and hire quantity/time pairs to maximize the expected profit and in turn customers choose hire quantities/time to maximize their surpluses according to their hire preferences. In a static environment, closed-form solutions are obtained for different groups of customers with multiple types subject to capacity constraint. In a dynamic environment, we address two customer types and derive closed-form solutions for the problem of customers with hire time preference. Further, we show that the effect of the capacity constraint increases with time of the planning horizon when customers have the same hire time preference; while in the case with different hire time preferences, the capacity constraint has opposite effects on the low and high type customers. Last, the case of customers with hire quantity preference is discussed. We focus on the lease with alternative given sets of hire time and use dynamic programming to derive the numerical optimal hire time sequence.
URI: http://hdl.handle.net/10397/61180
ISSN: 0191-2615
EISSN: 1879-2367
DOI: 10.1016/j.trb.2016.03.012
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Oct 8, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
Citations as of Oct 15, 2017

Page view(s)

37
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.