Abstract
We consider the problem of finding the optimal routing of a single vehicle that starts its route from a depot and delivers a product to N customers that are served according to a particular sequence. The vehicle during its route can return to the depot for restocking. The demands of the customers are random variables with known distributions. The actual demand of each customer is revealed as soon as the vehicle visits the customer’s site. It is permissible to satisfy fully or to satisfy partially or not to satisfy the demand of a customer. The cost structure includes travel costs between consecutive customers, travel costs between the customers and the depot and penalty costs if a customer’s demand is not satisfied or if it is satisfied partially. A dynamic programming algorithm is developed for the determination of the optimal routing policy. It is shown that the optimal routing policy has a specific threshold-type structure.
This is a preview of subscription content, log in via an institution to check access.
References
Dantzig, G., Ramser, R.: The truck dispatching problem. Manage Sci 6, 80–91 (1959)
Dimitrakos, T.D., Kyriakidis, E.G.: A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order. Eur J Oper Res 244, 990–993 (2015)
Goodson, J., Ohlmann, J., Thomas, B.: Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. Eur J Oper Res 217, 312–323 (2012)
Kyriakidis, E.G., Dimitrakos, T.D.: Single vehicle routing problem with a predefined customer sequence and stochastic continuous demands. Math Sci 33, 148–152 (2008)
Kyriakidis, E.G., Dimitrakos, T.D. A vehicle routing problem with a predefined customer sequence, stochastic demands and penalties for unsatisfied demands. In: Proceedings of \(5^{th}\) International Conference on Applied Operational Research, Lecture Notes in Management Science, 5:10–17, 2013
Minis, I., Tatarakis, A.: Stochastic single vehicle routing problem with delivery and pickup and a predefined customer sequence. Eur J Oper Res 213, 37–51 (2011)
Novoa, C., Storer, R.: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur J Oper Res 196, 509–515 (2009)
Pandelis, D.G., Kyriakidis, E.G., Dimitrakos, T.D.: Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands. Eur J Oper Res 217, 324–332 (2012)
Pandelis, D.G., Karamatsoukis, C.C., Kyriakidis, E.G.: Single vehicle routing problems with a predefined customer order, unified load and stochastic discrete demands. Probab Eng Inf Sci 27(1), 1–23 (2013)
Ross, S.M.: An Introduction to Stochastic Dynamic Programming. Academic Press, New York (1983)
Secomandi, N.: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput Oper Res 27, 1201–1225 (2000)
Yang, W.-H., Mathur, K., Ballou, R.H.: Stochastic vehicle routing problem with restocking. Trans Sci 34, 99–112 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Kyriakidis, E.G., Dimitrakos, T.D. (2017). Single Vehicle Routing Problem with a Predefined Customer Sequence, Stochastic Demands and Partial Satisfaction of Demands. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-42902-1_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42901-4
Online ISBN: 978-3-319-42902-1
eBook Packages: Business and ManagementBusiness and Management (R0)