Abstract
In the vehicle routing problem with stochastic demand, the customers’ demands vary from one collection/delivery period to the next. Under the assumption that they become known only upon arrival of the vehicle at their sites, our objective is to find a fixed a priori sequence that is used in every period. We present a priori sequences that achieve 2-, 2-, 3- and 5-approximation in the worst case on trees, cycles, cactus graphs, and general graphs, respectively, in the case where the demand of a customer must be serviced all at once. These approximation ratios are with respect to the optimal distance computed off-line, when all demands are non-zero and are known in advance. If the demand of a customer can be serviced in parts, we present a linear time algorithm to find an optimal solution for cycles.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Operations Research Letters 6(4), 149–158 (1987)
Asano, T., Katoh, N., Kawashima, K.: A new approximation algorithm for the capacitated vehicle routing problem on a tree. J. of Combinatorial Optimization 5(2), 213–231 (2004)
Berman, P., Das, S.K.: On the vehicle routing problem. In: Proc. Workshop on Algorithms and Data Structures, pp. 360–371 (2005)
Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Operations Research 40(3), 574–585 (1992)
Bertsimas, D.J., Simchi-Levi, D.: A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Operations Research 44, 216–304 (1996)
Charikar, M., Khuller, S., Raghavachari, B.: Algorithms for capacitated vehicle routing. SIAM J. on Computing 31(3), 665–682 (2002)
Charikar, M., Raghavachari, B.: The finite capacity Dial-a-Ride problem. In: Proc. 39th Annual Symp. on Foundations of Computer Science, pp. 458–467 (1998)
Christofides, N.: The traveling salesman problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315–318 (1979)
Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science 23(3), 166–176 (1989)
Dror, M., Ball, M., Golden, B.: A computational comparison of algorithms for the inventory routing problem. Annals of Operations Research 6, 3–23 (1985)
Golden, B.L., Raghavan, S., Wasil, E.A. (eds.): The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research Computer Science Interfaces Series, vol. 43. Springer, Heidelberg (2008)
Haimovich, A., Kan, A.R.: Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research 10, 527–542 (1985)
Hamaguchi, S.-y., Katoh, N.: A capacitated vehicle routing problem on a tree. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 397–406. Springer, Heidelberg (1998)
Jaillet, P., Odoni, A.: The probabilistic vehicle routing problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies. North Holland, Amsterdam (1988)
Kenyon, A., Morton, D.P.: A survey on stochastic location and routing problems. Central European J. of Operations Research 9, 277–328 (2002)
Labbé, M., Laporte, G., Mercure, H.: Capacitated vehicle routing on trees. Operations Research 39(4), 616–622 (1991)
Marković, L., Ćavar, I., Carić, T.: Using data mining to forecast uncertain demands in stochastic vehicle routing problem. In: Proc. 13th Intn’l Symp. on Electronics in Transport (ISEP), Slovenia, pp. 1–6 (2005)
Novoa, C.: Static and dynamic approaches for solving the vehicle routing problem with stochastic demands. Ph.D. dissertation, Industrial and Systems Engineering Dept., Lehigh University (2005)
Tillman, F.: The multiple terminal delivery problem with probabilistic demands. Transportation Science 3, 192–204 (1969)
Viswanath, N.: Approximation Algorithms for Sequencing Problems. Ph.D. dissertation, Tepper School of Business, Carnegie Mellon University University (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ando, E., Bhattacharya, B., Hu, Y., Kameda, T., Shi, Q. (2011). Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. In: Cerone, A., Pihlajasaari, P. (eds) Theoretical Aspects of Computing – ICTAC 2011. ICTAC 2011. Lecture Notes in Computer Science, vol 6916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23283-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-23283-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23282-4
Online ISBN: 978-3-642-23283-1
eBook Packages: Computer ScienceComputer Science (R0)