Maximization of attractiveness EV tourist routes

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents model and an algorithmic approach for the problem of generation optimal tourist route for electric vehicles (EVs). In the discussed problem a starting and a final point of a route are EV charging stations where tourist could charge the battery and then continue a journey. The main objective is to select to the route points of interests (POIs) which maximizing tourist attractiveness. Furthermore maximum length of the route is limited by the number of kilometers that the car can travel on a single battery charge. The model applied by us is the graph routing problem named as the Orienteering Problem with Time Windows (OPTW). In OPTW each location has positive score and a specific time interval in which a location can be visited. The solution of OPTW is a route (from the given starting to the ending point) with a fixed limit of length including a subset of locations. Moreover the route maximizes the total score of the locations visited in the predefined time intervals. As a solution we present the evolutionary algorithm with combines path relinking method instead crossover. Computational experiments are conducted on realistic database POIs and EV charging stations of Podlasie region in Poland. Tests results and execution time of the algorithm shows that the described solution could be a part of EV software module with generates the most interesting route.

Cite

CITATION STYLE

APA

Karbowska-Chilinska, J., & Zabielski, P. (2017). Maximization of attractiveness EV tourist routes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10244 LNCS, pp. 514–525). Springer Verlag. https://doi.org/10.1007/978-3-319-59105-6_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free