IDEAS home Printed from https://ideas.repec.org/a/vrs/itmasc/v20y2017i1p79-84n14.html
   My bibliography  Save this article

A Bi-Modal Routing Problem with Cyclical and One-Way Trips: Formulation and Heuristic Solution

Author

Listed:
  • Grinde Roger B.

    (University of New Hampshire, Durham, USA)

Abstract

A bi-modal routing problem is solved using a heuristic approach. Motivated by a recreational hiking application, the problem is similar to routing problems in business with two transport modes. The problem decomposes into a set covering problem (SCP) and an asymmetric traveling salesperson problem (ATSP), corresponding to a hiking time objective and a driving distance objective. The solution algorithm considers hiking time first, but finds all alternate optimal solutions, as inputs to the driving distance problem. Results show the trade-offs between the two objectives.

Suggested Citation

  • Grinde Roger B., 2017. "A Bi-Modal Routing Problem with Cyclical and One-Way Trips: Formulation and Heuristic Solution," Information Technology and Management Science, Sciendo, vol. 20(1), pages 79-84, December.
  • Handle: RePEc:vrs:itmasc:v:20:y:2017:i:1:p:79-84:n:14
    DOI: 10.1515/itms-2017-0014
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/itms-2017-0014
    Download Restriction: no

    File URL: https://libkey.io/10.1515/itms-2017-0014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:vrs:itmasc:v:20:y:2017:i:1:p:79-84:n:14. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    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.