<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Karbowska-Chilinska_Zabielski_2017a</id>
		<title>Karbowska-Chilinska Zabielski 2017a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Karbowska-Chilinska_Zabielski_2017a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Karbowska-Chilinska_Zabielski_2017a&amp;action=history"/>
		<updated>2026-04-24T18:36:54Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Karbowska-Chilinska_Zabielski_2017a&amp;diff=197557&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 573484624 to Karbowska-Chilinska Zabielski 2017a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Karbowska-Chilinska_Zabielski_2017a&amp;diff=197557&amp;oldid=prev"/>
				<updated>2021-02-01T20:07:28Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_573484624&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 573484624&quot;&gt;Draft Content 573484624&lt;/a&gt; to &lt;a href=&quot;/public/Karbowska-Chilinska_Zabielski_2017a&quot; title=&quot;Karbowska-Chilinska Zabielski 2017a&quot;&gt;Karbowska-Chilinska Zabielski 2017a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 20:07, 1 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Karbowska-Chilinska_Zabielski_2017a&amp;diff=197556&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Part 6: Modelling and Optimization; International audience; This paper presents model and an algorithmic approach for the problem of generation optimal touris...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Karbowska-Chilinska_Zabielski_2017a&amp;diff=197556&amp;oldid=prev"/>
				<updated>2021-02-01T20:07:20Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Part 6: Modelling and Optimization; International audience; This paper presents model and an algorithmic approach for the problem of generation optimal touris...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
Part 6: Modelling and Optimization; International audience; 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.&lt;br /&gt;
&lt;br /&gt;
Document type: Part of book or chapter of book&lt;br /&gt;
&lt;br /&gt;
== Full document ==&lt;br /&gt;
&amp;lt;pdf&amp;gt;Media:Draft_Content_573484624-beopen2547-1102-document.pdf&amp;lt;/pdf&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1007/978-3-319-59105-6_44 http://dx.doi.org/10.1007/978-3-319-59105-6_44] under the license https://creativecommons.org/licenses/by&lt;br /&gt;
&lt;br /&gt;
* [https://hal.inria.fr/hal-01656202/file/448933_1_En_44_Chapter.pdf https://hal.inria.fr/hal-01656202/file/448933_1_En_44_Chapter.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://link.springer.com/content/pdf/10.1007/978-3-319-59105-6_44 http://link.springer.com/content/pdf/10.1007/978-3-319-59105-6_44],&lt;br /&gt;
: [http://dx.doi.org/10.1007/978-3-319-59105-6_44 http://dx.doi.org/10.1007/978-3-319-59105-6_44] under the license cc-by&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/cisim/cisim2017.html#Karbowska-Chilinska17 https://dblp.uni-trier.de/db/conf/cisim/cisim2017.html#Karbowska-Chilinska17],&lt;br /&gt;
: [https://link.springer.com/chapter/10.1007/978-3-319-59105-6_44 https://link.springer.com/chapter/10.1007/978-3-319-59105-6_44],&lt;br /&gt;
: [https://hal.inria.fr/hal-01656202/document https://hal.inria.fr/hal-01656202/document],&lt;br /&gt;
: [https://hal.inria.fr/hal-01656202 https://hal.inria.fr/hal-01656202],&lt;br /&gt;
: [https://rd.springer.com/chapter/10.1007/978-3-319-59105-6_44 https://rd.springer.com/chapter/10.1007/978-3-319-59105-6_44],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2615990514 https://academic.microsoft.com/#/detail/2615990514] under the license http://www.springer.com/tdm&lt;br /&gt;
&lt;br /&gt;
* [https://hal.inria.fr/hal-01656202 https://hal.inria.fr/hal-01656202],&lt;br /&gt;
: [https://hal.inria.fr/hal-01656202/document https://hal.inria.fr/hal-01656202/document],&lt;br /&gt;
: [https://hal.inria.fr/hal-01656202/file/448933_1_En_44_Chapter.pdf https://hal.inria.fr/hal-01656202/file/448933_1_En_44_Chapter.pdf]&lt;br /&gt;
&lt;br /&gt;
 under the license http://creativecommons.org/licenses/by/&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>