Alpern, Steve and Lidbetter, Thomas (2020) Search and delivery man problems : when are depth-first paths optimal? European Journal of Operational Research, 285 (3). pp. 965-976. doi:10.1016/j.ejor.2020.02.026

Preview

PDF WRAP-search-delivery-man-problems-Alpern-2020.pdf - Accepted Version - Requires a PDF viewer. Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0. Download (1602Kb) | Preview

Request Changes to record.

Abstract

Let h be a probability measure on a network Q, viewed either as the location of a hidden object to be found or as the continuous distribution of customers receiving packages. We wish to find a trajectory starting from a specified root, or depot O that minimizes the expected search or delivery time. We call such a trajectory optimal. When Q is a tree, we ask for which h there is an optimal trajectory that is depth-first, and we find sufficient conditions and in some cases necessary and sufficient conditions on h. A consequence of our analysis is a determination of the optimal depot location in the Delivery Man Problem, correcting an error in the literature.

Item Type:	Journal Article
Divisions:	Faculty of Social Sciences > Warwick Business School
Journal or Publication Title:	European Journal of Operational Research
Publisher:	Elsevier
ISSN:	0377-2217
Official Date:	16 September 2020
Dates:	Date Event 16 September 2020 Published 19 February 2020 Available 13 February 2020 Accepted
Volume:	285
Number:	3
Page Range:	pp. 965-976
DOI:	10.1016/j.ejor.2020.02.026
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Related URLs:	Publisher
Open Access Version:	ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads