IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v33y2019i1p59-72.html
   My bibliography  Save this article

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

Author

Listed:
  • Mohammed Said Obeidat
  • Mohammed T. Hayajneh

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.

Suggested Citation

  • Mohammed Said Obeidat & Mohammed T. Hayajneh, 2019. "Implementing an insert-node heuristic travelling salesman problem: a case study to reduce the travelling cost of a medical representative," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 33(1), pages 59-72.
    • Handle: RePEc:ids:ijlsma:v:33:y:2019:i:1:p:59-72
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=99661
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijlsma:v:33:y:2019:i:1:p:59-72. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=134 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.