Latest revision as of 12:14, 16 February 2021

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 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.

Original document

The different versions of the original document can be found in:

• 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

• http://www.scopus.com/inward/record.url?scp=85084660772&partnerID=8YFLogxK,

http://dx.doi.org/10.1016/j.tre.2020.101942

• https://api.elsevier.com/content/article/PII:S1366554519303734?httpAccept=text/xml,

https://api.elsevier.com/content/article/PII:S1366554519303734?httpAccept=text/plain,

http://dx.doi.org/10.1016/j.tre.2020.101942 under the license https://www.elsevier.com/tdm/userlicense/1.0/

• https://www.sciencedirect.com/science/article/pii/S1366554519303734,

https://research.tue.nl/en/publications/adaptive-large-neighborhood-search-for-the-time-dependent-profita,

https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F6ba50baa-29c9-4a55-acf2-fbdc3d64af44,

https://repub.eur.nl/pub/131136,

https://academic.microsoft.com/#/detail/3014585394