<?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_Pourazarm_2014a</id>
		<title>Cassandras Pourazarm 2014a - 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_Pourazarm_2014a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cassandras_Pourazarm_2014a&amp;action=history"/>
		<updated>2026-05-07T09:24:04Z</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_Pourazarm_2014a&amp;diff=195047&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 715180541 to Cassandras Pourazarm 2014a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cassandras_Pourazarm_2014a&amp;diff=195047&amp;oldid=prev"/>
				<updated>2021-01-28T22:12:40Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_715180541&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 715180541&quot;&gt;Draft Content 715180541&lt;/a&gt; to &lt;a href=&quot;/public/Cassandras_Pourazarm_2014a&quot; title=&quot;Cassandras Pourazarm 2014a&quot;&gt;Cassandras Pourazarm 2014a&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 22:12, 28 January 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_Pourazarm_2014a&amp;diff=195046&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than t...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cassandras_Pourazarm_2014a&amp;diff=195046&amp;oldid=prev"/>
				<updated>2021-01-28T22:12:34Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than t...&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;
We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than the homogeneous node case studied in [1]. 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 study two versions of the problem. In the single vehicle routing problem, we formulate a mixed-integer nonlinear programming (MINLP) problem and show that it can be reduced to a lower dimensionality problem by exploiting properties of an optimal solution. We also obtain a Linear Programming (LP) formulation allowing us to decompose it into two simpler problems yielding near-optimal solutions. For a multi-vehicle problem, where traffic congestion effects are included, we use a similar approach by grouping vehicles into &amp;quot;subflows&amp;quot;. We also provide an alternative flow optimization formulation leading to a computationally simpler problem solution with minimal loss in accuracy. Numerical results are included to illustrate these approaches.&lt;br /&gt;
&lt;br /&gt;
Comment: To appear in proceeding of 22nd Mediterranean Conference on Control and Automation, MED'14&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://arxiv.org/abs/1404.6213 http://arxiv.org/abs/1404.6213]&lt;br /&gt;
&lt;br /&gt;
* [http://arxiv.org/pdf/1404.6213.pdf http://arxiv.org/pdf/1404.6213.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/6940139/6961315/06961451.pdf?arnumber=6961451 http://xplorestaging.ieee.org/ielx7/6940139/6961315/06961451.pdf?arnumber=6961451],&lt;br /&gt;
: [http://dx.doi.org/10.1109/med.2014.6961451 http://dx.doi.org/10.1109/med.2014.6961451]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/med/med2014.html#PourazarmC14 https://dblp.uni-trier.de/db/conf/med/med2014.html#PourazarmC14],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/6961451 https://ieeexplore.ieee.org/document/6961451],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2071140605 https://academic.microsoft.com/#/detail/2071140605]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>