IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v29y2006i2p105-124.html
   My bibliography  Save this article

Bi-level GA and GIS for Multi-objective TSP Route Planning

Author

Listed:
  • Bo Huang
  • Li Yao
  • K. Raguraman

Abstract

Route planning is usually carried out to achieve a single objective such as to minimize transport cost, distance traveled or travel time. This article explores an approach to multi-objective route planning using a genetic algorithm (GA) and geographical information system (GIS) approach. The method is applied to the case of a tourist sight-seeing itinerary, where a route is planned by a tour operator to cover a set of places of interest within a given area. The route planning takes into account four criteria including travel time, vehicle operating cost, safety and surrounding scenic view quality. The multi-objective route planning in this paper can be viewed as an extension of the traditional traveling salesman problem (TSP) since a tourist needs to pass through a number of sight points. The four criteria are quantified using the spatial analytic functions of GIS and a generalized cost for each link is calculated. As different criteria play different roles in the route selection process, and the best order of the multiple points needs to be determined, a bi-level GA has been devised. The upper level aims to determine the weights of each criterion, while the lower level attempts to determine the best order of the sights to be visited based on the new generalized cost that is derived from the weights at the upper level. Both levels collaborate during the iterations and the route with the minimal generalized cost is thus determined. The above sight-seeing route planning methodology has been examined in a region within the central area of Singapore covering 19 places of interest.

Suggested Citation

  • Bo Huang & Li Yao & K. Raguraman, 2006. "Bi-level GA and GIS for Multi-objective TSP Route Planning," Transportation Planning and Technology, Taylor & Francis Journals, vol. 29(2), pages 105-124, April.
  • Handle: RePEc:taf:transp:v:29:y:2006:i:2:p:105-124
    DOI: 10.1080/03081060600753404
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060600753404
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03081060600753404?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.

    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:taf:transp:v:29:y:2006:i:2:p:105-124. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GTPT20 .

    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.