成像卫星鲁棒性调度方法及应用研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
成像卫星是一类用于从太空中获取地面遥感信息的对地观测卫星,随着成像卫星的数量和种类的逐步增多,成像任务的需求量也将快速增加,对成像任务的时效性、准确性要求将更加严格,任务管理的复杂度也将大大增加。成像卫星调度就是在综合考虑卫星资源能力和成像任务要求的基础上,将资源分配给相互竞争的多个任务,并确定各任务的起止时间,以排除不同任务之间的资源使用冲突,充分发挥卫星系统的能力,并最大化满足各类用户的需求。目前,对成像卫星调度问题的研究还主要集中在确定性调度领域。在实际的成像卫星系统运行过程中,存在着很多不确定性因素,如新任务的插入、已安排任务的取消、任务属性的改变、天气的变化、卫星资源状态的变化等。论文在总结和分析国内外相关研究工作的基础上,采用鲁棒性调度方法求解不确定条件下的成像卫星调度问题,将成像卫星鲁棒性调度分为鲁棒性调度方案生成和鲁棒性调度方案动态调整两个阶段。本文的主要研究工作和创新点如下:
     (1)提出了成像任务收益的计算方法和基于邻域的鲁棒性指标,建立了成像卫星鲁棒性调度模型。论文在对影响成像任务收益的主要影响因素进行分析的基础上,拓展了任务收益的计算方法,使得成像任务的收益不仅反映了观测目标的重要程度,而且兼顾了成像质量和当前调度周期后任务的剩余可行观测机会。借鉴连续函数的鲁棒性优化思想,提出了基于邻域的鲁棒性指标,分析了问题的主要约束条件,在此基础上,建立了成像卫星鲁棒性调度模型。
     (2)针对成像卫星鲁棒性调度模型,提出了基于偏好的分层多目标遗传算法PHMOGA。论文借鉴文化算法的双层空间概念和基于偏好的加权Pareto方法,设计了一种基于偏好的分层多目标遗传算法PHMOGA。针对成像卫星鲁棒性调度的特点,采用合适的编码方式对问题的解进行描述,给出了构造初始种群的贪婪随机插入算法,提出了基于知识进化层的知识进化策略,设计了与编码方式相对应的任务序列交叉算子和多态变异算子,并对算法的收敛性进行了分析。
     (3)提出了任务最早开始执行时间和最晚开始执行时间的计算方法,给出了遗传操作的可行性分析和参数更新方法。在成像卫星调度问题中,时间约束和能量约束是两类主要的约束条件,只有满足约束条件的遗传操作才是可行的。论文针对时间约束和能量约束,提出了关键任务序列和后向能量负荷等概念,给出了任务最早开始执行时间和最晚开始执行时间的计算方法。针对转移任务操作和交换任务操作,给出了具体的可行性分析方法和参数更新方法。
     (4)针对成像卫星鲁棒性调度方案动态调整问题,建立了成像卫星动态调度模型,提出了动态插入任务启发式算法DITHA。论文针对各种不确定因素造成的扰动,把成像卫星鲁棒性调度方案动态调整问题统一描述为一类插入任务的动态调度问题。针对成像卫星动态调度问题的特点,建立了成像卫星动态调度模型,提出了动态插入任务启发式算法DITHA。计算实例和测试实验结果表明,在对调度方案进行动态调整时,调整的结果一方面与动态调整的方法有关,另一方面也与调度方案的鲁棒性有关。调度方案的鲁棒性越强,动态调整的效果越好。
     (5)将上述研究成果应用于成像卫星规划调度系统,介绍了该系统的设计和实现,并利用该系统对一个具体的应用实例进行了求解和分析,求解结果验证了本文提出的成像卫星鲁棒性调度方法的有效性。
Imaging satellite is a kind of Earth Observation Satellite (EOS) acquiring remote sensing information from outer space. The imaging requirments will augment rapidly with the increasement of the imaging satellites, the time efficiency and accuracy of the imaging tasks will be more and more rigorous and the complexity of task management will be enhanced largely. Scheduling of imaging satellites means to allocate multiple satellite resources to multi competitive tasks without conflict and ascertain the execution times of those tasks according to the user's requirements and satellite capabilities, and makes the most use of the limited resources in order to satisfy multifarious observing requirements in future. So far, researches have been primarily focused on imaging satellites scheduling problem without uncertainty. In practice, the satellites are working in a complex environment, faced with different uncertainties such as insertion of new tasks, cancellation of arranged tasks, change of task properties, change of weather condition, unanticipated changes in satellite resources and etc. Based on the summarizing and analyzing of research works inside and outside, this thesis devides the whole problem into two phases including the creation of robust solution phase and the dynamic adjustment of robust solution phase. The main research contents and achievements of this thesis are as follows:
     (1) Putting forward the imaging task gain computation method and the neighborhood-based robustness measure, and presenting the imaging satellites robust scheduling model. On the basis of analysis on the main contributing factors, we extend the task gain computation method to take into account the importance of observing target, image quality and remaining feasibility opportunities at the same time. We then propose a neighborhood-based robustness measure for scheduling which is inspired by advances in robust optimization of continuous functions, analyse the main constraints and present the imaging satellites robust scheduling model.
     (2) Proposing a preference-based hierachical multi-objective genetic algorithm (PHMOGA) to solve the imaging satellites robust scheduling model. This thesis designs PHMOGA which is inspired by hierachical places of the culture algorithm and preference-based weighted Pareto. According to the character of imaging satellites robust scheduling, we use the appropriate encoding method to depict the solution, give a greedy randomized insert algorithm to construct initial feasible population for evolution, propose a knowledge evolution strategy based on the knowledge evolution space, design the task sequence-based crossover operator and multi-mode mutation operator, and analyze the convergence for PHMOGA.
     (3) Presenting the computation methods of earlist start execution time and latest start execution time, and providing the feasibility analysis and parameters update methods of genetic operators. Time constraint and energy constraint are primary constraints in imaging satellites scheduling problem. This thesis provides the notions of critical task sequence and backward energy load and presents the computation methods of earlist start execution time and latest start execution time. The feasibility analysis and parameters update methods are then provided for task transferring operation and task exchanging operation.
     (4) Presenting the imaging satellites dynamic scheduling model and its dynamic insert tasks heuristic algorithm (DITHA) with regard to the dynamic adjustment problem of imaging satellites robust solution. This thesis describes the problem with a unified form of dynamic problem with tasks insertion considering the different perturbations, and presents the imaging satellites dynamic scheduling model and its dynamic insert tasks heuristic algorithm. The demonstration calculation and experiments on test instances show that result of the adjustment depends both on adjusting approach and robustness of the solution.
     (5) Introducing the design and realization of the imaging satellites planning and scheduling system with the application of the aforementioned achievements. Also an example application is given and solved by the system, the result confirms the validity of imaging satellites robust scheduling approach provided in this paper.
引文
[1]王永刚,刘玉文.军事卫星及应用概论.北京:国防工业出版社,2003.5.
    [2]马惠元.国外卫星侦察与监视技术发展的综合评述与体制初探.空间电子技术,2002,3:7-17.
    [3]廖育荣.航天侦察对现代战争的影响和对策.装备技术学院学报,1999,10(6):27-30.
    [4]总装备部卫星有效载荷及应用技术专业组应用技术分组.卫星应用现状与发展.北京:中国科学技术出版社,2001.
    [5]Gerard Verfaillie,Thomas Schiex.Solution Reuse in Dynamic Constraint Satisfaction Problems.Proceedings of the Twelfth Conference of the American Association of Artificial Intelligence,307-312,1994.
    [6]Waldemar Kocian.Dynamic Scheduling State of the Art Report.SICS Technical Report T2002-28,Oct 2002.
    [7]Bensana E,Verfaillie G,Bataillie N,et al.Exact and Inexact Methods for the Daily Management of an Earth Observing Satellite.Proceedings of SpaceOPS,Munich,1996.
    [8]Vasquez M,Hao J.A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite.Journal of autational Optimization and Applications,2000.
    [9]Gabrel C.MP for Earth Observation Satellite Mission Planning.Operations Research in Space and Air,2003.
    [10]Song D,Frank A,Stappen V,et al.An Exact Algorithm Optimizing Coverage-Resolution for Automated Satellite Frame Selection.IEEE International Conference on Robotics and Automation,2004:63-70.
    [11]J Pemberton.Towards Scheduling Over-Constrained Remote Sensing Satellites.Proceedings of the 2~(nd) International Workshop on Planning and Scheduling for Space,2000.
    [12]Joseph Pemberton,Flavius Galiber.A Constraint-Based Approach to Satellite Scheduling.DIMACS Workshop on Discrete Optimization,September 1998.
    [13]William J Wolfe,Stephen E Sorensen.Three Scheduling Algorithrns Applied to the Earth Observing Systems Domain.Management Science,2000(46):148-168.
    [14]Harrison S.A,Price M.E..Task Scheduling for Satellite Based Imagery.Proceedings of the Eighteenth Workshop of the UK Planning and Scheduling Special Interest Group,University of Salford,UK,1999,64-78.
    [15]Nicholas G,Michael J.Maximizing the Value of a Space Mission.European Journal of Operational Research,1994,78:224-241.
    [16]S BurrowBridge.Optimal Allocation of Satellite Networks Resource:[master thesis],Virginia:Virginia Tech University,1999.
    [17]Al Globus,James Crawford,Jason Lohn,Robert Morris.Scheduling Earth Observing Fleets Using Evolutionary Algorithms:Problem Description and Approach.Proceedings of the 3~(rd) International NASA Workshop on Planning and Scheduling for Space,NASA,2002.
    [18]Jeremy Frank,Ari Jonsson,Robert Morris,David Smith.Planning and Scheduling for Fleets of Earth Observing Satellites.Proceeding of the 6~(th) International Symposium on Artificial Intelligence,Robotics,Automation and Space 2002,Montreal,2002.
    [19]Morris R,Dungan J,Gasch J,Hempel P.Coordinated Science Campaign Planning for Earth Observing Missions.ESTC2004,NASA,2004.
    [20]Morris R,Dungan J,Edgington W,et al.Coordinated Science Campaign Scheduling for Sensor Webs.Proceedings of i-SAIRAS'05,Munchen,2005.
    [21]Jackson Sarah E.Planning Coverage of Points of Interest via Multiple Imaging Surveillance Assets:A Mulit-Modal Approach.2003.
    [22]陈金勇,冯阳,彭会湘.一种卫星照相规划软件的可视化设计与实现.无线电通信技术,2004,30:35-37.
    [23]陈站华.资源卫星任务安排测试方法的研究与实现.无线电工程,2005,35:62-64.
    [24]代树武.航天器自主运行关键技术的研究.北京:中国科学院空间科学与应用研究中心博士后士学位论文,2002.
    [25]代树武,孙辉先.卫星的智能规划与调度.控制与决策,2003,18:203-206.
    [26]刘洋,代树武.卫星有效载荷的规划与调度.华北航天工业学院学报,2004,14:1-4.
    [27]贺仁杰.成像侦察卫星调度问题研究.国防科技大学博士学位论文,2004.
    [28]李菊芳.航天侦察多星多地面站任务规划问题研究.国防科技大学博士学位论文,2005.
    [29]张帆.成像卫星计划编制中的约束建模及优化求解技术研究.国防科技大学博士学位论文,2005.
    [30]阮启明.面向区域目标的成像侦察卫星调度问题研究.国防科技大学博士学位论文,2005.
    [31]王钧.成像卫星综合任务调度模型与优化方法研究.国防科技大学博士学位论文,2007.
    [32]G.Verfaillie,E.Bensana,C.Michelon-Edery,N.Bataille.Dealing with Uncertainty when Managing an Earth Observation Satellite.Proceedings of i-SAIRAS-99,pages 205-207,Noordwijk,The Netherlands,1999.
    [33]Da-Yin Liao,Yu-Tstmg Yang.Satellite Imaging Order Scheduling with Stochastic Weather Condition Forecast.Systems,Man and Cybernetics,2005IEEE International Conference,2005.
    [34]刘洋.成像侦察卫星动态重调度模型、算法及应用研究.国防科技大学博士学位论文,2005.
    [35]H Muraoka,R H Cohen,T Ohno,N Doi.Aster Observing Scheduling Algorithms.Proceeding of SpaceOPS,Japan:Tokyo,1998.
    [36]Potter W.A Photo Album of Earth:Scheduling Landsat 7 Mission Daily Activities.Proceeding of SpaceOPS,Japan:Tokyo,1998.
    [37]R Sherwood,A Oovindjee,D Yan,G Rabideau,S Chien,A Fukunaga.Using ASPEN to Automate EO-1 Activity Planning.Proceedings of the 1998 IEEE Aerospace Conference,Colorado,1998.
    [38]M.Lemaitre,G.Verfaillie,F.Jouhaud,J.M.Lachiver,N.Bataille.Selecting and Scheduling Observations of Agile Satellites.Aerospace Science and Technology,2002,6:367-381.
    [39]J.Frank,A.Jonsson,P.Morris.On the Representation of Mutual Exclusion Constraints for Planning.Proceedings of the Symposium on Abstraction,Reformulation and Approximation,2000.
    [40]Bensana E,Verfaillie G,Lemaitre M.Earth Observing Satellite Management.Constraints,1999,4(3):293-299.
    [41]Agnese J,Bataille N,Bensana E,et al.Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite.Proceedings of the 5~(th) ESA Workshop on Artificial Intelligence and Knowledge Based Systems for Space,1995.
    [42]Beker T,Chechik G.,Meilijson I,et al.PlanSat-A Novel Solution for Imaging Satellite Scheduling.White paper,Soligence Corp.
    [43]Dungan,J,Frank,J,Jonsson,A,Morris.Advances in Planning and Scheduling of Remote Sensing Instruments for Fleets of Earth Orbiting Satellites.Proceedings of the 2~(nd) Annual Earth Science Technology Conference,Pasadena,2002.
    [44]G.Verfaillie,Michel Lemaitre.Selecting and Scheduling Observations for Agile Satellites:Some Lessons from the Constraint Reasoning Community Point of View.The Seventh International Conference on Practical and Principles of Constraint Programming,2001:670--684.
    [45]M Vasques,G Verfaillie,N Bataillie.Sharing the Use of a Satellite:an Overview of Methods.Proceeding of SpaeeOPS,Japan:Tokyo,1998.
    [46]GlobusA,Crawford J,Lohn J,et al.Scheduling Earth Observing Satellites with Evolutionary Algorithms.Proceedings of Coference on Space Mission Changes for Information Technology(SMC-IT),2003.
    [47]Globus A,Crawford J,Lohn J.A Comparison of Techniques for Scheduling Earth Observing Satellites.AAAI 2004:836-843.
    [48]Stephen C.Billups.Final Report of the UCDHSC Mathematics Clinic Satellite Mission Scheduling with Dynamic Tasking,http://www-math.cudenver.edu/.
    [49]J.C.Pemberton,L.G.Greenwald.On The Need For Dynamic Scheduling of the Image Satellite.Pecora 15/Land Satellite Information IV/ISPRS Commission I/FIEOS 2002 Conference Proceedings,2002.
    [50]Lina Khatib,Jeremy Frank,David Smith,Robert Morris,Jennifer Dungan.Interleaved Observation Execution and Rescheduling on Earth Observing Systems.Plan Execution Workshop at the 13~(th) International Conference on Automated Planning & Scheduling,Trento,Italy,2002.
    [51]Lina Khatib,Robert Morris,Rich Slywczak,and Thong Luu.Integration of On-board EOS Schedule Revision with Space Communition Emulation System.Proceedings of the 8th ESA Workshop on Advanced Space Technologies for Robotics and Automation 'ASTRA 2004' ESTEC,Noordwijk,Netherlands,November 2-4,2004.
    [52]Robert Morris,Jennifer Dungan,Jeremy Frank,Lina Khatib,David Smith.An Integrated Approach to Earth Science Observation scheduling.Proceedings of the 3~(rd) NASA Earth Science Technology Conference(CESTC-03),2003.
    [53]Ari K Jonssop,NASA Research Center.Constraint-Based Planning,8 October 2002.
    [54]Julien Bidot.A General Framework for Scheduling in a Stochastic Environment.Institut National Polytechnique de Toulouse,France,2005.
    [55]Haldun Aytug,Mark A.Lawley,Kenneth McKay,Shantha Mohan,Reha Uzsoy.Executing Production Schedules in the Face of Uncertainties:A Review and Some Future Directions.European Journal of Operational Research 2005,161:86-110.
    [56]Ouelhadj D.,Petrovic S.Survey of Dynamic Scheduling in Manufacturing Systems.Accepted for publication in the Journal of Scheduling.
    [57]钱晓龙,唐立新,刘文新.动态调度的研究方法综述.控制与决策,2001,16(2):141-145.
    [58]B J Cott,S Macchietto.Minimizing the Effects of Batch Process Variability Using Online Scheduling Modification.Computers and Chemical Engineering,1989,13(1):105-113.
    [59]K B Kanakamedala,G V Reklaltis,V Venkatasubramanian.Reactive Schedule Modification in Multipurpose Batch Chemical Plants.Industrial Engineering and Chemical Research,1994,33(1):77-90.
    [60]A.Davenport,C.Beck.A Survey of Techniques for Scheduling with Uncertainty, http://4c.ucc.ie/jcb/publications.html, 2000.
    [61] Angelo Oddi, Nicola Policella. Improving Robustness of Spacecraft Downlink Schedules. IEEE Transactions on Systems, Man, and Cybernetics, 2005.
    [62] V. Jorge leon, S. David Wu, Robert H. Storer. Robustness Measures and Robust Scheduling for Job Shops. IIE Transactions, 26(5):32-43, Sept. 1994.
    [63] M. T. Jensen. Generating Robust and Flexible Job Shop Schedules Using Genetic Algorithms. IEEE Transactions on Evolutionary Computation, Vol. 7, No. 3,pp.275-288, June 2003.
    [64] Graves S C. A Review of Production Scheduling. Operations Research, 1981,29(4):646-675.
    [65] R L Daniels, J E Carrillo. β-Robust Scheduling for Single-Machine Systems with Uncertain Processing Times. IIE Transactions, 1997,29(11):977-995.
    [66] P Kouvelis, R L Daniels, G Vairaktarakis. Robust Scheduling of a Two Machine Flow Shop with Uncertain Processing Times. IIE Transactions, 2000,32(5):421-434.
    [67] V J Leon, S D Wu, H Storer. Robustness Measures and Robust Scheduling for Job Shops. IIE Transactions, 1993,26(5):32-43.
    [68] S D Wu, E Byeon, R H Storer. A Graph-Theoretic Decomposition of Job Shop Scheduling Problems to Achieve Scheduling Robustness. Operations Research 1999,47(1):113-124.
    [69] X X Lin, S L Janak, C A. Floudas. A New Robust Optimization Approach for Scheduling Under Uncertainty: I. Bounded Uncertainty. Computers and Chemical Engineering 2004,28(7): 1069-1085.
    [70] Sanmarti, E., Espuna, A., Puigjaner, L.. Batch Production and Preventive Maintenance Scheduling under Equipment Failure Uncertainty. Computers and Chemical Engineering, 1997,21(10): 1157-1168.
    [71] S J Honkomp, L Mockus, G V Reklaitis. Robust Scheduling with Processing Time Uncertainty. Computers and Chemical Engineering, 1997,21(Suppl):S1055-S1060.
    [72] Mark Drummond, John L. Bresina, Keith Swanson. Just-In-Case Scheduling.Proceedings of the 12~(th) National Conference on Artificial Intelligence (AAAI),pages 1098-1104, Seattle, Washington, United States of America, July 1994.
    [73] T Hamada, K D Glazebrook. A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times. Operations Research, 1993,41(5):924-934.
    [74] J Kamburowski. Stochastically Minimizing the Makespan in Two Machine Flow Shops without Blocking. European Journal of Operations Research, 1999,112(2):304-309.
    [75]J Kamburowski.On Three-Machine Flow Shops with Random Job Processing Time.European Journal of Operations Research,2000,125(3):440-449.
    [76]C A Floudas,X X Lin.Continuous-Time versus Discrete-Time Approaches for Scheduling of Chemical Processes:a Review.Computers and Chemical Engineering,2004,28(11):2109-2129.
    [77]M H Bassett,J F Pekny,G V Reldaitis.Using Detailed Scheduling to Obtain Realistic Operating Policies for a Batch Processing Facility.Industrial and Engineering Chemistry Research,1997,36(5):1717-1726.
    [78]J P.Vin,M G Icrapetritou.Robust Short-Term Scheduling of Multiproduct Batch Plants under Demand Uncertainty.Industrial and Engineering Chemistry Research,2001,40(21):4543-4554.
    [79]A L Guiffrida,R Nagi.Fuzzy Set Theory Applications in Production Management Research:a Literature Survey.Journal of Intclligent Manufacturing,1998,9(1):39-56.
    [80]S Chanas,A Kaspcrski.On two Single Machine Scheduling Problems with Fuzzy Processing Times and Fuzzy Duc Dates.European Journal of Operation Research,2003,147(2):281-296.
    [81]F Chauvct,J M Proth,Y Wardi.Scheduling No-Wait Production with Time Windows and Flexible Processing Times.IEEE Trans.On Robotics and Automation,2001,17(1):60-69.
    [82]A Allahavcrdi.The Two-and M-Machine Flowshop Scheduling Problems with Bicritcria of Makespan and Mean Flowtimc.European Journal of Operation Research,2003,147(2):373-396.
    [83]J Balasubramanian,I E Grossmann.Scheduling Optimization under Uncertainty:an Alternative Approach.Computers and Chemical Engineering,2003,27(4):469-490.
    [84]D Dubois,H Fargicr,P Fortenps.Fuzzy Scheduling:Modeling Flexible Constraints vs.Coping with Incomplete Knowledge.European Journal of Operation Research,2003,147(2):231-252.
    [85]J Li,R S K Kwan.A Fuzzy Genetic Algorithm for Driver Scheduling.European Journal of Operational Research,2003,147(2):334-344.
    [86]唐加福,汪定伟.模糊优化理论与方法的研究综述.控制理论与应用,2000,17(2):159-164.
    [87]顾幸生.不确定条件下的生产调度.华东理工大学学报,2000,26(5):441-446.
    [88]徐震浩.基于免疫优化算法的不确定性间歇生产过程调度问题研究.华东理工大学,博士学位论文,2004.
    [89]B Srinvasan,S Palartki,D Bonvin.Dynamic Optimization of Batch Processes Ⅰ.Characterization of the Nominal Solution.Computer and Chernieal Engineering 2003,27(1):1-26.
    [90]B.Srinivasan,D.Bonvin,E.Visser,S.Palanki.Dynamic Optimization of Batch Processes Ⅱ.Role of Measurements in Handling Uncertainty.Computers and Chemical Engineering,2002,27(1):27-44.
    [91]李建更.某些调度问题区间摄动鲁棒性的研究.自动化学报,2001,27(1):24-30.
    [92]李建更.一类Flow Shop调度问题最优调度区间摄动鲁棒性.控制理论与应用,2004,21(1):25-29.
    [93]Gang Yu,Xiangtong Qi.Disruption Management:Framework,Models and App lications.Singapore:World Scientific Publishing Co.Pte.Ltd.,2004.
    [94]Walton J.Models for the Management of Satellite-based Sensors.Ph.D,Massachusetts Institute of Technology,1993.
    [95]文沃根.高分辨率IKONOS卫星影像及其产品的特性.遥感信息,2001,1:37-38.
    [96]Petrie G.Monitoring Iraq-Imagery Options for Monitoring and Gathering Intelligence.GI News,2003(1):28-33.
    [97]J P.Vin,M G Ierapetritou.Robust Short-Term Scheduling of Multiproduct Batch Plants under Demand Uncertainty.Industrial and Engineering Chemistry Research,2001,40(21):4543-4554.
    [98]M T Jenson.Robust and Flexible Scheduling with Evolutionary Computation.University of Aarhus,PhD Dissertation,2001.
    [99]唐乾玉,吴秋峰,韩曾晋.加工时间扰动时一类排序问题的性能分析.控制与决策,1995,10(6):525-530.
    [100]Selcuk Goren.Robustness and Stability Measures for Scheduling.Bilkent University,Master of Science Dissertation,2001.
    [101]K.S(o|¨)rensen,M.Sevaux.Robust and Flexible Vehicle Routing in Practical Situations.Proceedings of the 5~(th) Triennial Symposium on Transportation Analysis.Le Gosier,Guadeloupe(French West Indies),France,2004.
    [102]E Sanmarti,A Espuna,L Puigjaner.Batch Production and Preventive Maintenance Scheduling under Equipment Failure Uncertainty.Computers and Chemical Engineering,1997,21(10):1157-1168.
    [103]丁然.不确定条件下鲁棒性生产调度的研究.山东大学,博士学位论文.2006.
    [104]Gasch J.,K.A.Campana.Cloud Cover Avoidance in Space-based Remote Sensing Acquisition.In Algorithms for Multispectral,Hyperspectral,and Ultraspectral Imagery IV,Proc.SPIE,2000,4049:336-347.
    [105]J.Branke.Creating Robust Solutions by Means of Evolutionary Algorithms,Parallel Problem Solving From Nature V,Lecture Notes in Computer Science,Vol.1498,Springer,New York,1998,pp.119-128.
    [106]Ehrgott M.,Gandibleux X..An Annotated Bibliography of Multi-objective Combinatorial Optimization.Technical Report 62/2000,Fachbereich Mathematik,Universitat Kalserslautern,Kaiserslantern,Germany,2000.
    [107]Ehrgott M.,Gandibleux X..A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization.OR Spektrum,2000,22:425-460.
    [108]Ehrgott M.,Gandibleux X..Multiple Criteria Optimization:State of the Art Annotated Bibliographic Surveys.Kluwer Academic Publishers,Boston,2002.
    [109]Ehrgott M.,Approximation Algorithms for Combinatorial Multicriteria Optimization Problems.International Transactions in Operational Research,2000,7:5-31.
    [110]Ulungu E.L.,Teghem J.,Multi-objective Combinatorial Optimization Problems:A Survey.Journal of Multi-Criteria Decision Anlaysis,1994,3:83-104.
    [111]Rosenberg R.S.Simulation of Genetic Populations with Biochemical Properties.PhD Thesis,University of Michigan,Ann Harbor,Michigan,1967.
    [112]J.Schafer.Multiple Objective Optimization with Vector Evaluated Genetic Algorithms.In 1~(st) International Conference on Genetic Algorithms,Pittsburgh,1985.
    [113]D.E.Goldberg.Genetic Algorithms in Search,Optimization and Machine Learning.Addison-Wesley,Reading,Massachusets,1989.
    [114]崔逊学.多目标进化算法及其应用.北京:国防工业出版社,2006.6.
    [115]Fonseca C M,Fleming P J.Genetic algorithms for Multiobjective optimization:Formulation,Discussion and Generation.Presented at Proceedings of the 5~(th)International Conference on Genetic Algodthrns,San Marco,California,1993,416-423.
    [116]Eckart Zitzler,Marco Laumanns,Stefan Bleuler.A Tutorial on Evolutionary Multiobjective Optimization.Xavier Gandibleux,Marc Sevaux,Kenneth S(A|¨)orensen,Vincent T'kindt.Metaheuristics for Multiobjective Optimisation.Berlin:Springer.Lecture Notes in Economics and Mathematical Systems Vol.535,2004,3-37.
    [117]Coello C A C.Evolutionary multiobjeetive optimization:a historical view of the field.IEEE computational Intelligence Magazine,2006,1(1):2836.
    [118]Dragan Cvetkovic,Ian C Parmee.Genetic Algorithm Based Multiobjective Optimisation and Conceptual Engineering Design.IEEE Congress on Evolutionary Computation-CEC99.Washington D C USA:1999,volume 1:29-36.
    [119]Garrison W Greenwood,Xiaobo Sharon Hu,Joseph G D Ambrosio.Fitness Functions for Multiple Objective Optimization Problems:Combining Preferences with Pareto Rankings.Richard K Belew,Michael D Vose.Foundations of Genetic Algorithms.Morgan Kaufmann,SanMateo,California:1997.
    [120]Kalyanmoy D eb.An Ideal Evolutionary Multi-Objective Optimization Procedure.IPSJ Transactions on Mathematical Modeling and Its Applications.February 2004,45(SIG 2(TOM 10)):1-11.
    [121]田菁.多无人机协同侦察任务规划问题建模与优化技术研究.国防科技大学博士学位论文,2007.
    [122]Zitzler E.,et al.SPEA2:Improving the Strength Pareto Evolutionary Algorithm for Multiobjeetive Optimization.In Evolutionary Methods for Design,Optimization and control,Barcelona,Spain,2002:19-26.
    [123]Marco Laumanns,Lothar Thiele,Eckart Zitzler,Kalyanmoy Deb.Archiving with Guaranteed Convergence and Diversity in Multi-Objective Optimization.W.B.Langdon,E.Cantu-Paz,K.Mathias,R.Roy,D.Davis,R.Poli,K.Balakrishnan,V.Honavar,G.Rudolph,J.Wegener,L.Bull,M.A.Potter,A.C.Schultz,J.F.Miller,E.Burke,N.Jonoska,(Editors) Proceedings of the Genetic and Evolutionary Computation Conference(GECCO'2002).San Francisco,California:Morgan Kaufrnann Publishers,2002,439-447.
    [124]Joshua Knowles,David Come.Properties of an Adaptive Archiving Algorithm for Storing Nondominated Vectors.IEEE Transactions on Evolutionary Computation.April 2003,7(2):100-116.
    [125]Dragan Cvetkovic,Ian C Parmee.Use of Preferences for GA-based Multi-Objective Optimization.BanzhafW,Daida J,et al.GECCO-99:Proceedings of the Genetic and Evolutionary Computation Conference.Orlando,Florida,USA Morgan Kaufmann:1999.1504-1509.
    [126]I.C.Parmee,D.Cvetkovic,A.H.Watson,C.R.Bonham.Multi-Objective Satisfaction within an Interactive Evolutionary Design Environment.Evolutionary Computation,vol.8,no.2,pp.197-222,2000.
    [127]关志华.面向多目标优化问题的遗传算法的理论及应用研究.天津大学博士学位论文.2002.
    [128]Dragan Cvetkovic,Ian C Parmee.Preferences and Their Application in Evolutionary Multiobjective Optimization.IEEE Transactions on Evolutionary Computation,vol.6,NO.1,February 2002.
    [129]S.Warshall.A Theorem on Boolean Matrices,J.ACM,vol.9,no.1,pp.11-12,1962.
    [130]玄光男,程润伟著,于音杰,周根贵译,遗传算法与工程优化.北京:清华大学出版社,2004.
    [131]Kalyanmoy Deb.Multi-Objective Evolutionary Algorithms:Introducing Bias among Pareto-Optimal Solutions.KanGAL report 99002,Indian Institute of Technology,Kanpur,India,1999.
    [132]Marco Laumarms,Eckart Zitzler,Lothar Thiele.On the Effects of Archiving,Elitism,and Density Based Selection in Evolutionary Multi-objective Optimization.Eckart Zitzler,Kalyanmoy Deb,Lothar Thiele,Carlos A.Coello Coello,David Come,(Editors) First International Conference on Evolutionary Multi-Criterion Optimization,Springer-Verlag.Lecture Notes in Computer Science No.1993,2001.181-196.
    [133]Marco Laumarms,Lothar Thiele,Kalyanmoy Deb,Eekart Zitzler.On the Convergence and Diversity-Preservation Properties of Multi-Objective Evolutionary Algorithms.Tech.Rep.108,Computer Engineering and Networks Laboratory(TIK),Swiss Federal Institute of Technology(ETH) Zurich,Gloriastrasse 35,CH-8092 Zurich,Switzerland,May 2001.
    [134]Rudolph G.,Agapie A..Convergence Properties of Some Multi-Objective Evolutionary Algorithms.Proceedings of the 2000 Conference on Evolutionary Computation,New Jersey,IEEE Press,2000:1010-1016.
    [135]Zitzler E.,Thiele L..Multiobjective Optimization Using Evolutionary Algorithms -A Comparative Case Study.Proceedings of Parallel Problem Solving from Nature V(PPSN-V),Springer,2000,292-301.
    [136]玄光男,程润伟著,汪定伟,唐加福,黄敏译.遗传算法与工程设计.北京:科学出版社,2000.
    [137]王军民,李菊芳,谭跃进.不确定条件下卫星鲁棒性调度问题研究.系统工程2007,25(12):94-101.
    [138]王元,方开泰.关于均匀分布与试验设计(数论方法).科学通报.1981,2626:65-70.
    [139]方开泰,马兴长.正交与均匀试验设计.科学出版社,2001.
    [140]任露泉.试验优化设计与分析(第二版).高等教育出版社出版,2001.
    [141]Seguin R.,Potvin J.Y.,Gendreau M.,Grainic T.G.,Marcotte P..Real-Time Decision Problems:an Operational Research Perspective.Journal of the Operational Research Society.1997,48:162-174.
    [142]Savelsbergh Martin,Marc Sol.DRIVE:Dynamic Routing of Independent Vehicles.Operations Research.1991,46(4):474-490.
    [143]G.Rabideau,R.Knight,S.Chien,A.Fukanaga,and A.Govindjee.Iterative planning for spacecraft operations using the aspen system.In Proc.5~(th) Int.Sym.on AI,Robotics and Automation for Space,1999.
    [144]Kramer L.A.,Smith S.F.Maximizing flexibility:A retraction heuristic for oversubscribed scheduling problems.In Proc.18~(th) International Joint Conf.on AI,2003.
    [145]Analytical Graphics Inc,Satellite Tool Kit 5.0,2003.
    [146]Greas For STK User's Manual and Tutorial,March 2002.
    [147]刁淑娟.地球观测卫星的过去、现在和未来.国土资源遥感,2001,3:61-640.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.