<?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=Veelenturf_et_al_2020a</id>
		<title>Veelenturf et al 2020a - 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=Veelenturf_et_al_2020a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Veelenturf_et_al_2020a&amp;action=history"/>
		<updated>2026-04-25T22:49:21Z</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=Veelenturf_et_al_2020a&amp;diff=216679&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 248602669 to Veelenturf et al 2020a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Veelenturf_et_al_2020a&amp;diff=216679&amp;oldid=prev"/>
				<updated>2021-02-16T11:14:07Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_248602669&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 248602669&quot;&gt;Draft Content 248602669&lt;/a&gt; to &lt;a href=&quot;/public/Veelenturf_et_al_2020a&quot; title=&quot;Veelenturf et al 2020a&quot;&gt;Veelenturf et al 2020a&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 11:14, 16 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=Veelenturf_et_al_2020a&amp;diff=216678&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  The rise of e-commerce has increased the demands placed on pickup and delivery operations, as well as customer expectations regarding the quality of services...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Veelenturf_et_al_2020a&amp;diff=216678&amp;oldid=prev"/>
				<updated>2021-02-16T11:14:04Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  The rise of e-commerce has increased the demands placed on pickup and delivery operations, as well as customer expectations regarding the quality of services...&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;
The rise of e-commerce has increased the demands placed on pickup and delivery operations, as well as customer expectations regarding the quality of services provided by those operations. One strategy a logistics provider can employ for meeting these increases in demands and expectations is to complement and coordinate its fleet operations with those of for-hire, third-party logistics providers. Herein, we study an optimization problem for coordinating these operations: the time-dependent profitable pickup and delivery problem with time windows. In this problem, the logistics provider has the opportunity to use its fleet of capacitated vehicles to transport shipment requests, for a profit, from pickup to delivery locations. Owing to demographic and market trends, we focus on an urban setting, wherein road congestion is a factor. As a result, the problem explicitly recognizes that travel times may be time-dependent. The logistics provider seeks to maximize its profits from serving transportation requests, which we compute as the difference between the profits associated with transported requests and transportation costs. To solve this problem, we propose an adaptive large neighborhood search algorithm. The results of our extensive computational study show that the proposed algorithm can find high-quality solutions quickly on instances with up to 75 transportation requests. Furthermore, we study its impact on profits when explicitly recognizing traffic congestion during planning operations.&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://research.tue.nl/nl/publications/adaptive-large-neighborhood-search-for-the-timedependent-profitable-pickup-and-delivery-problem-with-time-windows(6ba50baa-29c9-4a55-acf2-fbdc3d64af44).html https://research.tue.nl/nl/publications/adaptive-large-neighborhood-search-for-the-timedependent-profitable-pickup-and-delivery-problem-with-time-windows(6ba50baa-29c9-4a55-acf2-fbdc3d64af44).html]&lt;br /&gt;
&lt;br /&gt;
* [http://www.scopus.com/inward/record.url?scp=85084660772&amp;amp;partnerID=8YFLogxK http://www.scopus.com/inward/record.url?scp=85084660772&amp;amp;partnerID=8YFLogxK],&lt;br /&gt;
: [http://dx.doi.org/10.1016/j.tre.2020.101942 http://dx.doi.org/10.1016/j.tre.2020.101942]&lt;br /&gt;
&lt;br /&gt;
* [https://api.elsevier.com/content/article/PII:S1366554519303734?httpAccept=text/xml https://api.elsevier.com/content/article/PII:S1366554519303734?httpAccept=text/xml],&lt;br /&gt;
: [https://api.elsevier.com/content/article/PII:S1366554519303734?httpAccept=text/plain https://api.elsevier.com/content/article/PII:S1366554519303734?httpAccept=text/plain],&lt;br /&gt;
: [http://dx.doi.org/10.1016/j.tre.2020.101942 http://dx.doi.org/10.1016/j.tre.2020.101942] under the license https://www.elsevier.com/tdm/userlicense/1.0/&lt;br /&gt;
&lt;br /&gt;
* [https://www.sciencedirect.com/science/article/pii/S1366554519303734 https://www.sciencedirect.com/science/article/pii/S1366554519303734],&lt;br /&gt;
: [https://research.tue.nl/en/publications/adaptive-large-neighborhood-search-for-the-time-dependent-profita https://research.tue.nl/en/publications/adaptive-large-neighborhood-search-for-the-time-dependent-profita],&lt;br /&gt;
: [https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F6ba50baa-29c9-4a55-acf2-fbdc3d64af44 https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F6ba50baa-29c9-4a55-acf2-fbdc3d64af44],&lt;br /&gt;
: [https://repub.eur.nl/pub/131136 https://repub.eur.nl/pub/131136],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/3014585394 https://academic.microsoft.com/#/detail/3014585394]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>