A variable neighborhood search for flying sidekick traveling salesman problem
From MaRDI portal
Publication:6088243
DOI10.1111/itor.12671arXiv1804.03954OpenAlexW2963421154WikidataQ127984619 ScholiaQ127984619MaRDI QIDQ6088243
Puca Huachi Vaz Penna, Júlia Cária de Freitas
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.03954
traveling salesman problemunmanned aerial vehicledrone deliverylast mile deliveryrandomized variable neighborhood descent
Related Items (28)
A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones ⋮ Designing a drone delivery network with automated battery swapping machines ⋮ A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection ⋮ The min-cost parallel drone scheduling vehicle routing problem ⋮ A mixed truck and robot delivery approach for the daily supply of customers ⋮ A variable neighborhood search for parcel delivery by vehicle with drone cycles ⋮ Truck and drone routing problem with synchronization on arcs ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ A general VNS for the multi-depot open vehicle routing problem with time windows ⋮ Modeling the flying sidekick traveling salesman problem with multiple drones ⋮ Trucks and drones cooperation in the last‐mile delivery process ⋮ Multiple traveling salesperson problem with drones: general variable neighborhood search approach ⋮ A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services ⋮ Exact models for the flying sidekick traveling salesman problem ⋮ Unmanned aerial vehicles/drones in vehicle routing problems: a literature review ⋮ Autonomous vessels: state of the art and potential opportunities in logistics ⋮ The two‐echelon routing problem with truck and drones ⋮ Robust traveling salesman problem with drone: balancing risk and makespan in contactless delivery ⋮ A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone ⋮ The vehicle routing problem with drones and drone speed selection ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ A new MILP formulation for the flying sidekick traveling salesman problem ⋮ A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup ⋮ Last‐mile delivery with drone and lockers ⋮ Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review ⋮ An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots ⋮ Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects ⋮ The parallel drone scheduling problem with multiple drones and vehicles
Cites Work
- The vehicle routing problem with drones: several worst-case results
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- Variable neighborhood search
- A multi-objective green UAV routing problem
- Variable neighborhood search: basics and variants
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The vehicle routing problem with drones: Extended models and connections
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- A Method for Solving Traveling-Salesman Problems
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
- Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic
- VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
This page was built for publication: A variable neighborhood search for flying sidekick traveling salesman problem
