Show simple item record

dc.contributor.authorYang, X
dc.contributor.authorZhang, J
dc.contributor.authorJiao, W
dc.contributor.authorYan, H
dc.date.accessioned2022-05-19T12:03:45Z
dc.date.issued2022-05-19
dc.date.updated2022-05-19T10:50:12Z
dc.description.abstractIn this paper, we consider a container leasing firm that has elementary and premium containers, which are downward substitutable and for use by elementary contract customers (ECCs), premium contract customers (PCCs), as well as walk-in customers (WICs). ECCs can be satisfied by elementary containers or premium ones at discounted prices while PCCs only accept premium containers. WICs can be satisfied by any type of container at different prices. The objective is to maximise the expected total rental revenue by managing its limited capacity. We formulate this problem as a discrete-time Markov Decision Process and show the submodularity and concavity of the value function. Based on this, we show that the optimal policy can be characterised by a series of rationing thresholds, a series of substitution thresholds and a priority threshold, all of which depend on the system states. We further give conditions under which the optimal policy can be simplified. Numerical experiments are conducted to show the impact of the substitution of two items on the revenue, to compare the performance of the optimal policy with those of the commonly used policies and to investigate the influence of arrival rates on the optimal policy. Last, we extend the basic model to consider different rental durations, ECCs’ acceptance behaviour and endogenous prices for WICs.en_GB
dc.description.sponsorshipBritish Academyen_GB
dc.description.sponsorshipNational Natural Science Foundation of China/Research Grants Council of Hong Kong Joint Research Schemeen_GB
dc.description.sponsorshipNational Natural Science Foundation of China/Research Grants Council of Hong Kong Joint Research Schemeen_GB
dc.description.sponsorshipNational Natural Science Foundation of Chinaen_GB
dc.description.sponsorshipNational Natural Science Foundation of Chinaen_GB
dc.description.sponsorshipZhejiang Shuren University Researchen_GB
dc.description.sponsorshipBeijing Logistics Informatics Research Baseen_GB
dc.identifier.citationPublished online 19 May 2022en_GB
dc.identifier.doihttps://doi.org/10.1287/mnsc.2022.4425
dc.identifier.grantnumberSRG19\190059en_GB
dc.identifier.grantnumber71661167009en_GB
dc.identifier.grantnumberN_PolyU531/16en_GB
dc.identifier.grantnumber7217101en_GB
dc.identifier.grantnumber71831001en_GB
dc.identifier.grantnumberKXJ0121605en_GB
dc.identifier.urihttp://hdl.handle.net/10871/129685
dc.language.isoenen_GB
dc.publisherInstitute for Operations Research and Management Sciencesen_GB
dc.rights© 2022 INFORMSen_GB
dc.subjectContainer leasingen_GB
dc.subjectcapacity rationingen_GB
dc.subjectMarkov Decision Processen_GB
dc.subjectdownward substitutionen_GB
dc.titleOptimal capacity rationing policy for a container leasing system with multiple kinds of customers and substitutable containersen_GB
dc.typeArticleen_GB
dc.date.available2022-05-19T12:03:45Z
dc.identifier.issn0025-1909
dc.descriptionThis is the final version. Available from the Institute for Operations Research and Management Sciences via the DOI in this record. en_GB
dc.identifier.eissn1526-5501
dc.identifier.journalManagement Scienceen_GB
dc.relation.ispartofManagement Science
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_GB
dcterms.dateAccepted2022-03-31
rioxxterms.versionVoRen_GB
rioxxterms.licenseref.startdate2022-03-31
rioxxterms.typeJournal Article/Reviewen_GB
refterms.dateFCD2022-05-19T10:50:16Z
refterms.versionFCDP
refterms.dateFOA2022-05-19T12:04:09Z
refterms.panelCen_GB
refterms.dateFirstOnline2022-05-19


Files in this item

This item appears in the following Collection(s)

Show simple item record

© 2022 INFORMS
Except where otherwise noted, this item's licence is described as © 2022 INFORMS