中继卫星动态调度问题建模及优化技术研究
|
摘要
跟踪与数据中继卫星系统是为中、低轨道的航天器与航天器之间、航天器与地面站之间提供数据中继、连续跟踪与轨道测控服务的系统,简称中继卫星系统。
中继卫星调度是指中继卫星任务计划管理中心根据应用需求以及中继卫星需要完成的任务,确定中继卫星及其有效载荷,选择需要发送航天信号的用户航天器,科学合理地分配中继卫星系统资源,以满足跟踪、测控与数据中继需要。
中继卫星动态调度是空间资源管理的重要内容之一,其目的在于为中继卫星系统的任务计划编制提供科学合理的决策手段与依据。中继卫星动态调度模型的建立与求解是中继卫星调度需要解决的关键问题,这也是本文研究的主要内容。
本文的主要工作和创新研究成果如下:
首先,建立了中继卫星动态调度框架。中继卫星动态调度框架的构建是研究中继卫星动态调度问题的重要基础,有利于中继卫星调度研究的深入开展。在分析中继卫星动态调度需求的基础上,确立中继卫星动态调度的原则和研究思路。
其次,建立了中继卫星初始调度模型的求解方式。在初始时刻,中继卫星资源、待安排的任务集和约束条件等都是已知的,中继卫星初始调度模型是确定的。在此基础上构建基于蚁群算法的优化框架,采用蚁群算法对中继卫星初始调度模型进行求解,并与基于遗传算法和模拟退火算法的计算结果进行比较。
第三,建立了中继卫星动态调度的求解方式。考虑了中继卫星调度过程中因卫星资源状态改变和新任务插入而导致动态调度的情况,并在中继卫星动态调度的求解中,将这两种情况综合为一种情况进行处理。中继卫星动态调度问题是一个典型的多目标决策问题,采用TOPSIS方法处理多目标决策。采用局部搜索方法和基于规则的局部优化算法求解中继卫星动态调度,并比较采用这两种方法的计算结果。
最后,根据中继卫星系统的实际情况,进行中继卫星动态调度的应用实例分析,综合验证本文提出的调度模型与算法的有效性。
通过本文的研究工作,初步完成了中继卫星动态调度问题由理论走向应用的相关探索,促进了动态调度理论与中继卫星应用领域相关问题的结合。
TDRSS (Tracking and Data Relay Satellite System) can provide service of data relaying, continuous tracking and TT&C for communications between spacecrafts of LEO (Low Earth Orbit) and MEO (Middle Earth Orbit), between spacecrafts and ground stations.
The relay satellite scheduling is that the task plan management center of the relay satellite, according to application demand and tasks that the relay satellite should complete, selects the relay satellite and its payloads, user spacecrafts that need sending communicating data, and assigns the relay satellite system resources scientifically,
The relay satellite dynamic scheduling is a main content of space resource management, which is to support task plan making of the relay satellite system. How to build and solve the dynamic scheduling models of the relay satellite is the key to the relay satellite scheduling problem. This is the primary study of the paper.
The main contents and fruits of this paper are outlined as follows:
Firstly, the paper puts forward a framework of the relay dynamic satellite scheduling. The framework of the relay satellite scheduling is the important base of the relay satellite scheduling search. The rules and research considers are formulated based on dynamic scheduling demand analysis of the relay satellite.
Secondly, the paper builds and solves the original scheduling model of the relay satellite. At the first time, it's known about the resources, mission collection waiting arrange and constraints of relay satellite. Therefore, the original scheduling model is established. The paper puts forward a framework based on Ant Colony (AC) Optimization Algorithm to solve the original scheduling model. The results solved with AC are compared with genetic algorithm (GA) and Simulated Annealing (SA).
Thirdly, the paper builds and solves the dynamic scheduling of the relay satellite. We considered two kinds of circumstances caused to dynamic scheduling of the relay satellite: resource state change and new mission inset, and synthetically solved them as ones. The paper presents TOPSIS method to solve the dynamic scheduling problem of the relay satellite as a typical multi-objective decision-making problem. It adopts and compares the results with Guided Local Search (GLC) method and regular_based local optimization method to solve the dynamic scheduling of the relay satellite.
Lastly, the paper analyzes and solves the application example according to the practice of the relay satellite scheduling. In the application example, the number of time windows of task is above two. The example is solved with the provided scheduling models. It indicates that the provided scheduling models are reasonable and effective.
The search work of the paper has elementarily explored how to combine the dynamic scheduling theory with the relay satellite application field.
中继卫星调度是指中继卫星任务计划管理中心根据应用需求以及中继卫星需要完成的任务,确定中继卫星及其有效载荷,选择需要发送航天信号的用户航天器,科学合理地分配中继卫星系统资源,以满足跟踪、测控与数据中继需要。
中继卫星动态调度是空间资源管理的重要内容之一,其目的在于为中继卫星系统的任务计划编制提供科学合理的决策手段与依据。中继卫星动态调度模型的建立与求解是中继卫星调度需要解决的关键问题,这也是本文研究的主要内容。
本文的主要工作和创新研究成果如下:
首先,建立了中继卫星动态调度框架。中继卫星动态调度框架的构建是研究中继卫星动态调度问题的重要基础,有利于中继卫星调度研究的深入开展。在分析中继卫星动态调度需求的基础上,确立中继卫星动态调度的原则和研究思路。
其次,建立了中继卫星初始调度模型的求解方式。在初始时刻,中继卫星资源、待安排的任务集和约束条件等都是已知的,中继卫星初始调度模型是确定的。在此基础上构建基于蚁群算法的优化框架,采用蚁群算法对中继卫星初始调度模型进行求解,并与基于遗传算法和模拟退火算法的计算结果进行比较。
第三,建立了中继卫星动态调度的求解方式。考虑了中继卫星调度过程中因卫星资源状态改变和新任务插入而导致动态调度的情况,并在中继卫星动态调度的求解中,将这两种情况综合为一种情况进行处理。中继卫星动态调度问题是一个典型的多目标决策问题,采用TOPSIS方法处理多目标决策。采用局部搜索方法和基于规则的局部优化算法求解中继卫星动态调度,并比较采用这两种方法的计算结果。
最后,根据中继卫星系统的实际情况,进行中继卫星动态调度的应用实例分析,综合验证本文提出的调度模型与算法的有效性。
通过本文的研究工作,初步完成了中继卫星动态调度问题由理论走向应用的相关探索,促进了动态调度理论与中继卫星应用领域相关问题的结合。
TDRSS (Tracking and Data Relay Satellite System) can provide service of data relaying, continuous tracking and TT&C for communications between spacecrafts of LEO (Low Earth Orbit) and MEO (Middle Earth Orbit), between spacecrafts and ground stations.
The relay satellite scheduling is that the task plan management center of the relay satellite, according to application demand and tasks that the relay satellite should complete, selects the relay satellite and its payloads, user spacecrafts that need sending communicating data, and assigns the relay satellite system resources scientifically,
The relay satellite dynamic scheduling is a main content of space resource management, which is to support task plan making of the relay satellite system. How to build and solve the dynamic scheduling models of the relay satellite is the key to the relay satellite scheduling problem. This is the primary study of the paper.
The main contents and fruits of this paper are outlined as follows:
Firstly, the paper puts forward a framework of the relay dynamic satellite scheduling. The framework of the relay satellite scheduling is the important base of the relay satellite scheduling search. The rules and research considers are formulated based on dynamic scheduling demand analysis of the relay satellite.
Secondly, the paper builds and solves the original scheduling model of the relay satellite. At the first time, it's known about the resources, mission collection waiting arrange and constraints of relay satellite. Therefore, the original scheduling model is established. The paper puts forward a framework based on Ant Colony (AC) Optimization Algorithm to solve the original scheduling model. The results solved with AC are compared with genetic algorithm (GA) and Simulated Annealing (SA).
Thirdly, the paper builds and solves the dynamic scheduling of the relay satellite. We considered two kinds of circumstances caused to dynamic scheduling of the relay satellite: resource state change and new mission inset, and synthetically solved them as ones. The paper presents TOPSIS method to solve the dynamic scheduling problem of the relay satellite as a typical multi-objective decision-making problem. It adopts and compares the results with Guided Local Search (GLC) method and regular_based local optimization method to solve the dynamic scheduling of the relay satellite.
Lastly, the paper analyzes and solves the application example according to the practice of the relay satellite scheduling. In the application example, the number of time windows of task is above two. The example is solved with the provided scheduling models. It indicates that the provided scheduling models are reasonable and effective.
The search work of the paper has elementarily explored how to combine the dynamic scheduling theory with the relay satellite application field.
引文
[1]常显奇,李云芝,罗小明等著.军事航天学(第2版)[M].国防工业出版社,2005.
[2]姜昌,范晓玲著.航天通信跟踪技术导论[M].北京工业大学出版社,2003.
[3]总装备部卫星有效载荷及应用技术专业组应用技术分组编.卫星应用现状与发展[M].中国科学技术出版社,2001.
[4]Waldemar Kocian.Dynamic scheduling State of the art report[R].SICS Technical Report T2002-28,Oct 2002.
[5]Gerard Verfaillie,Thomas Schiex.Solution Reuse in Dynamic Constraint Satisfaction Problems[J].Proceedings of the Twelfth Conference of the American Association of Artificial Intelligence,1994:307-312.
[6]Weixiong Zhang.Modeling and Solving a Resource Allocation Problem with Soft Constraint Techniques[R].Techincal Report:WUCS-2002-13,2002.
[7]Marco Adinolfi,Amedeo Cestal.Heuristic scheduling of the DRS communication system[J].Engineering Applications of Artificial Intelligence,1995,8(2):147-156.
[8]Rojanasoonthon S,Bard J F,Reddy S D.Algorithms for parallel machine scheduling:a case study of the Tracking and Data Relay Satellite System[J].Journal of the Operational Research Society,2003,54(8):806-821.
[9]Rojanasoonthon S.Parallel machine scheduling with time windows[Ph.D.Thesis].Graduate School of the University of Texas at Austin,2004.
[10]Hajghassem H,Rohi H,Nasirzadeh M.Investigation and analysis of Tracking and Data Relay Satellite Systems(TDRSS)[J].The 21st international communications satellite systems conference and Exhibit,AIAA 2003-2329,2003.
[11]Eytan Modiano.Resource allocation and congestion control in next generation satellite networks[J].Ardent Workshop,MIT,2003.
[12]Yingyong Chen,Michael Hadjitheodosiou,Cynthia Cheung.Optimizing communications for constellation space missions[J].The 21st international communications satellite systems conference and Exhibit,AIAA 2003-2401,2003.
[13]方炎申,中继卫星调度模型研究[D].国防科技大学博士学位论文,2007.
[14]Surender Reddy D.Scheduling of tracking and data relay satellite system(TDRSS)antennas:Scheduling with sequence dependent setup times[Z].Presented at ORSA/TIMS Joint National Meeting,Denver,Colorado,October 1988.
[15]Surender Reddy D and William Brown L.Single processor scheduling with job priorities and arbitrary ready and due times[Z].Working paper,Computer Sciences Corporation,Beltsville,Maryland,October 1986.
[16]Zillig D,McOmber R,Home W D.Demand access service for TDRSS users[J].AIAA 16th International Communications Satellite Systems Conference,Washington.DC,25-29 February 1996.
[17]陈理江,武小悦,李云峰,基于时间灵活度的中继卫星调度算法.航空计算技术,2006,4:1671-654X.
[18]Pemberton J C,Greenwald L G.On the Need for Dynamic Scheduling of the Image Satellite[J].Pecora 15/Land Satellite Information Ⅳ/ISPRS Commission Ⅰ/FIEOS 2002 Conference Proceedings,2002.
[19]Ari K Jonssop,NASA Research Center.Constraint_Based Planning.8 October 2002.
[20]邓晋军,张乃通,张丽艳.合理利用测控资源的动态调度模型.高技术通讯,2002.
[21]刘洋.成像侦察卫星动态重调度模型、算法及应用研究[D].国防科技大学博士学位论文,2004.
[22]张正强.基于MAS的分布式成像卫星系统任务规划与控制问题研究[D].国防科技大学博士学位论文,2006.
[23]Sherwood R,Govindjee A,Yan D,Rabideau G,Chien S,Fukunaga A.Using ASPEN to automate EO-1 activity planning[J].Proceedings of the 1998 IEEE Aerospace Conference,Colorado,1998.
[24]Veridian Incorporation.Generic Resource Event and Activity Scheduler[Z],2003.
[25]Analytical Graphics Incorporation.Satellite Tool Kit 5.0[Z],2003.
[26]ILOG Incorporation.ILOG Solver 5.3 User's Manual[Z],2003.
[27]ILOG Incorporation.ILOG Scheduler 5.3 User's Manual[Z],2003.
[28]ILOG Incorporation.ILOG Cplex8.1 User's Manual[Z],2003.
[29]Jackson J R.Simulation research on job shop production[J].Naval Res Log Quart,1957,4(3):287-295.
[30]Matsuura H,Tsubone H,Kanezashi M.Sequencing,dispatching and switching in dynamic manufacturing environment[J].Int.J.of Prod.Res.,1993,31(7):1671-1688.
[31]Panwalker S S,Iskander Wafik.A survey of scheduling rules[J].Oper.Res.,1977,25(1):45-61.
[32]Abumaizar R J,Svestka J A.Rescheduling job shop sunder random disruptions[J].Int.J.of Prod.Res.,1997,35(7):2065-2082.
[33]Liu H J,Dong Jian.Dispatching rule selection using artificial neural networks for dynamic planning and scheduling[J].J.of Intel Manuf.,1996,7(2):243-250.
[34]Fox M S,Smith S F.ISIS:A knowledge-based system for factory scheduling[J].Expert Syst.,1984,1(1):25-49.
[35] Smith S F, Hynyen J E. Integrated decentralization of production management for factory scheduling [A].Symp. on Integ. and Intel Manuf. [C], Boston, 1987.
[36] Bensana E, Dubois D. OPAL: A multi knowledge-based system for industrial job-shop scheduling [J]. Int. J. of Prod. Res., 1988, 26 (5): 795-819.
[37] Chu H, Wysk R A. A robust adaptive scheduler for an intelligent work station controller [J]. Int. J. of Prod. Res., 1993, 31 (4): 771-789.
[38] Jones Albert, Rabelo Kuis Yih, Yuehwern Y. A hybrid approach for real-time sequencing and scheduling [J]. Int. J. of Comp. Integ. Manuf., 1995, 8 (2):145-154.
[39] Lee C Y, Piramuthu S, Tsai Y K. Job shop scheduling with a genetic algorithm and machine learning [J]. Int. J. of Prod. Res., 1997, 35 (4): 1171-1191.
[40] Jian A K, Elmaraghy H A. Production scheduling rescheduling in flexible manufacturing [J]. Int. J. of Prod. Res., 1997, 35 (1): 281-309.
[41] Matthew Ginsberg. Dynamic Backtracking. Journal of Artificial Intelligence Research, 1993(1): 25-46.
[42] Schiex T, Verfaillie G. Nogood Recording for Static and Dynamic CSP. In Proceeding of the 5th IEEE international Conference on Tools with Artificial Intelligence, 1993.
[43] Gerard Verfaillie, Thomas Schiex. Dynamic Backtracking for Dynamic Constraint Satisfaction Problems. ECAI, Amsterdam, Netherlands, 1994.
[44] Naredra Jussien, Olivier Lhomme. Dynamic Backtracking with Constraint Proagation Application to numeric CSPs. CP97, Schloss Hangenberg, Austia, Nov.1,1997.
[45] Naredra Jussien, Patrice Boizumaut. Dynamic Backtracking with Constraint Propagation Application to static and Dynamic CSPs. CP97, Schloss Hangenberg,Austia, Nov. 1, 1997.
[46] Armin Wolf. Incremental Adaptation of Constraint Handling Rule Derivations.CP 97, Schloss Hangenberg, Austia, Nov. 1,1997.
[47] Hentenryck P V, Provost T L. Incremental Seacher in Constraint Logic Programming, New Generation Computing, 1991(9):257-275.
[48] Ishibuchih, Murata T. Multi-objective genetic local search algorithm[C]. Proc. of 3-rd IEEE International Conference on Evolutionary Computation, Japan, Nagoya,1996: 119-124.
[49] Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization [J]. Journal of Operational Research, 2002, 137 (1): 50-71.
[50] Ulungu E, Teghem J. MOSA method: a tool for solving multi-objective combinatorial optimization Problems [J]. Journal of Multi-Criteria Decision Analysis, 1999, 8 (4): 221 - 236.
[51]王洪礼,郭龙,高强,向建平.基于MAS的蚁群算法在机械机群路面施工动态调度中的研究[J].制造业自动化,2005-12.
[52]姜昌,范晓玲著.航天通信跟踪技术导论[M].北京工业大学出版社,2003.
[53]总装备部卫星有效载荷及应用技术专业组应用技术分组编.卫星应用现状与发展[M].中国科学技术出版社,2001.
[54]夏南银主编.航天测控系统[M].国防工业出版社,2002.
[55]NASA:http://www.arc.nasa.gov/.
[56]AIAA:http://www.aiaa.org/.
[57]Space Network Information Center:http://nmsp.gsfc.nasa.gov/tdrss/.
[58]Analytical Graphics Inc.Satellite Tool Kit 5.0,2003.
[59]杨颖,王琦.STK在计算机仿真中的应用.北京:国防工业出版社,2005.
[60]Dorigo M,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperating agents[J].IEEE Transaction on Systems,1996,26(1):1-26.
[61]Gambardella L M,Dorigo M.Ant-Q:a reinforcement learning approach to the traveling salesman problem[A].In Proceedings of the Twelfth International Conference on Machine Learning,ML--95[C],Palo Alto:Morgan Kaufmann,1995.252-260.
[62]Dorigo M,Gambardella C.Ant colony system:A cooperative learning approach to the traveling salesman problem[J].IEEE Trans.Evolution Compute,1997,1(1):53-66.
[63]Stutzlet T,Hoosholger H.Max-min ant system[J].Future Generation Computer System,2000,(16):889-914.
[64]Bulinheimer B,Hartl R F,Strauss C.A new rank based version of the ant system-a computational study[J].Central European J.Oper.Res.Econom.,1999,7:25-38.
[65]Colomi A,Dorigo M,Maniezzo V,et al.Ant system for job-shop scheduling[J].Belgian Journal of Operations Research,Statistics and CombuterSeience,1994,34(1):39-53.
[66]Thomas Sttitzle,Holger Hoos.MAX-MIN ant system and local search for the traveling salesman problem[A].Proc.IEEE International Conference on Evolutionary Computation(ICEC'97)[C],Indianapolis:[s.n.],1997,309-314.
[67]Dorigo M,Bonabeau E,Theraulaz G.Ant algorithm and stigmery[J].Future Generation Computer Systems,2000,16(8):851-871.
[68]Tsai C F,Tsai C W.A new approach for solving large traveling sales-man problem using evolution ant rules[C].In Proc.of the 2002 Int.Joint Cod.on Neural Networks,IJCNN 2002 Honolulu:IEEE Press,V01 2.2002:1540-1545.
[69]Parpinelli R S,Lopes H S,Freitas A A.Data mining with an ant colony optimization algorithm[J].IEEE Trans.on Evolutionary Computation,2002,6(4):321-328.
[70]Goldberg D E.Genetic Algorithms in Search,Optimization,Machine Learning.Reading MA:Addison Wesley,1989.
[71]Holland J H.Adaption in Nature and Artificial Systems.MIT Press,1992.
[72]Goldberg D E,Segrest P.Finite Markov chain analysis of genetic algorithms.In:Proc.of the 2nd Int Conf.Genetic Algorithms,1987.1-8.
[73]Ankenbrandt C A.An extension to the theory of convergence and a proof the time complexity of genetic algorithms.In Foundations of Genetic Algorithms,1994,53-58.
[74]Bertoni A,Dorigo M.Implicitparallelism in genetic algorithms.Artificial Intelligence,1993,61(2):307 -314.
[75]恽为民,席裕庚.遗传算法的运行机理分析.控制理论与应用,1996,13(3):289-297.
[76]马丰宁.遗传算法与遗传规划运行机理的研究.天津大学博士学位论文,1998.
[77]Grefenstette J J.Conditions for implicit parallelism.In Foundations of Genetic Algorithms,CA:Morgan Kaufmann,1991.252-261.
[78]Salomon R.Raising theoretical questions about the utility of genetic algorithms.In Evolutionary Programming Ⅵ,Berlin:Springer,1997,275-284.
[79]Kuo T,Hwang S.A genetic algorithm with disruptive selection.IEEE Trans.on Systems,Man.and Cybernetics--Part B:Cybernetics,1996,26(2):299-307.
[80]Grefenstette J J.Deception considered harmful.In Foundations of Genetic Algorithms,CA:Morgan Kaufmann,1993,75-91.
[81]Cardoso M F,Salcedo R L.A simulated annealing approach to the solution of MINLP problems[J].Computer Chem.,Engng.,1997,21(12),1349-1364.
[82]康立山,谢云,尤矢勇等.非数值并行算法-模拟退火算法[M].北京:科学出版社,1998.
[83]Arts E H L,Korst J H M.Simulated annealing and Boltzmann Machine.John Wiley and sons,1989.
[84]Vanlaarhoven P J M,Aarts E H L.Simulated annealing:theory and application.D.Reidel,1987.
[85]Ingber L.Very fast simulated annealing[J].Math.Comput.Modeling,1989,12:967-973.
[86]Kirkpatrick S,Gelatt C D,Vecchi M P.Optimization by simulated annealing[J].Science,1983,(220):671-680.
[87]袁富宇.用于多目标数据互联的模拟退火算法[J].系统工程理论与实践,1998,8(10).
[88]王凌.智能优化算法及其应用[M].北京:清华大学出版社,2001.
[89]李红军.模拟退火遗传算法的性能评价.湖南城市学院学报,2003,(5).
[90]高尚,杨静宇等.圆排列问题的蚁群模拟退火算法.系统工程理论与实践,2004(8):102-106.
[91]高国华,沈林成,常文森.求解TSP问题的空间锐化模拟退火算法[J].自动化学报,1999,25(3):425-428.
[92]王凌,郑大钟.多目标优化的一类模拟退火算法[J].计算机工程与应用,2002,38(8):4-5.
[93]Cone M L,Musick S.Scheduling for sensor management using genetic[C].Proceedings of the IEEE 1996 National Aerospace and Electronics Conference,NAECON 1996,vol.1,Dayton OH,May 20 - 23,1996:150-156.
[94]郭浩波,王颖龙,曾辉.采用遗传模拟退火算法研究导弹预警卫星传感器调度.光电与控制,2006,8(4):71-74.
[95]Fandel G,Gal T.Multiple Criteria Decision Making-Theory and Application[M].Springer-Verlag,1980.
[96]Zitzler E,Thiele L.Multiobjective optimization using evolutionary algorithms-A comparative case study[A].Parallel Problem Solving from Nature-PPSNV[M],Berlin Springer,1998.
[97]Fonseca C M,Fleming P J.Multiobjective genetic algorithms made easy:selection,sharing and mating restriction[A].Proceeding of the 1st international Conferenceon Genetic Algorithms in Engineering Systems:Innovations and Applications,IEE[C],September 1995,414:45-52.
[98]Ozernoy V M.Choosing the "best" multiple criteria decision-making method[J].INFOR,1992,30(1):159-171.
[99]Stewart T J.A critical survey on the status of multiple criteria decision-making theory and pract ice[J].OMEGA,1992,20:569-586.
[100]Chiclana F,Herrera F,Herrera-Viedma E.Integrating three representation models in fuzzy multipurpose decision making based on fuzzy preference relations[J].Fuzzy Sets and Systems,1998,97:33-48.
[101]Feng S,Xu L D.Decision support for fuzzy comprehensive evaluation of urban development[J].Fuzzy Sets and Systems,1999,105:1-12.
[102]余雁等.多指标决策TOPSIS方法的进一步探讨[J].系统工程,2003,21(2):98-101.
[103]虞晓芬,傅玳.多指标综合评价方法综述[J].知识丛林,2004,11(179),119-121.
[104]Shi Y H,Eberhart R C.A modified particle swarm optimizer[A].IEEE International Conference of Evolutionary Computation,Anchorage,Alaska,1998.
[2]姜昌,范晓玲著.航天通信跟踪技术导论[M].北京工业大学出版社,2003.
[3]总装备部卫星有效载荷及应用技术专业组应用技术分组编.卫星应用现状与发展[M].中国科学技术出版社,2001.
[4]Waldemar Kocian.Dynamic scheduling State of the art report[R].SICS Technical Report T2002-28,Oct 2002.
[5]Gerard Verfaillie,Thomas Schiex.Solution Reuse in Dynamic Constraint Satisfaction Problems[J].Proceedings of the Twelfth Conference of the American Association of Artificial Intelligence,1994:307-312.
[6]Weixiong Zhang.Modeling and Solving a Resource Allocation Problem with Soft Constraint Techniques[R].Techincal Report:WUCS-2002-13,2002.
[7]Marco Adinolfi,Amedeo Cestal.Heuristic scheduling of the DRS communication system[J].Engineering Applications of Artificial Intelligence,1995,8(2):147-156.
[8]Rojanasoonthon S,Bard J F,Reddy S D.Algorithms for parallel machine scheduling:a case study of the Tracking and Data Relay Satellite System[J].Journal of the Operational Research Society,2003,54(8):806-821.
[9]Rojanasoonthon S.Parallel machine scheduling with time windows[Ph.D.Thesis].Graduate School of the University of Texas at Austin,2004.
[10]Hajghassem H,Rohi H,Nasirzadeh M.Investigation and analysis of Tracking and Data Relay Satellite Systems(TDRSS)[J].The 21st international communications satellite systems conference and Exhibit,AIAA 2003-2329,2003.
[11]Eytan Modiano.Resource allocation and congestion control in next generation satellite networks[J].Ardent Workshop,MIT,2003.
[12]Yingyong Chen,Michael Hadjitheodosiou,Cynthia Cheung.Optimizing communications for constellation space missions[J].The 21st international communications satellite systems conference and Exhibit,AIAA 2003-2401,2003.
[13]方炎申,中继卫星调度模型研究[D].国防科技大学博士学位论文,2007.
[14]Surender Reddy D.Scheduling of tracking and data relay satellite system(TDRSS)antennas:Scheduling with sequence dependent setup times[Z].Presented at ORSA/TIMS Joint National Meeting,Denver,Colorado,October 1988.
[15]Surender Reddy D and William Brown L.Single processor scheduling with job priorities and arbitrary ready and due times[Z].Working paper,Computer Sciences Corporation,Beltsville,Maryland,October 1986.
[16]Zillig D,McOmber R,Home W D.Demand access service for TDRSS users[J].AIAA 16th International Communications Satellite Systems Conference,Washington.DC,25-29 February 1996.
[17]陈理江,武小悦,李云峰,基于时间灵活度的中继卫星调度算法.航空计算技术,2006,4:1671-654X.
[18]Pemberton J C,Greenwald L G.On the Need for Dynamic Scheduling of the Image Satellite[J].Pecora 15/Land Satellite Information Ⅳ/ISPRS Commission Ⅰ/FIEOS 2002 Conference Proceedings,2002.
[19]Ari K Jonssop,NASA Research Center.Constraint_Based Planning.8 October 2002.
[20]邓晋军,张乃通,张丽艳.合理利用测控资源的动态调度模型.高技术通讯,2002.
[21]刘洋.成像侦察卫星动态重调度模型、算法及应用研究[D].国防科技大学博士学位论文,2004.
[22]张正强.基于MAS的分布式成像卫星系统任务规划与控制问题研究[D].国防科技大学博士学位论文,2006.
[23]Sherwood R,Govindjee A,Yan D,Rabideau G,Chien S,Fukunaga A.Using ASPEN to automate EO-1 activity planning[J].Proceedings of the 1998 IEEE Aerospace Conference,Colorado,1998.
[24]Veridian Incorporation.Generic Resource Event and Activity Scheduler[Z],2003.
[25]Analytical Graphics Incorporation.Satellite Tool Kit 5.0[Z],2003.
[26]ILOG Incorporation.ILOG Solver 5.3 User's Manual[Z],2003.
[27]ILOG Incorporation.ILOG Scheduler 5.3 User's Manual[Z],2003.
[28]ILOG Incorporation.ILOG Cplex8.1 User's Manual[Z],2003.
[29]Jackson J R.Simulation research on job shop production[J].Naval Res Log Quart,1957,4(3):287-295.
[30]Matsuura H,Tsubone H,Kanezashi M.Sequencing,dispatching and switching in dynamic manufacturing environment[J].Int.J.of Prod.Res.,1993,31(7):1671-1688.
[31]Panwalker S S,Iskander Wafik.A survey of scheduling rules[J].Oper.Res.,1977,25(1):45-61.
[32]Abumaizar R J,Svestka J A.Rescheduling job shop sunder random disruptions[J].Int.J.of Prod.Res.,1997,35(7):2065-2082.
[33]Liu H J,Dong Jian.Dispatching rule selection using artificial neural networks for dynamic planning and scheduling[J].J.of Intel Manuf.,1996,7(2):243-250.
[34]Fox M S,Smith S F.ISIS:A knowledge-based system for factory scheduling[J].Expert Syst.,1984,1(1):25-49.
[35] Smith S F, Hynyen J E. Integrated decentralization of production management for factory scheduling [A].Symp. on Integ. and Intel Manuf. [C], Boston, 1987.
[36] Bensana E, Dubois D. OPAL: A multi knowledge-based system for industrial job-shop scheduling [J]. Int. J. of Prod. Res., 1988, 26 (5): 795-819.
[37] Chu H, Wysk R A. A robust adaptive scheduler for an intelligent work station controller [J]. Int. J. of Prod. Res., 1993, 31 (4): 771-789.
[38] Jones Albert, Rabelo Kuis Yih, Yuehwern Y. A hybrid approach for real-time sequencing and scheduling [J]. Int. J. of Comp. Integ. Manuf., 1995, 8 (2):145-154.
[39] Lee C Y, Piramuthu S, Tsai Y K. Job shop scheduling with a genetic algorithm and machine learning [J]. Int. J. of Prod. Res., 1997, 35 (4): 1171-1191.
[40] Jian A K, Elmaraghy H A. Production scheduling rescheduling in flexible manufacturing [J]. Int. J. of Prod. Res., 1997, 35 (1): 281-309.
[41] Matthew Ginsberg. Dynamic Backtracking. Journal of Artificial Intelligence Research, 1993(1): 25-46.
[42] Schiex T, Verfaillie G. Nogood Recording for Static and Dynamic CSP. In Proceeding of the 5th IEEE international Conference on Tools with Artificial Intelligence, 1993.
[43] Gerard Verfaillie, Thomas Schiex. Dynamic Backtracking for Dynamic Constraint Satisfaction Problems. ECAI, Amsterdam, Netherlands, 1994.
[44] Naredra Jussien, Olivier Lhomme. Dynamic Backtracking with Constraint Proagation Application to numeric CSPs. CP97, Schloss Hangenberg, Austia, Nov.1,1997.
[45] Naredra Jussien, Patrice Boizumaut. Dynamic Backtracking with Constraint Propagation Application to static and Dynamic CSPs. CP97, Schloss Hangenberg,Austia, Nov. 1, 1997.
[46] Armin Wolf. Incremental Adaptation of Constraint Handling Rule Derivations.CP 97, Schloss Hangenberg, Austia, Nov. 1,1997.
[47] Hentenryck P V, Provost T L. Incremental Seacher in Constraint Logic Programming, New Generation Computing, 1991(9):257-275.
[48] Ishibuchih, Murata T. Multi-objective genetic local search algorithm[C]. Proc. of 3-rd IEEE International Conference on Evolutionary Computation, Japan, Nagoya,1996: 119-124.
[49] Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization [J]. Journal of Operational Research, 2002, 137 (1): 50-71.
[50] Ulungu E, Teghem J. MOSA method: a tool for solving multi-objective combinatorial optimization Problems [J]. Journal of Multi-Criteria Decision Analysis, 1999, 8 (4): 221 - 236.
[51]王洪礼,郭龙,高强,向建平.基于MAS的蚁群算法在机械机群路面施工动态调度中的研究[J].制造业自动化,2005-12.
[52]姜昌,范晓玲著.航天通信跟踪技术导论[M].北京工业大学出版社,2003.
[53]总装备部卫星有效载荷及应用技术专业组应用技术分组编.卫星应用现状与发展[M].中国科学技术出版社,2001.
[54]夏南银主编.航天测控系统[M].国防工业出版社,2002.
[55]NASA:http://www.arc.nasa.gov/.
[56]AIAA:http://www.aiaa.org/.
[57]Space Network Information Center:http://nmsp.gsfc.nasa.gov/tdrss/.
[58]Analytical Graphics Inc.Satellite Tool Kit 5.0,2003.
[59]杨颖,王琦.STK在计算机仿真中的应用.北京:国防工业出版社,2005.
[60]Dorigo M,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperating agents[J].IEEE Transaction on Systems,1996,26(1):1-26.
[61]Gambardella L M,Dorigo M.Ant-Q:a reinforcement learning approach to the traveling salesman problem[A].In Proceedings of the Twelfth International Conference on Machine Learning,ML--95[C],Palo Alto:Morgan Kaufmann,1995.252-260.
[62]Dorigo M,Gambardella C.Ant colony system:A cooperative learning approach to the traveling salesman problem[J].IEEE Trans.Evolution Compute,1997,1(1):53-66.
[63]Stutzlet T,Hoosholger H.Max-min ant system[J].Future Generation Computer System,2000,(16):889-914.
[64]Bulinheimer B,Hartl R F,Strauss C.A new rank based version of the ant system-a computational study[J].Central European J.Oper.Res.Econom.,1999,7:25-38.
[65]Colomi A,Dorigo M,Maniezzo V,et al.Ant system for job-shop scheduling[J].Belgian Journal of Operations Research,Statistics and CombuterSeience,1994,34(1):39-53.
[66]Thomas Sttitzle,Holger Hoos.MAX-MIN ant system and local search for the traveling salesman problem[A].Proc.IEEE International Conference on Evolutionary Computation(ICEC'97)[C],Indianapolis:[s.n.],1997,309-314.
[67]Dorigo M,Bonabeau E,Theraulaz G.Ant algorithm and stigmery[J].Future Generation Computer Systems,2000,16(8):851-871.
[68]Tsai C F,Tsai C W.A new approach for solving large traveling sales-man problem using evolution ant rules[C].In Proc.of the 2002 Int.Joint Cod.on Neural Networks,IJCNN 2002 Honolulu:IEEE Press,V01 2.2002:1540-1545.
[69]Parpinelli R S,Lopes H S,Freitas A A.Data mining with an ant colony optimization algorithm[J].IEEE Trans.on Evolutionary Computation,2002,6(4):321-328.
[70]Goldberg D E.Genetic Algorithms in Search,Optimization,Machine Learning.Reading MA:Addison Wesley,1989.
[71]Holland J H.Adaption in Nature and Artificial Systems.MIT Press,1992.
[72]Goldberg D E,Segrest P.Finite Markov chain analysis of genetic algorithms.In:Proc.of the 2nd Int Conf.Genetic Algorithms,1987.1-8.
[73]Ankenbrandt C A.An extension to the theory of convergence and a proof the time complexity of genetic algorithms.In Foundations of Genetic Algorithms,1994,53-58.
[74]Bertoni A,Dorigo M.Implicitparallelism in genetic algorithms.Artificial Intelligence,1993,61(2):307 -314.
[75]恽为民,席裕庚.遗传算法的运行机理分析.控制理论与应用,1996,13(3):289-297.
[76]马丰宁.遗传算法与遗传规划运行机理的研究.天津大学博士学位论文,1998.
[77]Grefenstette J J.Conditions for implicit parallelism.In Foundations of Genetic Algorithms,CA:Morgan Kaufmann,1991.252-261.
[78]Salomon R.Raising theoretical questions about the utility of genetic algorithms.In Evolutionary Programming Ⅵ,Berlin:Springer,1997,275-284.
[79]Kuo T,Hwang S.A genetic algorithm with disruptive selection.IEEE Trans.on Systems,Man.and Cybernetics--Part B:Cybernetics,1996,26(2):299-307.
[80]Grefenstette J J.Deception considered harmful.In Foundations of Genetic Algorithms,CA:Morgan Kaufmann,1993,75-91.
[81]Cardoso M F,Salcedo R L.A simulated annealing approach to the solution of MINLP problems[J].Computer Chem.,Engng.,1997,21(12),1349-1364.
[82]康立山,谢云,尤矢勇等.非数值并行算法-模拟退火算法[M].北京:科学出版社,1998.
[83]Arts E H L,Korst J H M.Simulated annealing and Boltzmann Machine.John Wiley and sons,1989.
[84]Vanlaarhoven P J M,Aarts E H L.Simulated annealing:theory and application.D.Reidel,1987.
[85]Ingber L.Very fast simulated annealing[J].Math.Comput.Modeling,1989,12:967-973.
[86]Kirkpatrick S,Gelatt C D,Vecchi M P.Optimization by simulated annealing[J].Science,1983,(220):671-680.
[87]袁富宇.用于多目标数据互联的模拟退火算法[J].系统工程理论与实践,1998,8(10).
[88]王凌.智能优化算法及其应用[M].北京:清华大学出版社,2001.
[89]李红军.模拟退火遗传算法的性能评价.湖南城市学院学报,2003,(5).
[90]高尚,杨静宇等.圆排列问题的蚁群模拟退火算法.系统工程理论与实践,2004(8):102-106.
[91]高国华,沈林成,常文森.求解TSP问题的空间锐化模拟退火算法[J].自动化学报,1999,25(3):425-428.
[92]王凌,郑大钟.多目标优化的一类模拟退火算法[J].计算机工程与应用,2002,38(8):4-5.
[93]Cone M L,Musick S.Scheduling for sensor management using genetic[C].Proceedings of the IEEE 1996 National Aerospace and Electronics Conference,NAECON 1996,vol.1,Dayton OH,May 20 - 23,1996:150-156.
[94]郭浩波,王颖龙,曾辉.采用遗传模拟退火算法研究导弹预警卫星传感器调度.光电与控制,2006,8(4):71-74.
[95]Fandel G,Gal T.Multiple Criteria Decision Making-Theory and Application[M].Springer-Verlag,1980.
[96]Zitzler E,Thiele L.Multiobjective optimization using evolutionary algorithms-A comparative case study[A].Parallel Problem Solving from Nature-PPSNV[M],Berlin Springer,1998.
[97]Fonseca C M,Fleming P J.Multiobjective genetic algorithms made easy:selection,sharing and mating restriction[A].Proceeding of the 1st international Conferenceon Genetic Algorithms in Engineering Systems:Innovations and Applications,IEE[C],September 1995,414:45-52.
[98]Ozernoy V M.Choosing the "best" multiple criteria decision-making method[J].INFOR,1992,30(1):159-171.
[99]Stewart T J.A critical survey on the status of multiple criteria decision-making theory and pract ice[J].OMEGA,1992,20:569-586.
[100]Chiclana F,Herrera F,Herrera-Viedma E.Integrating three representation models in fuzzy multipurpose decision making based on fuzzy preference relations[J].Fuzzy Sets and Systems,1998,97:33-48.
[101]Feng S,Xu L D.Decision support for fuzzy comprehensive evaluation of urban development[J].Fuzzy Sets and Systems,1999,105:1-12.
[102]余雁等.多指标决策TOPSIS方法的进一步探讨[J].系统工程,2003,21(2):98-101.
[103]虞晓芬,傅玳.多指标综合评价方法综述[J].知识丛林,2004,11(179),119-121.
[104]Shi Y H,Eberhart R C.A modified particle swarm optimizer[A].IEEE International Conference of Evolutionary Computation,Anchorage,Alaska,1998.