The Multiple Traveling Salesman Problem with Backup Coverage

Dhein, Guilherme; Neto, Alberto Francisco Kummer; Araújo, Olinto César Bassi de

doi:10.1016/j.endm.2018.03.018

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kota and Jarmai (2015) introduced an algorithm for the fixed destination multi-depot mTSP with multiple tours [23]. Dhein et al (2018) considered a variant of the mTSP in which the distance between any two salesmen cannot be greater than a pre-specified value to ensure that the salesman can assist each other in a timely manner if an emergency occurs [24].…”

Section: Tsp and Mtspmentioning

confidence: 99%

On Optimizing a Multi-Mode Last-Mile Parcel Delivery System with Vans, Truck and Drone

et al. 2021

View full text Add to dashboard Cite

This work focuses on the optimization of a last-mile delivery system with multiple transportation modes. In this scenario, parcels need to be delivered to each customer point. The major feature of the problem is the combination of a fleet of road vehicles (vans) with a drone. Each van visits a subset of demand nodes to be determined according to the route of the van. The drone serves the customers not served by vans. At the same time, considering the safety, policy and terrain as well as the need to replace the battery, the drone needs to be transported by truck to the identified station along with the parcel. From each such station, the drone serves a subset of customers according to a direct assignment pattern, i.e., every time the drone is launched, it serves one demand node and returns to the station to collect another parcel. Similarly, the truck is used to transport the drone and cargo between stations. This is somewhat different from the research of other scholars. In terms of the joint distribution of the drone and road vehicle, most scholars will choose the combination of two transportation tools, while we use three. The drone and vans are responsible for distribution services, and the trucks are responsible for transporting the goods and drone to the station. The goal is to optimize the total delivery cost which includes the transportation costs for the vans and the delivery cost for the drone. A fixed cost is also considered for each drone parking site corresponding to the cost of positioning the drone and using the drone station. A discrete optimization model is presented for the problem in addition to a two-phase heuristic algorithm. The results of a series of computational tests performed to assess the applicability of the model and the efficiency of the heuristic are reported. The results obtained show that nearly 10% of the cost can be saved by combining the traditional delivery mode with the use of a drone and drone stations.

show abstract