Summary of An Evolutionary Algorithm For the Vehicle Routing Problem with Drones with Interceptions, by Carlos Pambo and Jacomine Grobler
An Evolutionary Algorithm For the Vehicle Routing Problem with Drones with Interceptions
by Carlos Pambo, Jacomine Grobler
First submitted to arxiv on: 21 Sep 2024
Categories
- Main: Artificial Intelligence (cs.AI)
- Secondary: Computers and Society (cs.CY); Emerging Technologies (cs.ET); Optimization and Control (math.OC)
GrooveSquid.com Paper Summaries
GrooveSquid.com’s goal is to make artificial intelligence research accessible by summarizing AI papers in simpler terms. Each summary below covers the same AI paper, written at different levels of difficulty. The medium difficulty and low difficulty versions are original summaries written by GrooveSquid.com, while the high difficulty version is the paper’s original abstract. Feel free to learn from the version that suits you best!
| Summary difficulty | Written by | Summary |
|---|---|---|
| High | Paper authors | High Difficulty Summary Read the original abstract here |
| Medium | GrooveSquid.com (original content) | Medium Difficulty Summary The paper proposes an evolutionary algorithm to solve the vehicle routing problem with drones with interception (VRPDi), a variation of the classic vehicle routing problem that involves scheduling trucks and drones to make deliveries to customer nodes. The VRPDi allows for drone interception at the truck’s location or after delivery, adding complexity to the traditional problem. The proposed algorithm is tested on the travelling salesman problem with drones (TSPD) dataset by Bouman et al. (2015), showing improvements in total delivery time between 39% and 60% compared to the vehicle routing problem without drones. The results are further benchmarked against algorithms in Dillon et al. (2023) and Ernst (2024). The algorithm satisfactorily solves problems with up to 100 nodes in a reasonable amount of time, outperforming existing methods. |
| Low | GrooveSquid.com (original content) | Low Difficulty Summary This paper looks at using trucks and drones to deliver things to people’s homes or businesses. They’re trying to figure out the best way to schedule these deliveries so that everything runs smoothly. The problem gets harder when you add in the possibility of drones meeting up with trucks on the road or after a delivery is made. To solve this problem, they created an algorithm that can find good solutions for big problems (with up to 100 nodes). This algorithm worked better than some other methods did. |
