EconPapers    
Economics at your fingertips  
 

Dynamic container drayage with uncertain request arrival times and service time windows

Shuai Jia, Haipeng Cui, Rui Chen and Qiang Meng

Transportation Research Part B: Methodological, 2022, vol. 166, issue C, 237-258

Abstract: Container drayage plays a critical role in intermodal global container transportation, as it accomplishes the first- and last-mile shipment of containers. A container drayage operator dispatches a set of tractors and a set of trailers to transport containers within a local area. An important aspect of the operations is that the arrival times of service requests are uncertain, which means that the operator should respond to the requests dynamically. Moreover, since customers usually impose time windows on container pickup and delivery, it would be important to exploit the service flexibilities of requests when allocating resources in order to enhance the resource efficiency. In this paper, we study a dynamic container drayage problem that arises from the practical operations of container drayage. We develop a Markov decision process (MDP) model for the problem to capture the dynamic interactions between the drayage operator and the uncertain environment. For solving the MDP model, we propose a novel integrated reinforcement learning and integer programming method, in which reinforcement learning enables real-time responses to requests by determining whether each request should be served immediately upon arrival or be held for a period of time, while integer programming plans resource allocation periodically for serving the accrued requests. The proposed method aims to identify a fleet management policy that exploits requests’ service flexibilities to maximize the operator’s service capacity and profitability. We also evaluate the performance of the proposed method on instances generated from the operational data of a container drayage operator in Singapore.

Keywords: Fleet management; Dynamic container drayage; Uncertain request arrival times; Service time windows; Reinforcement learning; Integer programming (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191261522001692
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:transb:v:166:y:2022:i:c:p:237-258

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.trb.2022.10.010

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:transb:v:166:y:2022:i:c:p:237-258