A genetic algorithm to design touristic routes in a bike sharing system

The aim of this paper is to study a Bike Sharing Touring (BST) applying a mathematical model known in operation research as Orienteering Problem (OP). Several European Cities are developing BST in order to reduce the exhaust emissions and to improve the sustainability in urban areas. The authors offer a Decision Support Tool useful for the tourist and the service’s manager to organize the tourists’ paths on the basis of tourists’ desires, subject to usable time, place of interest position and docking station location. The model analyzed presents two innovative aspects compared to a classic OP. The first one is that the start and the arrival point of routes aren’t necessary coinciding and pre-conditioned. The last one is that the knowledge of tourist tours allows to book the visit to a point of interest and doing so to optimize efficiency of the whole system and not only of the single tourist tour.

[1]  Dirk Van Oudheusden,et al.  The City Trip Planner: An expert system for tourists , 2011, Expert Syst. Appl..

[2]  C. Keller Algorithms to solve the orienteering problem: A comparison , 1989 .

[3]  William Johnson The planning cycle. , 2005, Journal of healthcare information management : JHIM.

[4]  VansteenwegenPieter,et al.  The City Trip Planner , 2011 .

[5]  Olatz Arbelaitz,et al.  Solving Multi Constrained Team Orienteering Problems to Generate Tourist Routes , 2009 .

[6]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[7]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[8]  Alice E. Smith,et al.  A genetic algorithm for the orienteering problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[9]  B. Kulkarni,et al.  An ant colony approach for clustering , 2004 .

[10]  J. Magalhães-Mendes,et al.  A Comparative Study of Crossover Operators for Genetic Algorithms to Solve the Job Shop Scheduling Problem , 2013 .

[11]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[12]  Dirk Van Oudheusden,et al.  The planning of cycle trips in the province of East Flanders , 2011 .

[13]  Angel Ibeas,et al.  A Simulation-optimization Approach to Design Efficient Systems of Bike-sharing , 2012 .

[14]  Qiwen Wang,et al.  Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..

[15]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.

[16]  Ivanoe De Falco,et al.  A Multiobjective Evolutionary Algorithm for Personalized Tours in Street Networks , 2015, EvoApplications.

[17]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[18]  Ronald G. Askin,et al.  Multi-commodity warehouse location and distribution planning with inventory consideration , 2014 .

[19]  Bruce L. Golden,et al.  The effective application of a new approach to the generalized orienteering problem , 2010, J. Heuristics.

[20]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[21]  B. Golden,et al.  A multifaceted heuristic for the orienteering problem , 1988 .

[22]  Federico Malucelli,et al.  Designing Optimal Routes for Cycle-tourists☆ , 2014 .

[23]  Alice E. Smith,et al.  AN ANT COLONY APPROACH TO THE ORIENTEERING PROBLEM , 2006 .