Utilization of GIS and graph theory for determination of optimal mailing route

  • Authors:
  • Mufid Abudiab;Michael Starek;Rene Lumampao;An Nguyen

  • Affiliations:
  • Texas A&M University-Corpus Christi, Corpus Christi, Texas;Texas A&M University-Corpus Christi, Corpus Christi, Texas;Texas A&M University-Corpus Christi, Corpus Christi, Texas;Texas A&M University-Corpus Christi, Corpus Christi, Texas

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

A real-world application of GIS and graph theory for analysis of an optimization problem is presented in this paper. The problem entailed determining the optimal route for distribution of mail on our University's campus. We focused our work only on the processes utilized to deliver mail externally from building to building. Information was collected on the procedure and routes utilized by the mailing department for the daily delivery of mail. To determine the optimal closed path, geographic information systems (GIS) techniques were utilized for analysis of the delivery routes and measurement of distances from building to building. The problem domain was modeled as a complete graph and approached as being a variant of the traditional Traveling Salesman Problem. An implementation of the Brute Force method developed in C++ code was utilized to solve the problem.