The city-wide ridesharing package delivery is becoming popular as it provides a convenience such as extra profits to the vehicle’s driver and high traffic efficiency to the city.The vehicle dispatching is a significa...The city-wide ridesharing package delivery is becoming popular as it provides a convenience such as extra profits to the vehicle’s driver and high traffic efficiency to the city.The vehicle dispatching is a significant issue to improve the ridesharing efficiency in package delivery.The classic one-hop ridesharing package delivery requires the highly similar paths between the package and the vehicle given by the limited detour time,which depresses the ridesharing efficiency.To tackle this problem,a city-wide vehicle dispatching strategy for the multi-hop ridesharing package delivery was proposed,where a package is permitted to be delivered sequentially by different vehicles,until arriving the destination.The study formulates the vehicle dispatching as a maximum multi-dimensional bipartite matching problem with the goal of maximizing the total saving distance given by the limited detour time and ridesharing capacity.A multi-hop ridesharing vehicle dispatching algorithm was proposed to solve this problem by selecting the farthest reachable locker and multi-dimensional matching.Simulation results based on real vehicle dataset of Beijing demonstrate the effectiveness and efficiency of the proposed vehicle dispatching strategy.展开更多
Time compression in supply chains is a crucial aspect involved in the integration of warehousing and transport operations in the manufacturing industries. Sup- ply chain flows could be interrupted due to many sources ...Time compression in supply chains is a crucial aspect involved in the integration of warehousing and transport operations in the manufacturing industries. Sup- ply chain flows could be interrupted due to many sources of delays that lead to additional time in dispatching process and reduction in customer service level. The problem considered in this paper consists of long waiting times of loading vehicles inside the plant. This work presents a simulation-based study to minimize vehicle dispatching time in a steel wire plant. Value stream map is developed to present a system perspective of processes involved in the overall supply chain. Process activity mapping is com- pleted to provide a step by step analysis of activities involved in the vehicle dispatch process. A simulation model is developed for the system and a new model is proposed to improve the delivery performance by mini- mizing vehicles＇ waiting time.展开更多
基金the National Natural Science Foundation of China(61701037)the National Undergraduate Innovation and Entrepreneurship Taining Program。
文摘The city-wide ridesharing package delivery is becoming popular as it provides a convenience such as extra profits to the vehicle’s driver and high traffic efficiency to the city.The vehicle dispatching is a significant issue to improve the ridesharing efficiency in package delivery.The classic one-hop ridesharing package delivery requires the highly similar paths between the package and the vehicle given by the limited detour time,which depresses the ridesharing efficiency.To tackle this problem,a city-wide vehicle dispatching strategy for the multi-hop ridesharing package delivery was proposed,where a package is permitted to be delivered sequentially by different vehicles,until arriving the destination.The study formulates the vehicle dispatching as a maximum multi-dimensional bipartite matching problem with the goal of maximizing the total saving distance given by the limited detour time and ridesharing capacity.A multi-hop ridesharing vehicle dispatching algorithm was proposed to solve this problem by selecting the farthest reachable locker and multi-dimensional matching.Simulation results based on real vehicle dataset of Beijing demonstrate the effectiveness and efficiency of the proposed vehicle dispatching strategy.
文摘Time compression in supply chains is a crucial aspect involved in the integration of warehousing and transport operations in the manufacturing industries. Sup- ply chain flows could be interrupted due to many sources of delays that lead to additional time in dispatching process and reduction in customer service level. The problem considered in this paper consists of long waiting times of loading vehicles inside the plant. This work presents a simulation-based study to minimize vehicle dispatching time in a steel wire plant. Value stream map is developed to present a system perspective of processes involved in the overall supply chain. Process activity mapping is com- pleted to provide a step by step analysis of activities involved in the vehicle dispatch process. A simulation model is developed for the system and a new model is proposed to improve the delivery performance by mini- mizing vehicles＇ waiting time.
