Abstract
We extend the Traveling Repairman Problem (TRP) by assuming a single truck which can stop at customer locations and launch drones multiple times from each stop location to serve customers. The problem is mathematically modeled, several bound analyses are conducted to determine the maximum possible improvements in customer waiting times, and an efficient hybrid Tabu Search-Simulated Annealing algorithm is developed to solve the problem. The results of evaluations on several problem instances suggest that the system can yield considerable reductions in customer waiting time for a wide range of model parameters compared to the conventional delivery models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Part E: Logistics and Transportation Review
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
