A periodic routing problem with stochastic demands

Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2011

Volumn , Issue , 2011, Pages 350-357

  Schedl, Michael ^a   Strauss, Christine ^b  

^a Paradigma Unternehmensberatung GmbH   (Austria)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL STUDIES; CONSTRAINED RESOURCES; CUSTOMER PREFERENCES; FORMAL MODEL; META HEURISTICS; ORDER FULFILLMENT; PERIODIC ROUTING PROBLEMS; PLANNING PERIOD; PROBLEM INSTANCES; REAL WORLD DATA; STOCHASTIC DEMAND;

CUSTOMER SATISFACTION; SALES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

DISTRIBUTION OF GOODS;

EID: 80052733426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISIS.2011.57     Document Type: Conference Paper

References (12)

1. Department for Transport. (2004) Section Four: Freight. London, United Kingdom. Accessed 15 August 2005. [Online]. Available: http://www.dft.gov.uk/ stellent/groups/dft transstats/documents/page/dft transstats 032074.pdf
2. Statistics Austria. (2004) Chapter 11: Transport. Vienna, Austria. Accessed 15 August 2005. [Online]. Available: http://www.statistik.at/ statistische uebersichten/englisch/pdf/c11a 4.pdf
3. P. Toth and D. Vigo, Eds., The Vehicle Routing Problem, 1st ed. SIAM, 2001.
4. E. Beltrami and L. Bodin, "Networks and vehicle routing for municipal waste collection," Networks, vol. 4, pp. 9-32, 1974.
5. N. Christofides and J. Beasley, "The period routing problem,"Networks, vol. 14, pp. 237-156, 1984.
6. A. Campbell, L. Clarke, and M. Savelsbergh, "Inventory routing in practice," in The Vehicle Routing Problem, P. Toth and D. Vigo, Eds. SIAM, 2001, pp. 309-330.
7. M. Gendreau, G. Laporte, and R. Séguin, "An exact algorithm for the vehicle routing problem with stochastic demands and customers," Transportation Science, vol. 29, pp. 143-155, 1995.
8. G. Laporte and F. Louveaux, "The integer L-shaped method for stochastic integer programs with complete recourse,"Operations Research Letters, vol. 13, pp. 133-142, 1993.
9. V. Norkin, G. Pflug, and A. Ruszczyński, "A branch and bound method for stochastic global optimization," Mathematical Programming, vol. 83, pp. 425-450, 1998. (Pubitemid 128431423)
10. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1st ed. Addison-Wesley, 1989.
11. S. Kirkpatrick, C. Gelatt, Jr., and M. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
12. B. Kernighan and D. Ritchie, The C Programming Language, 2nd ed. Prentice Hall, 1988.