Vehicle-only delivery routes. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Delivery route diagram of Stage 4. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Manhattan delivery route. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Final delivery routes of vehicle-assisted UAVs. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Customer point clustering results. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Schematic diagram of chromosome mutation. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Flight path in three-dimensional space. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

IKM Pseudo – code. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Locations of open areas and no-fly zones. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Division map of the delivery area. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Schematic diagram of cluster centers in Phase 1. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

UAV-only delivery routes. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Shapiro-Wilk test results. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

t-Test analysis results. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Schematic diagram of no-fly zones. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Delivery plans for different vehicles. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Schematic diagram of obstacle-avoiding paths. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

UAV delivery routes in Phase 2. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Basic information of customer points. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”

Initial vehicle delivery routes in Phase 3. by Yingbo Mao (22522192)

“…Given that this model falls into the category of NP-hard problems, we have designed a four-stage heuristic solution. First, an improved K-means algorithm (IKM) is used to cluster customer points under the constraint of the UAV’s maximum flight radius, so as to determine vehicle parking points. …”