The two‐echelon routing problem with truck and drones
From MaRDI portal
Publication:6082194
DOI10.1111/itor.13052arXiv2004.02275OpenAlexW3197006902MaRDI QIDQ6082194
No author found.
Publication date: 29 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.02275
Related Items (1)
Cites Work
- A survey on two-echelon routing problems
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- The vehicle routing problem with drones: several worst-case results
- The electric two-echelon vehicle routing problem
- Solving the multi-vehicle multi-covering tour problem
- The vehicle routing problem with service level constraints
- New valid inequalities for the two-echelon capacitated vehicle routing problem
- Greedy randomized adaptive search procedures
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- Multi-visit drone routing problem
- The min-cost parallel drone scheduling vehicle routing problem
- The Generalized Covering Salesman Problem
- Optimization by GRASP
- The Covering Tour Problem
- The vehicle routing problem with drones: Extended models and connections
- The Covering Salesman Problem
- A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
- A variable neighborhood search for flying sidekick traveling salesman problem
- Unnamed Item
This page was built for publication: The two‐echelon routing problem with truck and drones
