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.
Highlights
This paper addresses a combinatorial problem combining the classical Set Covering Problem (SCP) and the Traveling Salesman Problem (TSP)
Specific problems with similarities to the Bi-Modal Covering Salesman Problem (BCSP) addressed in this paper include the Covering Tour Problem (CTP)
With α = 0 %, we find just the pure optimal solutions to the set covering problem (SCP)
Summary
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
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call