A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order

T.D. Dimitrakos and E.G. Kyriakidis

European Journal of Operational Research, 2015, vol. 244, issue 3, 990-993

Abstract: This paper extends the results of a particular capacitated vehicle routing problem with pickups and deliveries (see Pandelis et al., 2013b) to the case in which the demands for a material that is delivered to N customers and the demands for a material that is collected from the customers are continuous random variables instead of discrete ones. The customers are served according to a particular order. The optimal policy that serves all customers has a specific threshold-type structure and it is computed by a suitable efficient dynamic programming algorithm that operates over all policies having this structure. The structural result is illustrated by a numerical example.

Keywords: Logistics; Dynamic programming; Routing with pickup and deliveries; Continuous demands (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221715001587
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:244:y:2015:i:3:p:990-993

DOI: 10.1016/j.ejor.2015.02.038

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().