An Exact Approach for a Variant of the FS-TSP-Reference-Cited by-同舟云学术

An Exact Approach for a Variant of the FS-TSP

Published:2021 Issue: Volume:52 Page:51-58
ISSN:2352-1465
Container-title:Transportation Research Procedia
language:en
Short-container-title:Transportation Research Procedia

Author:

Boccia Maurizio,Masone Adriano,Sforza Antonio,Sterle Claudio

Publisher

Elsevier BV

Reference17 articles.

1. Optimization approaches for the traveling salesman problem with drone;Agatz;Transportation Science,2018

2. Last mile delivery by drones: an estimation of viable market potential and access to citizens across European cities;Aurambout;European Transport Research Review,2019

3. Optimizing Drone-Assisted Last-Mile Deliveries: The Vehicle Routing Problem with Flexible Drones;Bakir;Optimization-online,2020

4. Dynamic programming approaches for the traveling salesman problem with drone;Bouman;Networks,2018

5. The unmanned aerial vehicle routing and trajectory optimisation problem, a taxonomic review;Coutinho;Computers & Industrial Engineering,2018

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New features for customer classification in the Flying Sidekick Traveling Salesman Problem;Expert Systems with Applications;2024-08

2. Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone;INFORMS Journal on Computing;2024-02-01

3. A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems;Applied Soft Computing;2023-11

4. Last‐mile delivery with drone and lockers;Networks;2023-10-04

5. A new MILP formulation for the flying sidekick traveling salesman problem;Networks;2023-07-05