摘要In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .
7Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies [C]//Proc of the First European Conf on Artificial Life. Paris, France: Elsevier Publishing, 1991 : 134-142.
8Von Neumann J, Burks A W. Theory of self reproducing automata [M]. Urbana: University of Illinois Press, 1966.
9Pham D T, Ghanbarzadeh A, Koc E, Otri S, Rahim S, Zaidi M. The Bees Algorithm-a novel tool for complex optimisation problems[C]//In Proceedings of the Second International Virtual Conference on Intelligent production machines and systems (IPROMS 2006), Elsevier, Oxford, 2006: 454-459.
