Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Mauro Dell’Amico, Roberto Montemanni, Stefano Novellani
Topics & Concepts
Travelling salesman problemDroneBranch and boundComputer scienceSolverHeuristicTraveling purchaser problemMathematical optimizationService (business)2-optUpper and lower boundsNearest neighbour algorithmAlgorithmMathematicsArtificial intelligenceEconomicsMathematical analysisBiologyGeneticsEconomyUAV Applications and OptimizationVehicle Routing Optimization MethodsRobotic Path Planning Algorithms