The general pickup and delivery problem with backtracking restrictions
by Zachary E. Bowden; Cliff T. Ragsdale
International Journal of Operational Research (IJOR), Vol. 39, No. 4, 2020

Abstract: This paper introduces a model for the general pickup and delivery problem (GPDP) that provides a novel approach to limit the amount of backtracking allowed in the solution. This problem is motivated by the increase in peer-to-peer vehicle transactions via online marketplaces such as eBay and an associated increase in the direct consumer procurement of shipping services for transporting recently purchased vehicles. We approach this problem in the context of a profit seeking objective while considering the cognitive processes and behavioural preferences of the driver as important to the ultimate solution of the routing problem. We offer a method for producing a set of good solutions that are differentiated based on backtracking characteristics of the directional flow of the route.

Online publication date: Mon, 23-Nov-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com