<?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=Cassandras_et_al_2015a</id>
		<title>Cassandras et al 2015a - 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=Cassandras_et_al_2015a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cassandras_et_al_2015a&amp;action=history"/>
		<updated>2026-04-21T20:43:57Z</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=Cassandras_et_al_2015a&amp;diff=198394&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 685127270 to Cassandras et al 2015a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cassandras_et_al_2015a&amp;diff=198394&amp;oldid=prev"/>
				<updated>2021-02-01T21:42:49Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_685127270&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 685127270&quot;&gt;Draft Content 685127270&lt;/a&gt; to &lt;a href=&quot;/public/Cassandras_et_al_2015a&quot; title=&quot;Cassandras et al 2015a&quot;&gt;Cassandras et al 2015a&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 21:42, 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=Cassandras_et_al_2015a&amp;diff=198393&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Motivated by the significant role of recharging in battery-powered vehicles, we study the routing problem for vehicles with limited energy through a network o...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cassandras_et_al_2015a&amp;diff=198393&amp;oldid=prev"/>
				<updated>2021-02-01T21:42:45Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Motivated by the significant role of recharging in battery-powered vehicles, we study the routing problem for vehicles with limited energy through a network o...&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;
Motivated by the significant role of recharging in battery-powered vehicles, we study the routing problem for vehicles with limited energy through a network of charging nodes. We seek to minimize the total elapsed time for vehicles to reach their destinations considering both traveling and recharging times at nodes when the vehicles do not have adequate energy for the entire journey.We have studied the case of homogeneous charging nodes in [1] and generalized it to inhomogeneous charging nodes in [2] by formulating and solving a Mixed Integer Non-Linear Programming problem (MINLP) for a single-vehicle. In this paper, we solve the same problem using Dynamic Programming (DP), resulting in optimal solutions with lower computational complexity compared to [2]. For a multi-vehicle problem, where traffic congestion effects are included, we use a similar approach by grouping vehicles into “subflows” and propose a DP formulation. Our numerical results show that DP becomes prohibitively slow as the number of subflows increases. As in [1] and [2] we resort to an alternative flow optimization formulation leading to a computationally simpler problem solution with minimal loss of accuracy.&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;
* [https://www.osti.gov/biblio/1158748 https://www.osti.gov/biblio/1158748]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/7049460/7056073/07056110.pdf?arnumber=7056110 http://xplorestaging.ieee.org/ielx7/7049460/7056073/07056110.pdf?arnumber=7056110],&lt;br /&gt;
: [http://dx.doi.org/10.1109/ievc.2014.7056110 http://dx.doi.org/10.1109/ievc.2014.7056110]&lt;br /&gt;
&lt;br /&gt;
* [https://www.osti.gov/servlets/purl/1158748 https://www.osti.gov/servlets/purl/1158748],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/7056110 https://ieeexplore.ieee.org/document/7056110],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2066871138 https://academic.microsoft.com/#/detail/2066871138]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>