Service fairness and value of customer information for the stochastic container relocation problem under flexible service policy

Simple item page
dc.contributor.authorFeng, Yuanjun
dc.contributor.authorSong, Dong-Ping
dc.contributor.authorLi, Dong
dc.contributor.authorXie, Ying
dc.date.accessioned2022-10-17T09:29:48Z
dc.date.available2022-10-17T09:29:48Z
dc.date.issued2022-10-10
dc.description.abstractThis paper considers the optimization of service efficiency and service fairness in a Stochastic Container Relocation Problem (SCRP) under flexible service policies at a container terminal. Under the flexible service policy, the external trucks arriving within the same time window can be served out of sequence, which may raise a concern of service fairness. We incorporate the concept of service fairness into the SCRP in two phases. In phase 1, we propose a multiple sub-time windows-based flexible service policy, under which each time window will be divided into multiple sub-time windows and the flexible service policy is only applied to each individual sub-time window. In phase 2, the SCRP is formulated as a dynamic programming model with two lexicographically ordered objectives representing both relocation efficiency and service fairness, which is solved via a hierarchical iterative approach. In addition, we investigate whether the information of trucks’ arrival probability over the time window (which represents the customer preference information) would add value to the terminal operators. Extensive computational experiments are conducted to evaluate the impacts of the number of sub-time windows and to examine the impacts and value of customer preference information in various scenarios. The results show interesting trade-offs between efficiency and fairness. As the number of sub-time windows increases, the service fairness is generally improving (but not guaranteed) while the expected number of relocations is increasing. It is found that the customer preference information can be valuable in some circumstances, especially when each truck indicates a certain arrival sub-time window.en_UK
dc.identifier.citationFeng Y, Song DP, Li D, Xie Y. (2022) Service fairness and value of customer information for the stochastic container relocation problem under flexible service policy. Transportation Research Part E: Logistics and Transportation Review, Volume 167, November 2022, Article number 102921en_UK
dc.identifier.issn1366-5545
dc.identifier.urihttps://doi.org/10.1016/j.tre.2022.102921
dc.identifier.urihttps://dspace.lib.cranfield.ac.uk/handle/1826/18567
dc.language.isoenen_UK
dc.publisherElsevieren_UK
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectOR in port operationsen_UK
dc.subjectStochastic container relocationen_UK
dc.subjectTruck service policyen_UK
dc.subjectService fairnessen_UK
dc.subjectValue of informationen_UK
dc.titleService fairness and value of customer information for the stochastic container relocation problem under flexible service policyen_UK
dc.typeArticleen_UK

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Service_fairness_and_value_of_customer_information-2022.pdf
Size:
597.71 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.63 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Staff publications (SoM)