4.5 Article

The Orienteering Problem with Drones

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Operations Research & Management Science

Exact and heuristic approaches to Truck-Drone Delivery Problems

Julia C. Freitas et al.

Summary: Collaborative delivery using drones and trucks has been studied to improve delivery efficiency and reduce costs. This paper proposes a novel Mixed Integer Programming formulation and a heuristic approach to address the Truck-Drone Delivery Problems (TDDPs). The efficiency of the algorithm was evaluated on benchmark instances, showing significant improvement in solutions.

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS (2023)

Article Operations Research & Management Science

The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs

Nicola Morandi et al.

Summary: In the TSP-mD problem, a truck and multiple drones work together to provide customer service in the minimum amount of time. The optimal solutions for TSP-mD may involve revisiting nodes and retraversing arcs. The necessity of arc retraversals has not been previously investigated, but excluding them may increase the optimal value under certain conditions. Furthermore, there is no polynomial-time heuristic that can approximate the metric TSP-mD within a constant factor unless P ≠ NP.

TRANSPORTATION SCIENCE (2023)

Article Operations Research & Management Science

A branch-and-price algorithm for a team orienteering problem with fixed-wing drones

Kaarthik Sundar et al.

Summary: This paper focuses on a team orienteering problem with multiple fixed-wing drones and proposes a branch-and-price algorithm to solve it. The paper discusses the kinematic constraints of fixed-wing drones and their implications on the routing problem, providing a systematic technique to address these constraints. Additionally, the paper presents extensive computational experiments to validate the effectiveness of the algorithms.

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS (2022)

Article Management

Exact models for the flying sidekick traveling salesman problem

Mauro Dell'Amico et al.

Summary: This paper introduces three enhanced formulations for the flying sidekick traveling salesman problem, which significantly reduce the number of constraints and improve solution efficiency compared to traditional models, as well as demonstrating how to modify the models for various problem variants.

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2022)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for budgeted prize-collecting covering subgraph problems

N. Morandi et al.

Summary: We introduce a class of budgeted prize-collecting covering subgraph problems and develop a branch-and-cut framework and a Benders decomposition for their exact solution. We observe that the former algorithm generally has shorter computational times, but the latter can outperform the former in specific instances. Additionally, we validate our algorithmic frameworks for the cases where the subgraph is a cycle and a tree, and identify novel symmetry-breaking inequalities.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Economics

Vehicle routing problems with drones equipped with multi-package payload compartments

M. Amine Masmoudi et al.

Summary: The paper extends the vehicle routing problem with drones to include a fleet of drones equipped with multi-package payload compartments, aiming to maximize profit. An adaptive multi-start simulated annealing algorithm is proposed to efficiently solve this problem. Experimental results show the algorithm's superiority and extensive analyses provide managerial insights.

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2022)

Article Management

Parcel delivery by vehicle and drone

Amro M. El-Adle et al.

Summary: This study investigates a single-vehicle parcel delivery problem where customers can be served by either the vehicle or a portable companion drone. The problem is modeled as a Traveling Salesman Problem with Drone and formulated as a 0-1 mixed-integer program to minimize the joint tour duration, with enhancements made to improve tractability.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2021)

Article Operations Research & Management Science

Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem

Mauro Dell'Amico et al.

Summary: The paper addresses a problem related to drone-assisted deliveries, specifically focusing on the Flying Sidekick Traveling Salesman Problem. Improved formulations and solving methods are proposed, which can find optimal solutions for most instances. Two versions of the problem are considered, with methodologies adapted to both and a comparison provided.

OPTIMIZATION LETTERS (2021)

Article Computer Science, Hardware & Architecture

Modeling the flying sidekick traveling salesman problem with multiple drones

Mauro Dell'Amico et al.

Summary: This article introduces a new model for the Flying Sidekick Traveling Salesman Problem that involves drone delivery, considers the scheduling of drone operations, and proposes novel formulations to improve solution efficiency. The study compares different models and solutions to optimize drone delivery operations.

NETWORKS (2021)

Article Computer Science, Interdisciplinary Applications

An exact solution method for the TSP with Drone based on decomposition

Sebastian A. Vasquez et al.

Summary: The study focuses on the Traveling Salesman Problem with Drone (TSP-D) model, proposes a mixed-integer programming formulation, and designs a decomposition algorithm which shows effectiveness through empirical testing on random instances.

COMPUTERS & OPERATIONS RESEARCH (2021)

Article Transportation Science & Technology

A column-and-row generation approach for the flying sidekick travelling salesman problem

Maurizio Boccia et al.

Summary: This study proposes a new representation of the FS-TSP based on an extended graph, which is modeled using integer linear programming and column generation method to solve synchronization issues. The method has been tested on a large set of benchmark instances and it shows competitive performance in small scale and medium scale instances.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Operations Research & Management Science

Exact Methods for the Traveling Salesman Problem with Drone

Roberto Roberti et al.

Summary: Efficient handling of last-mile deliveries is becoming increasingly crucial in modern society. By combining trucks and drones, synchronization of flows through a compact mixed-integer linear program and dynamic programming recursions can significantly improve delivery efficiency. This approach outperforms state-of-the-art methods and shows promising results for optimizing last-mile deliveries with the use of drones.

TRANSPORTATION SCIENCE (2021)

Article Management

Algorithms based on branch and bound for the flying sidekick traveling salesman problem

Mauro Dell'Amico et al.

Summary: The paper explores the use of drones in urban logistics, introducing a branch and bound algorithm for small instances and a heuristic algorithm for larger instances. Experimental results demonstrate the effectiveness of the algorithms in providing state-of-the-art solutions for different scales of instances.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2021)

Article Transportation Science & Technology

The Multi-visit Traveling Salesman Problem with Multi-Drones

Zhihao Luo et al.

Summary: This study focuses on the multi-visit traveling salesman problem with multi-drones, proposing a multi-start tabu search algorithm and validating its accuracy and efficiency on small-scale instances. The results demonstrate a significant cost reduction under certain conditions.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Transportation Science & Technology

Exact methods for the traveling salesman problem with multiple drones

Sara Cavani et al.

Summary: This paper focuses on delivery systems with a single traditional vehicle and multiple drones working together. A compact Mixed-Integer Linear Programming (MILP) model is proposed for the Traveling Salesman Problem with Multiple Drones (TSP-MD), along with families of valid inequalities. An exact decomposition approach based on the compact MILP and a branch-and-cut algorithm can solve instances with up to 24 customers to proven optimality, surpassing existing methods.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Economics

Humanitarian relief network assessment using collaborative truck-and-drone system

Guowei Zhang et al.

Summary: The increasing number and severity of natural and man-made disasters worldwide has led to calls for more precise and effective humanitarian responses. A collaborative truck-and-drone system was developed as a post-disaster assessment tool to optimize routing and maximize the value of information collected.

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2021)

Article Transportation Science & Technology

The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones

Chase C. Murray et al.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2020)

Article Transportation Science & Technology

Truck-drone team logistics: A heuristic approach to multi-drop route planning

Pedro L. Gonzalez-R et al.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2020)

Article Operations Research & Management Science

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

Wei Zhang et al.

NAVAL RESEARCH LOGISTICS (2020)

Article Computer Science, Artificial Intelligence

A learnheuristic approach for the team aerial drone motion constraints orienteering problem with

Christopher Bayliss et al.

APPLIED SOFT COMPUTING (2020)

Article Computer Science, Hardware & Architecture

A branch-and-cutapproach and alternative formulations for the traveling salesman problem with drone

Daniel Schermer et al.

NETWORKS (2020)

Article Chemistry, Analytical

Traffic Patrolling Routing Problem with Drones in an Urban Road System

He Luo et al.

SENSORS (2019)

Article Engineering, Industrial

Truck-drone hybrid delivery routing: Payload-energy dependency and No-Fly zones

Ho Young Jeong et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2019)

Article Computer Science, Interdisciplinary Applications

A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone

Stefan Poikonen et al.

INFORMS JOURNAL ON COMPUTING (2019)

Article Transportation Science & Technology

A decomposition-based iterative optimization algorithm for traveling salesman problem with drone

Emine Es Yurek et al.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2018)

Article Operations Research & Management Science

Optimization Approaches for the Traveling Salesman Problem with Drone

Niels Agatz et al.

TRANSPORTATION SCIENCE (2018)

Article Computer Science, Hardware & Architecture

Dynamic programming approaches for the traveling salesman problem with drone

Paul Bouman et al.

NETWORKS (2018)

Article Computer Science, Interdisciplinary Applications

Time constrained maximal covering salesman problem with weighted demands and partial coverage

Gizem Ozbaygin et al.

COMPUTERS & OPERATIONS RESEARCH (2016)

Review Management

Orienteering Problem: A survey of recent variants, solution approaches and applications

Aldy Gunawan et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

Article Transportation Science & Technology

The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery

Chase C. Murray et al.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2015)

Review Management

The orienteering problem: A survey

Pieter Vansteenwegen et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)

Article Computer Science, Hardware & Architecture

The Ring Star Problem:: Polyhedral analysis and exact algorithm

M Labbé et al.

NETWORKS (2004)