Martin R Andersson, TuomasWSandholm. Contract types for satisficing task allocation, II: Experimental results[C]. Proc of the AAAI Spring Symposium. Washington DC: AAAI Press, 1998: 1-7.
[2]
Smith R G. The contract net protocol: High level communication and control in a distributed problem solver[J]. IEEE Trans on Computers, 1980, 29(12): 357-366.
[3]
Sandholm T W. An implementation of the contract net protocol based on marginal cost calculations[C]. Proc of the National Conf on Artificial Intelligence. Washington DC: AAAI Press, 1993: 256-262.
[4]
Sandholm T W. Contract types for satisficing task allocation, I: Theoretical results[C]. Proc of the AAAI Spring Symposium. Washington DC: AAAI Press, 1998: 68-75.
(Long T, Chen Y, Shen L C. Distributed cooperative mission control based on contract mechanism for multiple unmanned combat aerial vehicles[J]. Acta Aeronautica et Astronautica Sinica, 2007, 28(2): 352-358.)
(Long T, Chen Y, Huo X H, et al. Dynamic task scheduling of multiple unmanned aerial vehicle in battlefield environment[J]. Computer Engineering, 2007, 33(10): 36-38.)
[9]
Zhao X, Huang H K, He L J. The contract net protocol with trust model in open multi-agent system[C]. Proc of Computational Intelligence and Software Engineering. Beijing: 2009: 1-4.
(Yu Z H, Liu Y, Cai Y L. On wireless sensor networks collaboration based on an extended contract net protocol[J]. Control and Decision, 2009, 24(1): 61-65.)
(Long T, Zhu H Y, Shen L C. Negotiation-based distributed task allocation for cooperative multiple unmanned combat aerial vehicles[J]. J of Astronautics, 2006, 27(3): 457-463.)
(Tang S Y, Mei S, Zhu Y F, et al. Distributed weapon target assignment algorithm based on extended contract net protocol[J]. Systems Engineering and Electronics, 2011, 33(3): 568-574.)
[16]
Lesser V, Decker K, Wagner T. Evolution of the GPGP/TAEMS domain-independent coordination framework[J]. Plenary Lecture, 2002, 12(1): 1-2.
(Gao L, Sha J C. Research on task optimal allocation for distributed satellites system based on contract net protocol[J]. J of Astronautics, 2009, 30(2): 815-820.)
(Liu Y F, Zhang A. Cooperative task assignment method of manned/unmanned aerial vehicle formation[J]. Systems Engineering and Electronics, 2010, 32(3): 584-588.)
[24]
Nenad Mladenovi’c, Dragan Urosevi’c, Said Hanafi. Variable neighborhood search for the travelling deliveryman problem[J]. J of Operations Research, 2012, 11(1): 58-73.
[25]
Sandro Pirkwieser, Gunther R Raidl. Multilevel VNS for periodic routing problems[C]. Evolutionary Computation in Combinatorial Optimization. Istanbul: Springer, 2010: 226-238.
[26]
Rabinovich Y, Wigderson A. An analysis of a simple genetic algorithm[C]. Proc of the 4th Int Conf on Genetic Algorithms. San Mateo: Morgan Kaufmann, 1991: 215-221.
[27]
Marcin Studniarski. Stopping criteria for genertic algorithms with application to multiobjective optimization[C]. The 11th Int Conf on Parallel Problem Solving from Nature. Krakow: Springer, 2010: 697-706.
[28]
Asoh H, Mühlenbein H. On the mean convergence time of evolutionary algorithms without selection and mutation[C]. Parallel Problem Solving From Nature. Berlin: Springer-Verlag, 1994: 88-97.
[29]
Florian Schmitt, Franz Rothlauf. On the importance of the second largest eigenvalue on the convergence rate of genetic algorithms[C]. Proc of the Genetic and Evolutionary Computation Conf. San Francisco: Morgan Kaufmann, 2001: 559-564.
[30]
Rosenthal J S. Quantititive convergence rates of Markov chains: A simple account[J]. Electronic Communications in Probability, 2002, 7(13): 123-128.
[31]
Daniel W Stroock. An introduction to Markov processes[M]. Berlin: Springer, 2007: 25-81.
