The vehicle scheduling problem at a construction site considering road restrictions
This study investigates vehicle scheduling and path planning problems on field roads after large equipment transportation vehicles enter construction sites.Due to road width limitations and varying task priorities,vehicles have difficulty traveling in opposite directions on the same road.Furthermore,the large equipment transportation vehicles have different priorities depending on their loads and urgency of the transportation.To address these challenges,this study constructs an integer programming model based on spatiotemporal network technology that minimizes the total travel time of all vehicles on the site by considering road restrictions and vehicle priorities.Furthermore,vehicle flow balance and meeting avoidance constraints are incorporated into the model.Moreover,a heuristic algorithm is designed to efficiently solve the model and obtain the spatiotemporal path of each vehicle,thereby providing guidance for vehicle path planning and passing each other.The effectiveness of the proposed model and algorithm is demonstrated through multiple cases based on an actual wind farm road network.The computational results show that the algorithm can quickly solve the vehicle path planning problem at various scales.Additionally,it can guarantee short waiting time to avoid vehicle meeting while eliminate spatiotemporal conflicts.Moreover,the proposed approach showed high transportation efficiency.
construction siteroad restrictionvehicle scheduling problemspatiotemporal networkconflict avoidance
万方数据
维普
