This paper presents a set of new formulations for the Flying Sidekick Traveling Salesman Problem, where truck and drone cooperate to delivery parcels customers minimizing completion time. The improve results literature by solving optimality several benchmark instances which an optimal solution was previously unknown. A matheuristic algorithm, strongly based on models, is also discussed. Experim...

The traveling salesman problem is a combinatorial optimization problem. article presentsa statement of this and proposes graph mathematical model in which verticescorrespond to cities, edges are paths between it assumed that the isweighted. solution consists finding minimum weightHamiltonian cycle complete weighted graph. NP-hard, so heuristic approachis used solve speed up on large volumes ofi...

The traveling salesman problem and the quadratic assignment problem are the two of the most commonly studied optimization problems in Operations Research because of their wide applicability. Due to their NP-hard nature, the individual problems are already complex and difficult to solve. In this paper, the two hard problems are integrated together first, that is called the integrated problem of ...