Solve the Routing Optimization Problems with Foraging Game Theory

Abstract:

In this research, we propose a Foraging_PSO algorithm, relative to the real competitive environment, to apply particle swarm optimization (PSO) algorithm in dynamic foraging game to solve the vehicle routing problem with time windows (VRPTW). Meanwhile, under the hypothesis of group decision making in a foraging swarm and the hypothesis of each forager also is a predator of the other foragers, through decision selection in this foraging game, an analytical decision process can be obtained to support decision making.

• Periodical: Applied Mechanics and Materials (Volumes 284-287)
• Pages: 3149-3153
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.284-287.3149
• Online since: January 2013
• Authors: Chun Ta Lin
• Keywords: Foraging Game, Particle Swarm Optimization (PSO), Vehicle Routing Problem (VRP)

References

[1] B.W. Andrews, K.M. Passino, T.A. Waite, J. Intelligent and Robotic Systems, 49, (2007).

[2] J. Berger, M. Salois, R. Begin, A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows, Lecture Notes in Artificial Intelligence 1418, AI'98, Advances in Artificial Intelligence, Vancouver, Canada (1998), pp.114-127.

DOI: 10.1007/3-540-64575-6_44

[3] W.C. Chiang, R.A. Russell, INFORMS J. Computing, 9, (1997).

[4] M. Clerc, Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem New Optimization Techniques in Engineering, Springer, 219-239 (2004).

DOI: 10.1007/978-3-540-39930-8_8

[5] J.F. Cordeau, G. Desaulniers, M.M. Solomon, F. Soumis, The VRP with Time Windows, In: P. Toth and D Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia (2001), pp.157-194.

DOI: 10.1137/1.9780898718515.ch7

[6] J. Homberger, H. Gehring, INFOR, 37, (1999).

[7] C.T. Lin, Using Predicting Particle Swarm Optimization to Solve the Vehicle Routing Problem with Time Windows, 2008 International Conference on Industrial Engineering and Engineering Management, (2008) December, Singapore.

DOI: 10.1109/ieem.2008.4737982

[8] R. Montemann, L.M. Gambardella, A.E. Rizzoli, A.V. Donati, A New Algorithm for a Dynamic Vehicle Routing Problem Based on Ant Colony System, Technique Report IDSIA-23-02, IDSIA, Nov (2002).

[9] I. Or, Traveling Saleman-Type Combinatorial Problem and Their Relation to the Logistics of Regional Blood Banking, Ph.D. Thesis, Northwestern University, Evanston, USA (1976).

[10] I.H. Osman, Annals of Operation Research, 41, (1993).

[11] P. Pirolli, Cognitive Science 29, 3 (2005).

[12] P. Pirolli, S. Card, Psychological Review 106, 4 (1999).

[13] J.Y. Potvin, J.M. Roussear, J. Operation Research Society, 46, (1995).

[14] J.M. Rowcliffe, E. de Merode, G. Cowlishaw, Biological, Sciences 271, 1557 (2004).

[15] Q. Shen, J. Jiang, C. Jiao, G. Shen, R. Yu, European J. Pharmaceutical Sciences, 22, (2004).

[16] YH. Shi and RC. Eberhart, A Modified Particle Swarm Optimizer, IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, May 4-9, (1998).

DOI: 10.1109/icec.1998.699146

[17] YH. Shi and RC. Eberhart, Parameter Selection in Particle Swarm Optimization, 1998 Annual Conference on Evolutionary Programming, San Diego, (1998).

[18] D. Stephens, J. Krebs, Foraging Theory. Princeton Univ. Press, Princeton, NJ, (1986).

[19] F. Tasgetiren, Y. Liang, M. Sevkli, Particle Swarm Optimization and Differential Evolution Algorithms for Single Machine Total Weighted Tardiness Problem, Annals of Operations research, (2004).

DOI: 10.1109/cec.2004.1331062

[20] Q. Zhu, L. Qian, Y.C. Li, S.J. Zhu: An Improved Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows, 2006 IEEE Congress on Evolutionary Computation, Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada, (2006).

DOI: 10.1109/cec.2006.1688470