حل بهینهمساله Bin Packing با دو الگوریتم SA,Ant colony

مراجع و منابع این مقاله:

• _ کنفرانس _ _ الکترونیک ایران Iranian Conference on Electrical ...
• _ Armin Scholl, R.K.a.C.J., 1997. A fast hybrid procedure for ...
• Belgium, 1996. Ant Colony System:A Cooperative Learning Approach to the ...
• Bruno Codenotti, G.D .M.M.L.M.M .b.a.M.S., 2004. Approximation algorithms for a ...
• Frank G. Ortmanna, N .N.a.J.H.v.V, 2009. New and improved level ...
• Haffari, G., 2002. Cost Function Optimization based on Active Learning. ...
• Johnson, M.G.a.D., 1979. a guide to the theory of NP- ...
• Davidson, _ and David Harel. 1996. Drawing Graphs Nicely Using ...
• Annealing. ACM Transactions on Graphics, Vol. 15, No. 4, pp. ...
• Fleischer, Mark. 1995. Simulated Annealing: Past, Present, and Future. ...
• Proceedings of the 1995 Winter Simulation Conference, Department of ...
• Engineering Management, Old Dominion University, Norfolk, VA.14 ...
• Herault, L. 2000. Rescaled Simulated Annealing- Accelerating Convergence of ...
• Simulated Annealing by Rescaling the States Energies. Journal of Heuristics, ...
• 46. S. Kirkpatrik, C.D. Gelatt, and M.P. Vecchi, Optimization by ...
• Science 220 (1983), 671--680. ...
• D. Johnson, A. Demers, J. Ullman, M. Garey, and R. ...
• case performance bounds for simple one -dimensional packaging algorithms. ...
• SIAM Journal December 1974 ...
نمایش کامل مراجع