The planning of cycle trips in the province of East Flanders
AbstractTraditional route planners assist in finding the shortest or fastest route from one place to another. This paper presents a novel approach to path finding in a directed graph, namely a target distance, motivated by the problem that a recreational cyclist deals with when searching a nice route of a certain length. The problem is defined as a variant of the arc orienteering problem (AOP), a new combinatorial optimisation problem in which the score of a route in a directed graph has to be maximised by visiting arcs, while each arc can be visited at most once and the total cost of the route should not exceed a predefined cost. The contribution of this paper is threefold: (1) a mathematical model of the AOP is provided, (2) a metaheuristic method that solves AOP instances to near optimality in 1 s of execution time, is proposed and evaluated, and (3) two real-life applications of the method are presented. An on-line cycle route planning application offers personalised cycle routes based on user preferences, and an SMS service provides cyclists "in the field" with routes on demand.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Omega.
Volume (Year): 39 (2011)
Issue (Month): 2 (April)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.