Multiple traveling salesperson problem with drones: general variable neighborhood search approach
From MaRDI portal
Publication:6068716
DOI10.1016/j.cor.2023.106390MaRDI QIDQ6068716
Baybars İbroşka, Selin Özpeynirci, Özgür Özpeynirci
Publication date: 13 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Variable neighborhood search for the pharmacy duty scheduling problem
- Variable neighborhood search for location routing
- The vehicle routing problem with drones: several worst-case results
- A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- Variable neighbourhood search: methods and applications
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- The piggyback transportation problem: transporting drones launched from a flying warehouse
- Neighborhood structures for the container loading problem: a VNS implementation
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- 0-1 quadratic knapsack problem solved with VNS algorithm
- 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 Covering Salesman Problem
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Variable neighborhood search: Principles and applications
- A tabu search method for the truck and trailer routing problem
- Unmanned aerial vehicles/drones in vehicle routing problems: a literature review
- A variable neighborhood search for flying sidekick traveling salesman problem
This page was built for publication: Multiple traveling salesperson problem with drones: general variable neighborhood search approach
