A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem

DOI10.1016/J.ENDM.2018.03.013zbMath1408.90337OpenAlexW2796596851WikidataQ129988213 ScholiaQ129988213MaRDI QIDQ1791920

Júlia Cária de Freitas, Puca Huachi Vaz Penna

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.013

zbMATH Keywords

traveling salesman problemunmanned aerial vehicledrone deliverylast mile deliveryrandomized variable neighborhood descent

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions ⋮ Truck and drone routing problem with synchronization on arcs ⋮ Modeling the flying sidekick traveling salesman problem with multiple drones ⋮ Exact models for the flying sidekick traveling salesman problem ⋮ Unmanned aerial vehicles/drones in vehicle routing problems: a literature review ⋮ A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone ⋮ Last‐mile delivery with drone and lockers ⋮ Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review ⋮ The truck–drone routing optimization problem: mathematical model and a VNS approach ⋮ An exact solution method for the TSP with drone based on decomposition

Cites Work

• Variable neighbourhood search: methods and applications

This page was built for publication: A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem