Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Series

PDF

Systems Engineering

Liberty University

Drone Traveling Salesman Problem

Articles 1 - 1 of 1

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

An Aco-Inspired, Probabilistic, Greedy Approach To The Drone Traveling Salesman Problem, Jessica Houseknecht Apr 2019

An Aco-Inspired, Probabilistic, Greedy Approach To The Drone Traveling Salesman Problem, Jessica Houseknecht

Senior Honors Theses

In recent years, major companies have done research on using drones for parcel delivery. Research has shown that this can result in significant savings, which has led to the formulation of various truck and drone routing and scheduling optimization problems. This paper explains and analyzes a new approach to the Drone Traveling Salesman Problem (DTSP) based on ant colony optimization (ACO).

The ACO-based approach has an acceptance policy that maximizes the usage of the drone. The results reveal that the pheromone causes the algorithm to converge quickly to the best solution. The algorithm performs comparably to the MIP model, CP …