Implementing an insert-node heuristic travelling salesman problem: a case study to reduce the travelling cost of a medical representative
作者: Mohammed Said Obeidat Mohammed T. Hayajneh
刊名: Int. J. of Logistics Systems and Management, 2019, Vol.33 (1), pp.59-72
来源数据库: Inderscience Enterprises Limited
DOI: 10.1504/IJLSM.2019.099661
关键词: Travelling salesman problemTSPHeuristicCost minimisationHamiltonian cycle.
原始语种摘要: 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.
全文获取路径: Inderscience 出版公司  (合作)

  • salesman 推销员
  • insert 插入
  • heuristic 试探
  • travelling 移动
  • representative 代理的
  • TSP Temporary Storage Program
  • problem 题目
  • minimise 成极小
  • Hamiltonian 哈密(尔)顿
  • solving 求解