Genetic-algorithms-based algorithm portfolio for inventory routing problem with stochastic demand

International Journal of Production Research

Volumn 51, Issue 1, 2013, Pages 118-137

  Shukla, Nagesh ^a,b   Tiwari, M K ^c   Ceglarek, Darek ^a,d  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF WOLLONGONG   (Australia)

^c INDIAN INSTITUTE OF TECHNOLOGY   (India)

^d Wisconsin Electric Machines and Power Electronics Consortium   (United States)

Author keywords

algorithm portfolios; genetic algorithms; inventory routing; stochastic demand

Indexed keywords

COMPLEX DYNAMICS; EVOLUTIONARY ALGORITHMS (EAS); GENERIC METHOD; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; LARGE DIMENSIONS; MEMETIC ALGORITHMS; NEAR-OPTIMAL SOLUTIONS; OBJECTIVE FUNCTIONS; OPTIMISATIONS; PROBLEM INSTANCES; STOCHASTIC DEMAND; TIME INTERVAL;

OPTIMIZATION;

GENETIC ALGORITHMS;

EID: 84870297386     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.653010     Document Type: Article

References (29)

1. Aghezzaf, E.H., Raa, B., and Landeghem, H.V., 2006. Modeling inventory routing problems in supply chains of high consumption products. European Journal of Operational Research, 169 (3), 1048-1063.
2. Brown, K.L. et al., 2003. A portfolio approach to algorithm selection. In: Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03), 9-15 August, Acapulco, Mexico. Available from: Ai.stanford.edu/ ~shoham/www%20papers/portfolio-IJCAI03.pdf [Accessed 25 January 2012].
3. Dawkins, R., 1976. The selfish gene. Oxford: Oxford University Press.
4. de Berg, M., et al., 2005. TSP with neighborhoods of varying size. Journal of Algorithms, 57, 22-36.
5. DeJong, K A., Potter, M A., and Spears, W M., 1997. Using problem generators to explore the effects of Epistasis. In: T. Back, ed. Seventh International Conference on Genetic Algorithms, 19-23 July 1997. East Lansing, MI. Waltham, MA: Morgan Kaufmann, 338-345.
6. Eiben, A.E. and Smit, S.K., 2011. Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm and Evolutionary Computation, 1 (1), 19-31.
7. Gen, M. and Cheng, R., 1997. Genetic algorithm and engineering design. New York: Wiley.
8. Ghosh, A., Tsutsui, S., and Tanaka, H. 1996. Individual aging in genetic algorithms. In: Australian and New Zealand Conference on Intelligent Information Systems, 18-20 November, Adelaide, Australia. Piscataway, NJ: IEEE.
9. Goh, K.S., Lim, A., and Rodrigues, B., 2003. Sexual selection for genetic algorithms. Artificial Intelligence Review, 19 (2), 123-152.
10. Goldberg, D.E., 1989. Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.
11. Gomes, C. and Selman, B., 2001. Algorithm portfolios. Artificial Intelligence, 126 (1-2), 4362.
12. Holland, J.H., 1975. Adaption in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.
13. Huberman, B.A., Lukose, R.M., and Hogg, T., 1997. An economics approach to hard computational problems. Science, 275 (5296), 51-54.
14. Lagoudakis, M. and Littman, M., 2000. Algorithm selection using reinforcement learning. In: Proceedings of the Seventeenth International Conference on Machine Learning, 29 June-2 July. San Diego, CA. Waltham, MA: Morgan Kaufmann, 511-518.
15. Merz, P. and Freisleben, B., 1997. A genetic local search approach to the quadratic assignment problem. In: C.T. Back, ed. Proceedings of the 7th International Conference on Genetic Algorithms. San Diego, CA. Waltham, MA: Morgan Kaufmann, 465-472.
16. Pomerol, J.C. and Barba-Romero, S., 2000. Multicriterion decision in management: Principles and practice. Boston: Kluwer Academic Publishers.
17. Raa, B. and Aghezzaf, E.H., 2005. A robust dynamic planning strategy for lot-sizing problems with stochastic demands. Journal of Intelligent Manufacturing, 16 (2), 207-213.
18. Rice, J.R., 1976. The algorithm selection problem. In: M. Rubinoff and M.C. Yovits, eds. Advances in Computers. New York: Academic Press, 65-118.
19. Shen, Z., Dessouky, M., and Ordonez, F. 2007. Stochastic vehicle routing problem for large-scale emergencies. Working paper.
20. Singh, G. et al., 2006. An evolutionary approach for multi-pass turning operation. Proceedings of the I MECH E Part B Journal of Engineering Manufacture, 220, 145-162.
21. Song, L.Q. et al., 2009. Ensemble for Solving Quadratic Assignment Problems. In: International Conference of Soft Computing and Pattern Recognition, SOCPAR '09, 4-7 December, Malacca, Malaysia. Piscataway, NJ: IEEE, 190-195.
22. Stinson, D.R., 1987. An introduction to the design and analysis of algorithms. 2nd ed. Winnipeg, Manitoba: The Charles Babbage Research Centre.
23. Taha, H.A., 2006. Operations research: An introduction. Englewood Cliffs, NJ: Prentice-Hall.
24. Tasgetiren, M.F., Suganthan, P.N., and Pan, Q.K., 2010. An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Applied Mathematics and Computation, 215 (9), 3356-3368.
25. Trivedi, K.S., 2003. Probability and statistics with reliability, queuing, and computer science applications. New York: Wiley.
26. Wagner, S. and Affenzeller, M., 2005. SexualGA: Gender-specific selection for genetic algorithms. In: Proceedings of the 9th World Multiconference on Systemics, Cybernetics and Informatics, 10-13 July, Orlando, FL [CD-ROM].
27. Whitley, D., et al., 1996. Evaluation evolutionary algorithms. Artificial Intelligence, 85 (1-2), 245-276.
28. Winkler, R.L., 1990. Decision modeling and rational choice: AHP and utility theory. Management Science, 36 (3), 247-248.
29. Yang, W., Mathur, K., and Ballou, R.H., 2000. Stochastic vehicle routing problem with restocking. Transportation Science, 34 (1), 99-112.