IDEAS home Printed from https://ideas.repec.org/a/sae/toueco/v6y2000i3p263-279.html
   My bibliography  Save this article

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

Author

Listed:
  • Ray Deitch
  • Shaul P. Ladany

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.

Suggested Citation

  • Ray Deitch & Shaul P. Ladany, 2000. "The Bus Touring Problem: Cluster — First, Route — Second Heuristic," Tourism Economics, , vol. 6(3), pages 263-279, September.
    • Handle: RePEc:sae:toueco:v:6:y:2000:i:3:p:263-279
    DOI: 10.5367/000000000101297631
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.5367/000000000101297631
    Download Restriction: no
    File URL: https://libkey.io/10.5367/000000000101297631?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:toueco:v:6:y:2000:i:3:p:263-279. 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: SAGE Publications (email available below). General contact details of provider: .

    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.