Title: Implementing an insert-node heuristic travelling salesman problem: a case study to reduce the travelling cost of a medical representative

Authors: Mohammed Said Obeidat; Mohammed T. Hayajneh

Addresses: Industrial Engineering Department, Faculty of Engineering, Jordan University of Science and Technology, P.O. Box 3030, Irbid, 22110, Jordan ' Industrial Engineering Department, Faculty of Engineering, Jordan University of Science and Technology, P.O. Box 3030, Irbid, 22110, Jordan

Abstract: This paper develops an insert-node heuristic for solving a case study involving the travelling salesman problem (TSP), a new infants' formula company that is entering the US market. The company established one head office in each state that has some medical representatives. One representative in the state of Kansas office who is in charge of visiting maternity hospitals or clinics in 48 cities in Kansas (USA) is selected. The objective of this research paper is to find the optimal route between the 48 cities for the representative, to minimise the travelling time and cost. The contribution of this paper to the literature is that the insert-node heuristic approach is applied to the medicine and infants' formula distribution in the state of Kansas.

Keywords: travelling salesman problem; TSP; heuristic; cost minimisation; Hamiltonian cycle.

DOI: 10.1504/IJLSM.2019.099661

International Journal of Logistics Systems and Management, 2019 Vol.33 No.1, pp.59 - 72

Received: 13 Mar 2017
Accepted: 10 Sep 2017
Published online: 20 May 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article