American Journal of Computational and Applied Mathematics
pISSN: 21658935 eISSN: 21658943
2021; 11(4): 7177
doi:10.5923/j.ajcam.20211104.01
Received: Dec. 2, 2021; Accepted: Dec. 22, 2021; Published: Dec. 24, 2021
Ahmed Salam Najat, Douglas Kwasi Boah
Department of Mathematics, C. K. Tedam University of Technology and Applied Sciences, Navrongo, Ghana
Correspondence to: Douglas Kwasi Boah, Department of Mathematics, C. K. Tedam University of Technology and Applied Sciences, Navrongo, Ghana.
Email: 
Copyright © 2021 The Author(s). Published by Scientific & Academic Publishing.
This work is licensed under the Creative Commons Attribution International License (CC BY).
http://creativecommons.org/licenses/by/4.0/
A travelling salesperson problem is where a salesperson starts from one place, visits all other required places once and returns to the initial point such that the overall covered distance is minimized. In this thesis, the concept of Travelling Salesperson Problem has been successfully used to analyze the operating characteristics of fruits’ seller in Bolgatanga in the Upper East Region of Ghana. The fruits’ seller was interviewed to find out the usual routes traversed by her to serve her scattered customers. Based on her responses, her daily routes and the various distances between each pair of customer locations were obtained from the Lands Commission in Bolgatanga in the Upper East Region of Ghana. A matrix of the shortest distances between pairs of customer locations in meters was then constructed and solved using Version 3 of TSP Solver and Generator which is based on the Branch and Bound Algorithm. The study has determined an optimal operating path for the fruits’ seller. It has also determined an optimal daily distance for the fruits’ seller. It is recommended that the fruits’ seller should always use the determined optimal operating path so as to minimize the total distance covered daily. Also, other hawkers should make conscious efforts to find out their optimal operating paths so as to minimize the total distances covered daily.
Keywords: Travelling Salesperson Problem, Fruits’ Seller, Optimal Operating Path, Optimal Daily Distance, Branch and Bound Algorithm, Customer Locations
Cite this paper: Ahmed Salam Najat, Douglas Kwasi Boah, Analysis of the Operating Characteristics of Fruits’ Seller in Bolgatanga as a Travelling Salesperson Problem, American Journal of Computational and Applied Mathematics , Vol. 11 No. 4, 2021, pp. 7177. doi: 10.5923/j.ajcam.20211104.01.

Table 2. A matrix of the shortest distances between pairs of customer locations in meters 
Figure 1. Daily routes of the fruits’ seller and distances between pairs of customer locations in meters 
