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

Grinde Roger B. ()
Additional contact information
Grinde Roger B.: University of New Hampshire, Durham, USA

Information Technology and Management Science, 2017, vol. 20, issue 1, 79-84

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.

Keywords: Heuristic; mountaineering; optimisation; operations research; vehicle routing (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1515/itms-2017-0014 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:vrs:itmasc:v:20:y:2017:i:1:p:79-84:n:14

DOI: 10.1515/itms-2017-0014

Access Statistics for this article

Information Technology and Management Science is currently edited by J. Merkurjevs

More articles in Information Technology and Management Science from Sciendo
Bibliographic data for series maintained by Peter Golla ().