The Bus Touring Problem: Cluster — First, Route — Second Heuristic

Ray Deitch and Shaul P. Ladany

Tourism Economics, 2000, vol. 6, issue 3, 263-279

Abstract: The Bus Touring Problem (BTP) objective is to maximize the total attractiveness of the tour by selecting a subset of sites to be visited and scenic routes to be travelled – both having associated non-negative attractiveness values – given the geographical frame considerations, constraints on touring time, cost and/or total distance. Real-life large-scale BTPs can be modelled, but practically they are not solvable, being NP-complete. Thus effective heuristic methods have been developed, aimed at generating a fast near-optimal BTP solution. Unfortunately, there are specific cases in which these existing heuristics may either consume a considerable amount of time or produce poor results when solving large-sized touring problems. This paper presents a radically new approach to cope practically with real-life large-scale Bus Touring Problems: a new heuristic based on clustering first, then routing. The results of a real-life touring problem are presented.

Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.5367/000000000101297631 (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:sae:toueco:v:6:y:2000:i:3:p:263-279

DOI: 10.5367/000000000101297631

Access Statistics for this article

More articles in Tourism Economics
Bibliographic data for series maintained by SAGE Publications ().