The volume of instant delivery has witnessed a significant growth in recent years.Given the involvement of numerous heterogeneous stakeholders,instant delivery operations are inherently characterized by dynamics and u...The volume of instant delivery has witnessed a significant growth in recent years.Given the involvement of numerous heterogeneous stakeholders,instant delivery operations are inherently characterized by dynamics and uncertainties.This study introduces two order dispatching strategies,namely task buffering and dynamic batching,as potential solutions to address these challenges.The task buffering strategy aims to optimize the assignment timing of orders to couriers,thereby mitigating demand uncertainties.On the other hand,the dynamic batching strategy focuses on alleviating delivery pressure by assigning orders to couriers based on their residual capacity and extra delivery dis tances.To model the instant delivery problem and evaluate the performances of order dis patching strategies,Adaptive Agent-Based Order Dispatching(ABOD)approach is developed,which combines agent-based modelling,deep reinforcement learning,and the Kuhn-Munkres algorithm.The ABOD effectively captures the system’s uncertainties and heterogeneity,facilitating stakeholders learning in novel scenarios and enabling adap tive task buffering and dynamic batching decision-makings.The efficacy of the ABOD approach is verified through both synthetic and real-world case studies.Experimental results demonstrate that implementing the ABOD approach can lead to a significant increase in customer satisfaction,up to 275.42%,while simultaneously reducing the deliv ery distance by 11.38%compared to baseline policies.Additionally,the ABOD approach exhibits the ability to adaptively adjust buffering times to maintain high levels of customer satisfaction across various demand scenarios.As a result,this approach offers valuable sup port to logistics providers in making informed decisions regarding order dispatching in instant delivery operations.展开更多
In this paper, a fabrication scheduling problem concerning the production of components at a single manufacturing facility was studied, in which the manufactured components are subsequently assembled into a finite num...In this paper, a fabrication scheduling problem concerning the production of components at a single manufacturing facility was studied, in which the manufactured components are subsequently assembled into a finite number of end products. Each product was assumed to comprise a common component to all jobs and a unique component to itself. Common operations were processed in batches and each batch required a setup time. A product is completed when both its two operations have been processed and are available. The optimality criterion considered was the minimization of weighted flow time. For this scheduling problem, the optimal schedules were described in a weignted shortest processing time first （WSPT） order and two algorithms were constructed corresponding to the batch availability and item availability, respectively.展开更多
基金This work was supported in part by the National Natural Science Foundation of China[72101188]the Shanghai Municipal Science and Technology Major Project[2021SHZDZX0100]the Fundamental Research Funds for the Central Universities.
文摘The volume of instant delivery has witnessed a significant growth in recent years.Given the involvement of numerous heterogeneous stakeholders,instant delivery operations are inherently characterized by dynamics and uncertainties.This study introduces two order dispatching strategies,namely task buffering and dynamic batching,as potential solutions to address these challenges.The task buffering strategy aims to optimize the assignment timing of orders to couriers,thereby mitigating demand uncertainties.On the other hand,the dynamic batching strategy focuses on alleviating delivery pressure by assigning orders to couriers based on their residual capacity and extra delivery dis tances.To model the instant delivery problem and evaluate the performances of order dis patching strategies,Adaptive Agent-Based Order Dispatching(ABOD)approach is developed,which combines agent-based modelling,deep reinforcement learning,and the Kuhn-Munkres algorithm.The ABOD effectively captures the system’s uncertainties and heterogeneity,facilitating stakeholders learning in novel scenarios and enabling adap tive task buffering and dynamic batching decision-makings.The efficacy of the ABOD approach is verified through both synthetic and real-world case studies.Experimental results demonstrate that implementing the ABOD approach can lead to a significant increase in customer satisfaction,up to 275.42%,while simultaneously reducing the deliv ery distance by 11.38%compared to baseline policies.Additionally,the ABOD approach exhibits the ability to adaptively adjust buffering times to maintain high levels of customer satisfaction across various demand scenarios.As a result,this approach offers valuable sup port to logistics providers in making informed decisions regarding order dispatching in instant delivery operations.
文摘In this paper, a fabrication scheduling problem concerning the production of components at a single manufacturing facility was studied, in which the manufactured components are subsequently assembled into a finite number of end products. Each product was assumed to comprise a common component to all jobs and a unique component to itself. Common operations were processed in batches and each batch required a setup time. A product is completed when both its two operations have been processed and are available. The optimality criterion considered was the minimization of weighted flow time. For this scheduling problem, the optimal schedules were described in a weignted shortest processing time first （WSPT） order and two algorithms were constructed corresponding to the batch availability and item availability, respectively.
