Transportation Research Part E: Logistics and Transportation Review
An auction-enabled collaborative routing mechanism for omnichannel on-demand logistics through transshipment
Introduction
Global retail ecommerce sales are expected to increase to US$ 6.5 trillion by the end of 2023 (eMarketer, 2019). The rapid growth of this market leads to on-demand logistics in which delivery orders from both online or offline channels are immediately fulfilled with customer desired time, place and quantities (Hong et al., 2019). Increased service levels expressed in hours to deliver, is also rigidly required. Currently, most on-demand logistics operations are carried out on separate delivery networks from different professional or crowdsourced delivery contractors, with their own dedicated facilities and fleets (Bányai et al., 2018). Many companies face difficulties controlling omnichannel order fulfillment and reducing on-demand delivery costs. Further, although a set of accessible pickup locations (e.g., smart lockers and community stores) exist for every customer, these depots are not employed for cargo transshipment and consolidation.
This article investigates a new paradigm defined as an auction-enabled collaborative routing mechanism with transshipment (ACRT) for omnichannel on-demand logistics through resource sharing. We consider a service platform for the real-time management of on-demand pickup and delivery tasks, where multiple task shippers can trade with multiple task carriers. Task shippers are retailers in the omnichannel ecosystem who could be any grocery, shopping mall, pharmacy or flower shop. Individual customers can also be a shipper since the on-demand delivery of consumer-to-consumer direct shipments are widely operated within cities. Task carriers refer to a group of logistics service providers who own sufficient resources such as vehicles and drivers to complete on-demand deliveries. Effective transportation planning is able to improve social welfare including all stakeholders’ benefits or costs (Rouhani et al., 2016). In this article, the proposed ACRT aims to bring about positive social welfare with novel optimization mechanisms and technologies for shippers, carriers and city residents. Social welfare improvements involve three dimensions (i) shippers: payment for logistics services; (ii) carriers: transportation profit; (iii) city residents: reduction in greenhouse emissions.
Fig. 1 illustrates the differences between the conventional mode (a) and the transshipment-based collaborative mode (b) for omnichannel on-demand logistics. In the conventional delivery mode, shippers select carriers from the transportation market randomly or based on experience. Service pricing is usually fixed within a certain delivery area. Carriers process tasks separately, they are unable to cope with lumpy demands during peak hours but become under-utilized during off-peak periods. Carriers are self-interested and independent to each other while making their own decisions. In the proposed ACRT, shippers can purchase transport services more economically from an auction-enabled on-demand service platform. Carriers can outsource tasks through an arbitrary open facility to optimize delivery plans with reduced costs. Parcel lockers or community stores near the customers’ house can be utilized for transshipment.
It has been demonstrated that auction mechanisms provide a very effective way for collaboration in logistics (Karaenke et al., 2019). Several studies have addressed auction approaches in decentralized transportation optimization with carriers’ collaboration. Existing models are either focused on task allocation from shippers to carriers (Andres Figliozzi et al., 2003, Figliozzi et al., 2004, Figliozzi et al., 2005, Mes et al., 2007, Mes et al., 2013) or on shared task reallocation among carriers (Berger and Bierwirth, 2010, Dai and Chen, 2011, Dai et al., 2014, Gansterer and Hartl, 2016, Lyu et al., 2019). The problems for freight task sharing were examined in a static context where all tasks were revealed before planning. Social welfare for shippers and residents is scarcely considered. Here, we incorporate the allocation of new tasks and shared tasks reallocation through dynamic on-line auctions. To the best of our knowledge, there are limited studies considering combined decision-making for multiple stakeholders (including both shippers and carriers) with multiple objectives for on-demand logistics.
To enable more flexible trading and sharing in the carrier coalitions context, real-time transshipment is integrated into the ACRT paradigm. Dynamic tasks are allowed to be executed by multiple carriers. The advantage of transshipment-based collaborative routing is illustrated in Fig. 2. In a non-transshipment network, the paired pickup and delivery node of task 2 of one seller carrier have to be outsourced together to another actual carrier (Fig. 2a). In contrast, only the delivery node of task 2 is outsourced in the transshipment-based network (transshipped via the pickup node of task 3), instead of outsourcing the entire task 2 (Fig. 2b).
The routing component of the ACRT is a modified version of the dynamic pickup and delivery problem with transshipment and time windows (DPDPTTW). There has been a limited amount of research that has focused on the DPDPTTW in the transportation science and operations research literature. Thangiah et al. (2007) adapted the P&D heuristic of Shang and Cuff (1996) in examining DPDPTTW applications, however, the P&D heuristic in Shang and Cuff (1996) was designed to solve the static PDPTTW. In addition, the detailed algorithm for the design of transshipment insertion is missing in both studies. The above gaps constitute one of the objectives of this article.
In particular, this article aims to answer the following questions:
- 1.
What is an effective auction mechanism for the optimal procurement of on-demand delivery services as well as carrier collaborations in the ACRT paradigm?
- 2.
What is a dynamic task generation strategy for determining the most uneconomic path from a carrier’s network?
- 3.
How can the dynamic transshipment-based routing problem with ACRT requirements be solved?
- 4.
What are the impacts of key factors (e.g., demand density growth, urgency of tasks and auction interval) on individual, and total logistics network performance?
To cope with the complex ACRT problem, three mechanisms are designed including, (i) a two-stage auction mechanism (TAM), (ii) a transshipment-based task generation mechanism (TTGM), and (iii) a transshipment-based routing mechanism (TRM) (see Section 4). Compared with the conventional mode, the ACRT is evaluated via simulated omnichannel scenarios like business-to-customer (B2C) fulfillment, customer-to-customer (C2C) fulfillment and hybrid fulfillment of B2C and C2C. We further analyze the impact of key factors on the performance of the ACRT to investigate the practical significance of the proposed solution (see Section 5). A list of abbreviations used in this article can be found in Appendix A.
This article is organized as follows. In Section 2, we review the relevant literature. We describe the new paradigm of the ACRT for omnichannel on-demand logistics in Section 3. In Section 4, integrated methods of the ACRT involving TAM, TTGM and TRM are proposed. We present a computational study in Section 5 to quantitatively assess the solution feasibility with associated key impact analyses. Our conclusions and future research directions are given in Section 6.
Section snippets
Literature review
The related literature can be categorized into three dimensions: (1) technology-driven on-demand logistics; (2) auction-based transportation service trading; and (3) transshipment-based dynamic pickup and delivery. Finally, research gaps are summarized.
Paradigm of ACRT for omnichannel on-demand logistics
A collaborative routing platform can be considered as a service platform for the real-time management of on-demand pickup and delivery tasks, where multiple shippers can trade with multiple carriers. Shippers can be any retailers or individual customers who offer pickup and delivery tasks within the daily time period. Carriers refer to a group of logistics enterprises who can carry out on-demand tasks with sufficient transportation resources. In this service platform, we consider an omnichannel
ACRT mechanism design
An integrated mechanism designed for the complicated omnichannel on-demand logistics through transshipment consists of three sub-components is described in this section.
Computational study
This section aims to verify the performance of the ACRT. Additionally, sensitivity analyses are conducted to investigate the impacts of various key factors.
Conclusions
In this article, we investigate collaborative mechanisms for omnichannel on-demand logistics in real-time management. We develop an ACRT which considers an online platform to enable collaboration for each stakeholder such as shippers and carriers. A two-stage combinational auction mechanism is designed for dynamic on-demand tasks. A first price auction is adopted between shippers and carriers to minimize shippers’ payment. Task reallocation and sharing among carriers is then fulfilled in second
CRediT authorship contribution statement
Chaojie Guo: Conceptualization, Software, Data curation, Validation, Writing - original draft. Russell G. Thompson: Writing - review & editing, Methodology, Supervision. Greg Foliente: Visualization, Writing - review & editing. Xiang T.R. Kong: Conceptualization, Methodology, Writing - original draft, Writing - review & editing.
Acknowledgments
This work was supported by National Natural Science Foundation of China No. 71801154, and Science Foundation for Youth Scholars of Shenzhen University under grant 2019070 & 189692.
References (62)
- et al.
Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris
Transport. Res. Part E: Logist. Transport. Rev.
(2018) - et al.
Dynamic pickup and delivery problems
Eur. J. Oper. Res.
(2010) - et al.
Solutions to the request reassignment problem in collaborative carrier networks
Transport. Res. Part E: Logist. Transport. Rev.
(2010) - et al.
Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution
Transport. Res. Part B: Methodol.
(2020) - et al.
Collaborative urban transportation: Recent advances in theory and practice
Eur. J. Oper. Res.
(2019) - et al.
Physical internet enabled hyperconnected city logistics
Transp. Res. Procedia
(2016) - et al.
A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
Comput. Oper. Res.
(2018) - et al.
Collaborative vehicle routing: a survey
Eur. J. Oper. Res.
(2018) - et al.
Synchromodal logistics: An overview of critical success factors, enabling technologies, and open research issues
Transport. Res. Part E: Logist. Transport. Rev.
(2019) - et al.
Routing for an on-demand logistics service
Transport. Res. Part C: Emerg. Technol.
(2019)
Risk aversion and optimal reserve prices in first-and second-price auctions
J. Econ. Theory
Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce
Transport. Res. Part E: Logist. Transport. Rev.
A multi-round exchange mechanism for carrier collaboration in less than truckload transportation
Transport. Res. Part E: Logist. Transport. Rev.
Truthful auctions for e-market logistics services procurement with quantity discounts
Transport. Res. Part B: Methodol.
Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
Eur. J. Oper. Res.
Dynamic threshold policy for delaying and breaking commitments in transportation auctions
Transport. Res. Part C: Emerg. Technol.
Waiting strategies for the dynamic pickup and delivery problem with time windows
Transport. Res. Part B: Methodol.
Blockchain technology enabling the Physical Internet: A synergetic application framework
Comput. Ind. Eng.
An effects analysis of logistics collaboration in last-mile networks for CEP delivery services
Transp. Policy
Social welfare analysis of investment public–private partnership approaches for transportation projects
Transport. Res. Part A: Policy Practice
Multicriteria pickup and delivery problem with transfer opportunity
Comput. Ind. Eng.
On the activeness of intelligent Physical Internet containers
Comput. Ind.
Intermodal transportation service procurement with transaction costs under belt and road initiative
Transport. Res. Part E: Logist. Transport. Rev.
A collaborative urban distribution network
Procedia-Social Behav. Sci.
Real time simulation of auctioning and re-scheduling processes in hybrid freight markets
Transport. Res. Part B: Methodol.
Vehicle routing under consideration of transshipment in horizontal coalitions of freight carriers
Procedia CIRP
Simulation-based assessment of cargo bicycle and pick-up point in urban parcel delivery
Procedia Comput. Sci.
Framework for study of carrier strategies in auction-based transportation marketplace
Transp. Res. Rec.
Crowdsourced delivery-A dynamic pickup and delivery problem with ad hoc drivers
Transport. Sci.
The vehicle routing problem with transshipment facilities
Transport. Sci.
Smart scheduling: An integrated first mile and last mile supply approach
Complexity
Cited by (20)
Fostering collaboration and coordination in urban delivery: a multi-agent microsimulation model
2024, Research in Transportation EconomicsAuction mechanism-based order allocation for third-party vehicle logistics platforms
2023, Advanced Engineering InformaticsA rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment
2022, European Journal of Operational ResearchCitation Excerpt :Consequently, the problem should be considered in all its complexity, and heuristic algorithms become needed and valuable. Recent papers on transshipments are Bhatnagar & Lin (2019), Avci & Yildiz (2020), Guo, Thompson, Foliente, & Kong (2021), Li, Liao, Hu, & Shen (2020), Naderi, Kilic, & Dasci (2020), Dehghani, Abbasi, & Oliveira (2021). In this work, we test the performance of a rolling horizon approach.
Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions
2022, Transportation Research Part E: Logistics and Transportation ReviewCitation Excerpt :Xu et al. (2015) extended auction mechanisms to incorporate transaction costs. Guo et al. (2021) designed a combinatorial auction that allowed synergistic optimization of auctions and routing to support the collaborative routing decision of an on-demand logistics platform. Hammami et al. (2021) investigated a stochastic bid construction problem considering competitor uncertainty.
Data-driven ordering and transshipment decisions for online retailers and logistics service providers
2022, Transportation Research Part E: Logistics and Transportation ReviewCitation Excerpt :Specifically, from the horizontal collaboration perspective where companies operate at the same level, Lyu et al. (2019) found that partnering LSPs can share vehicle capacity to reduce empty mileage. From the vertical collaboration perspective where upstream and downstream participants in the logistics supply chain (e.g., suppliers, manufacturers, LSPs, and customers) collaborate, Guo et al. (2021a) proposed a collaborative routing algorithm for freight carriers, an algorithm that can benefit carriers and shippers in an on-demand logistics network with transshipment. Moreover, prior literature has also explored how to allocate costs or profits among the partners (Özener et al., 2013; Lai et al., 2019).
Providing dynamic route advice for urban goods vehicles: The learning process enhanced by the emerging technologies
2022, Transportation Research Procedia