A competitive heuristic algorithm for vehicle routing problems with drones
From MaRDI portal
Cites work
- A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
- A variable neighborhood search for flying sidekick traveling salesman problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows
- Drone location and vehicle fleet planning with trucks and aerial drones
- Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions
- The vehicle routing problem with drones: extended models and connections
- The vehicle routing problem with drones: several worst-case results
- Variable neighborhood search
This page was built for publication: A competitive heuristic algorithm for vehicle routing problems with drones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982831)