考慮碳排放的卡車-無人機(jī)聯(lián)合取送貨路徑規(guī)劃

打開文本圖片集

中圖分類號：U116 文獻(xiàn)標(biāo)志碼：A

Abstract： In order to solve the problem of the truck-drone coordinated delivery path planning，which involves the simultaneously pickup and delivery while reducing carbon emissions，the objective is set to minimize the total transportation cost with constraints such as the balance of entries and exits of trucks and drones，the unique access and traversal， load limit，endurance limit，and the absence of self-loop，and a path planning model for truck-drone joint pickup and delivery considering carbon emission is established. The K -means-improved ant colony optimization two-stage algorithm is designed to obtain the approximate optimal solution of the model. The K -means algorithm is used to cluster customer points， clustering center points serve as truck stop locations，and the customer points within a cluster to which a clustering center belongs serve as drone stop locations.On the basis of the original transition probability formula of the ant colony optimization algorithm，a new probability selection factor is introduced，which increases the probability of paths of customer points with smaler net pickup quantities being selected. Simulation results show that compared to solo truck transport，the total transportation time of the truck-drone transport mode is shorten by 5.04% on average，the total transportation cost is reduced by 15.56% on average，and the carbon emission is reduced by 32.50% on average. In most scenarios，the proposed model can solve the problem quickly；especially in the scenario where customer points are evenly distributed，the effectiseven better.

Key words： simultaneous pickup and delivery；carbon emission； truck-drone joint transport； pathplanning

0 引言

隨著互聯(lián)網(wǎng)的高速發(fā)展，各類電商平臺涌現(xiàn)，快遞量也與日俱增。（剩余13263字）