File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Bi-level GA and GIS for multi-objective TSP route planning

TitleBi-level GA and GIS for multi-objective TSP route planning
Authors
KeywordsBi-level genetic algorithm
Geographical information system
Multi-objective optimization
Traveling salesman problem
Issue Date2006
Citation
Transportation Planning and Technology, 2006, v. 29, n. 2, p. 105-124 How to Cite?
AbstractRoute 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. © 2006 Taylor & Francis.
Persistent Identifierhttp://hdl.handle.net/10722/330073
ISSN
2023 Impact Factor: 1.3
2023 SCImago Journal Rankings: 0.472
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHuang, Bo-
dc.contributor.authorYao, Li-
dc.contributor.authorRaguraman, K.-
dc.date.accessioned2023-08-09T03:37:35Z-
dc.date.available2023-08-09T03:37:35Z-
dc.date.issued2006-
dc.identifier.citationTransportation Planning and Technology, 2006, v. 29, n. 2, p. 105-124-
dc.identifier.issn0308-1060-
dc.identifier.urihttp://hdl.handle.net/10722/330073-
dc.description.abstractRoute 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. © 2006 Taylor & Francis.-
dc.languageeng-
dc.relation.ispartofTransportation Planning and Technology-
dc.subjectBi-level genetic algorithm-
dc.subjectGeographical information system-
dc.subjectMulti-objective optimization-
dc.subjectTraveling salesman problem-
dc.titleBi-level GA and GIS for multi-objective TSP route planning-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1080/03081060600753404-
dc.identifier.scopuseid_2-s2.0-33745324957-
dc.identifier.volume29-
dc.identifier.issue2-
dc.identifier.spage105-
dc.identifier.epage124-
dc.identifier.eissn1029-0354-
dc.identifier.isiWOS:000239390800002-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats