An Exact Approach for a Variant of the FS-TSP

Boccia, Maurizio; Masone, Adriano; Sforza, Antonio; Sterle, Claudio

doi:10.1016/j.trpro.2021.01.008

Cited by 15 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The weight of packages, w, demanded by each customer was distributed uniformly over the range [0, 5]. We fixed the energy capacity, e max , to 40 and used e(w) = (1+(w∕5) 4 ), which is meant to impose a soft cap maximum weight of five pounds, to align with comments made by Amazon CEO, Jeff Bezos, during an interview [2]. The hovering and the launch penalty constants, hov and LaunchP, were set to 0.5 and to 1, respectively.…”

Section: Computational Resultsmentioning

confidence: 99%

“…A Greedy Randomized Adaptive Search Procedure heuristic and an adaptation of the heuristic in [22] for the FSTSP were proposed to solve larger instances, with up to 100 customers. After [15], different contributions focused on the exact solution of this problem [4,25,28]. In particular, the state of the art is represented by the dynamic programming approach proposed in [28], since it optimally solves instances with up to 39 customers.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements

2022

Self Cite

View full text Add to dashboard Cite

In recent years, the usage of drones in last‐mile logistics has stirred great interest in the operations research community. Many papers have considered schemes of hybrid truck‐and‐drone delivery. In this paper, we focus on the Multivisit Drone Routing Problem with Edge Launches (MVDRP‐EL) which assumes: a heterogenous set of packages, a drone capable of carrying multiple packages at a time and that can be launched and retrieved along an edge, a flexible launch/retrieval site set, and a user‐defined energy depletion function. We believe this paper is the first to exploit edge launch ability through a global continuous approach. In this context, we propose an original formulation based on the Covering Salesman Problem to compute a valid lower bound for the problem and an iterative solution method to determine a MVDRP‐EL solution with quality launch/retrieval sites along the road network edges. Each iteration of the solution method consists of two phases. In the first phase, the road network edges are discretized to obtain launch/retrieval sites, and a first solution is determined. In the second phase, the truck route is set and we reduce the completion time by carefully synchronizing truck and drone routes by solving an original Mixed Integer Second Order Cone Program. The lower bound formulation and the proposed method have been tested on several instances and results indicate the effectiveness of the proposed method and the potential value of launching along an edge, respectively.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements

2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…They are able to solve all the M10‐instances , and 80 and 5 M20‐instances of the considering a drone endurance equal to 20 and 40 min, respectively. The same authors then extend their method in [5] and [3], including cyclic sortie and trying to use the proposed method in combination with data science techniques, respectively.…”

Section: Literature Reviewmentioning

confidence: 99%

A new MILP formulation for the flying sidekick traveling salesman problem

et al. 2023

Self Cite

View full text Add to dashboard Cite

Nowadays, truck‐and‐drone problems represent one of the most studied classes of vehicle routing problems. The Flying Sidekick Traveling Salesman Problem (FS‐TSP) is the first optimization problem defined in this class. Since its definition, several variants have been proposed differing for the side constraints related to the operating conditions and for the structure of the hybrid truck‐and‐drone delivery system. However, regardless the specific problem under investigation, determining the optimal solution of most of these routing problems is a very challenging task, due to the vehicle synchronization issue. On this basis, this work provides a new arc‐based integer linear programming formulation for the FS‐TSP. The solution of such formulation required the development of a branch‐and‐cut solution approach based on new families of valid inequalities and variable fixing strategies. We tested the proposed approach on different sets of benchmark instances. The experimentation shows that the proposed method is competitive or outperforms the state‐of‐the‐art approaches, providing either the optimal solution or improved bounds for several instances unsolved before.

show abstract

“…Constraints (6) state that a customer node can either be visited by the truck or drone only, by both combined, or served via one of the lockers. Constraints (7) state that the lockers can be visited at most once by either the truck or the truck carrying the drone.…”

Section: Routing Constraints ∑mentioning

confidence: 99%

“…Boccia et al [7] solve the FSTSP with loops with a B&C algorithm. In [6], the same authors propose a column‐and‐row generation algorithm to solve the FSTSP.…”

Section: Literature Reviewmentioning

confidence: 99%

Last‐mile delivery with drone and lockers

Boschetti,

Novellani

2023

Networks

View full text Add to dashboard Cite

In this article, we define a new routing problem that arises in the last‐mile delivery of parcels, in which customers can be served either directly at home by a capacitated truck, or possibly with a drone carried on the truck, or in a self‐service mode using one of the available lockers. We investigate four different formulations, and for one of them, we propose a branch‐and‐cut approach. We also discuss some possible variants of the original problem. In the computational experiments, we analyze and compare the performance of the four formulations for the problem and its variants, and we provide some useful managerial insights.

show abstract

An Exact Approach for a Variant of the FS-TSP

Cited by 15 publications

References 10 publications

The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements

The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements

A new MILP formulation for the flying sidekick traveling salesman problem

Last‐mile delivery with drone and lockers

Contact Info

Product

Resources

About