This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, ...This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, based on the traffic conditions. During the periods of peak traffic hours, the vehicles travel at low speeds and during non-peak hours, the vehicles travel at higher speeds. A survey by TCI and IIM-C (2014) found that stoppage delay as percentage of journey time varied between five percent and 25 percent, and was very much dependent on the characteristics of routes. Costs of delay were also estimated and found not to affect margins by significant amounts. This study aims to overcome such problems arising out of traffic congestions that lead to unnecessary delays and hence, loss in customers and thereby valuable revenues to a company. This study suggests alternative routes to minimize travel times and travel distance, assuming a congestion in traffic situation. In this study, an efficient GA-based algorithm has been developed for the TDVRP, to minimize the total distance travelled, minimize the total number of vehicles utilized and also suggest alternative routes for congestion avoidance. This study will help to overcome and minimize the negative effects due to heavy traffic congestions and delays in customer service. The proposed algorithm has been shown to be superior to another existing algorithm in terms of the total distance travelled and also the number of vehicles utilized. Also the performance of the proposed algorithm is as good as the mathematical model for small size problems.展开更多
The increasing popularity of e-commerce brings large volumes of sporadic orders from different customers,which have to be handled by freight trucks and distribution centers. To improve the level of service and reduce ...The increasing popularity of e-commerce brings large volumes of sporadic orders from different customers,which have to be handled by freight trucks and distribution centers. To improve the level of service and reduce the total shipping cost as well as traffic congestions in urban area, flexible methods and optimal vehicle routing strategies should be adopted to improve the efficiency of distribution effort. An optimization solution for vehicle routing and scheduling problem with time window for sporadic orders (VRPTW- S) was provided based on time-dependent travel time extracted from floating car data (FCD) with ArcGIS platform. A VRPTW-S model derived from the traditional vehicle routing problem was proposed, in which uncertainty of customer orders and travel time were considered. Based on this model, an advanced vehicle routing algorithm was designed to solve the problem. A case study of Shenzhen, Guangdong province, China, was conducted to demonstrate the vehicle operation flow,in which process of FCD and efficiency of delivery systems under different situations were discussed. The final results demonstrated a good performance of application of time-dependent travel time information using FCD in solving vehicle routing problems.展开更多
Traffic congestion is one of the main challenges in transportation engineering. It directly impactsthe economy by increasing travel time and affecting the environment by excessive fuel consumptionand emission. Road ro...Traffic congestion is one of the main challenges in transportation engineering. It directly impactsthe economy by increasing travel time and affecting the environment by excessive fuel consumptionand emission. Road route recommendation to overcome the congestion by alternativeroute suggestions has gained high importance. The existing route recommendation systems areproposed using the reinforcement learning algorithm (Q-learning). The techniques suggestedin this paper are state-action-reward-state-action (SARSA) algorithm and dynamic programming(DP) to guide the commuters to reach the destination with an optimal solution. The algorithmconsiders travel time, cost, flexibility, and traffic intensity as the user preference attributes torecommend an optimal route. The recommended system is implemented by building a roadnetwork graph. We assign values to each user preference attribute along the edges, which cantake high(1) or low(0) values. By considering these values, the system recommends the route.The proposed system performance is evaluated based on computation time, cumulative reward,and accuracy. The results show that DP outperforms the SARSA algorithm.展开更多
The advancement of autonomous technology makes electric-powered drones an excellent choice for flexible logistics services at the last mile delivery stage.To reach a balance between green transportation and competitiv...The advancement of autonomous technology makes electric-powered drones an excellent choice for flexible logistics services at the last mile delivery stage.To reach a balance between green transportation and competitive edge,the collaborative routing of drones in the air and trucks on the ground is increasingly invested in the next generation of delivery,where it is particularly reasonable to consider customer time windows and time-dependent travel times as two typical time-related factors in daily services.In this paper,we propose the Vehicle Routing Problem with Drones under Time constraints(VRPD-T)and focus on the time constraints involved in realistic scenarios during the delivery.A mixed-integer linear programming model has been developed to minimize the total delivery completion time.Furthermore,to overcome the limitations of standard solvers in handling large-scale complex issues,a space-time hybrid heuristic-based algorithm has been developed to effectively identify a high-quality solution.The numerical results produced from randomly generated instances demonstrate the effectiveness of the proposed algorithm.展开更多
文摘This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, based on the traffic conditions. During the periods of peak traffic hours, the vehicles travel at low speeds and during non-peak hours, the vehicles travel at higher speeds. A survey by TCI and IIM-C (2014) found that stoppage delay as percentage of journey time varied between five percent and 25 percent, and was very much dependent on the characteristics of routes. Costs of delay were also estimated and found not to affect margins by significant amounts. This study aims to overcome such problems arising out of traffic congestions that lead to unnecessary delays and hence, loss in customers and thereby valuable revenues to a company. This study suggests alternative routes to minimize travel times and travel distance, assuming a congestion in traffic situation. In this study, an efficient GA-based algorithm has been developed for the TDVRP, to minimize the total distance travelled, minimize the total number of vehicles utilized and also suggest alternative routes for congestion avoidance. This study will help to overcome and minimize the negative effects due to heavy traffic congestions and delays in customer service. The proposed algorithm has been shown to be superior to another existing algorithm in terms of the total distance travelled and also the number of vehicles utilized. Also the performance of the proposed algorithm is as good as the mathematical model for small size problems.
基金National Natural Science Foundation of China(No.71101109)Shanghai Pujiang Program,China(No.12PJ1404600)
文摘The increasing popularity of e-commerce brings large volumes of sporadic orders from different customers,which have to be handled by freight trucks and distribution centers. To improve the level of service and reduce the total shipping cost as well as traffic congestions in urban area, flexible methods and optimal vehicle routing strategies should be adopted to improve the efficiency of distribution effort. An optimization solution for vehicle routing and scheduling problem with time window for sporadic orders (VRPTW- S) was provided based on time-dependent travel time extracted from floating car data (FCD) with ArcGIS platform. A VRPTW-S model derived from the traditional vehicle routing problem was proposed, in which uncertainty of customer orders and travel time were considered. Based on this model, an advanced vehicle routing algorithm was designed to solve the problem. A case study of Shenzhen, Guangdong province, China, was conducted to demonstrate the vehicle operation flow,in which process of FCD and efficiency of delivery systems under different situations were discussed. The final results demonstrated a good performance of application of time-dependent travel time information using FCD in solving vehicle routing problems.
文摘Traffic congestion is one of the main challenges in transportation engineering. It directly impactsthe economy by increasing travel time and affecting the environment by excessive fuel consumptionand emission. Road route recommendation to overcome the congestion by alternativeroute suggestions has gained high importance. The existing route recommendation systems areproposed using the reinforcement learning algorithm (Q-learning). The techniques suggestedin this paper are state-action-reward-state-action (SARSA) algorithm and dynamic programming(DP) to guide the commuters to reach the destination with an optimal solution. The algorithmconsiders travel time, cost, flexibility, and traffic intensity as the user preference attributes torecommend an optimal route. The recommended system is implemented by building a roadnetwork graph. We assign values to each user preference attribute along the edges, which cantake high(1) or low(0) values. By considering these values, the system recommends the route.The proposed system performance is evaluated based on computation time, cumulative reward,and accuracy. The results show that DP outperforms the SARSA algorithm.
基金supported by the National Natural Science Foundation of China(No.61961146005)。
文摘The advancement of autonomous technology makes electric-powered drones an excellent choice for flexible logistics services at the last mile delivery stage.To reach a balance between green transportation and competitive edge,the collaborative routing of drones in the air and trucks on the ground is increasingly invested in the next generation of delivery,where it is particularly reasonable to consider customer time windows and time-dependent travel times as two typical time-related factors in daily services.In this paper,we propose the Vehicle Routing Problem with Drones under Time constraints(VRPD-T)and focus on the time constraints involved in realistic scenarios during the delivery.A mixed-integer linear programming model has been developed to minimize the total delivery completion time.Furthermore,to overcome the limitations of standard solvers in handling large-scale complex issues,a space-time hybrid heuristic-based algorithm has been developed to effectively identify a high-quality solution.The numerical results produced from randomly generated instances demonstrate the effectiveness of the proposed algorithm.