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

Information Technology and Management Science 2017
Roger B. Grinde

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

Atslēgas vārdi
Heuristic, mountaineering, optimisation, operations research, vehicle routing.

Grinde, R. A Bi-Modal Routing Problem with Cyclical and One-Way Trips: Formulation and Heuristic Solution. Information Technology and Management Science, 2017, Vol. 20, 79.-84. lpp. ISSN 2255-9086. e-ISSN 2255-9094.

Publikācijas valoda
English (en)