Keywords:-
Article Content:-
Abstract
Recently, we have concerned the strategic optimization on logistic network design and developed an efficient two-level solution method. To cope with extremely large-scale problems, in this paper, we propose a novel algorithm for parallel computing. Thereat, noticing the analogy between the two-level algorithms and the master-slave configuration of PC cluster on one hand, and the suitability of the population-based algorithm like particle swarm optimization (PSO) on the other hand, we have developed a parallel procedure that can make overhead and idle time extremely small, and bring about high performance finally.
References:-
References
J. Kennedy and R. C. Eberhart, 1995, Particle Swarm Optimization, Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ.pp. 1942-1948
J. Kennedy and R. C. Eberhart, 1997, A Discrete Binary Version of the Particle Swarm Algorithm, Proceedings of World Multiconference on Systemics,Cybernetics and Information, Piscataway, NJ.pp. 4104-4109
T. Ohbora, 2005, Bacheor Thesis of Toyohashi University of Technology.
P. S. Pacheco, 1997, Parallel Programming with MPI, Morgan Kaufmann Publisher.
Y. Shimizu, S. Matsuda and T. Wada, 2006, A Flexible Design of Logistic Network against Uncertain Demands through Hybrid Meta-Heuristic Method, Proc. 16th Europe. Symp. On Computer-Aided Process Eng., Garmisch Partenkirchen, Germany, pp. 2051-2056
Y. Shimizu, T. Wada, Y. Yamazaki, 2007, Logistics Optimization Using Hybrid Meta heuristic Approach under Very Realistic Conditions, Proc. 17th Europe. Symp. on Computer-Aided Process Eng., Bucharest, Romania
T. Wada, Y. Shimizu and J.K. Yoo, 2005, Entire Supply Chain Optimization in Terms of Hybrid in Approach, Proc. 15th Europe. Symp. on Computer-Aided Process Eng., Barcelona, Spain, pp. 1591-1596