Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: mathematical model and adaptive variable neighborhood search with neighborhood categorization
From MaRDI portal
Publication:6586259
Cites work
- A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
- A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services
- A new MILP formulation for the flying sidekick traveling salesman problem
- Multi-visit drone routing problem
- The min-cost parallel drone scheduling vehicle routing problem
- The mothership and drone routing problem
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements
- The piggyback transportation problem: transporting drones launched from a flying warehouse
- The vehicle routing problem with drones: several worst-case results
- Truck and drone routing problem with synchronization on arcs
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- Variable neighborhood search: the power of change and simplicity
This page was built for publication: Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: mathematical model and adaptive variable neighborhood search with neighborhood categorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586259)
