A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite

被引:155
作者
Tangpattanakul, Panwadee [1 ]
Jozefowiez, Nicolas [2 ,3 ]
Lopez, Pierre [2 ,4 ]
机构
[1] Geoinformat & Space Technol Dev Agcy GISTDA, Bangkok 10210, Thailand
[2] CNRS, LAAS, F-31400 Toulouse, France
[3] Univ Toulouse, INSA, LAAS, F-31400 Toulouse, France
[4] Univ Toulouse, LAAS, F-31400 Toulouse, France
关键词
Multi-objective optimization; Earth observing satellite; Scheduling; Local search; GENETIC ALGORITHM; SELECTION;
D O I
10.1016/j.ejor.2015.03.011
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents an indicator-based multi-objective local search (IBMOLS) to solve a multi-objective optimization problem. The problem concerns the selection and scheduling of observations for an agile Earth observing satellite. The mission of an Earth observing satellite is to obtain photographs of the Earth surface to satisfy user requirements. Requests from several users have to be managed before transmitting an order, which is a sequence of selected acquisitions, to the satellite. The obtained sequence has to optimize two objectives under operation constraints. The objectives are to maximize the total profit of the selected acquisitions and simultaneously to ensure the fairness of resource sharing by minimizing the maximum profit difference between users. Experiments are conducted on realistic instances. Hypervolumes of the approximate Pareto fronts are computed and the results from IBMOLS are compared with the results from the biased random-key genetic algorithm (BRKGA). (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:542 / 554
页数:13
相关论文
共 32 条
[11]   A unified tabu search heuristic for vehicle routing problems with time windows [J].
Cordeau, JF ;
Laporte, G ;
Mercier, A .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (08) :928-936
[12]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[13]   Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite [J].
Gabrel, V ;
Vanderpooten, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (03) :533-542
[14]   A hybrid genetic algorithm for assembly line balancing [J].
Gonçalves, JF ;
de Almeida, JR .
JOURNAL OF HEURISTICS, 2002, 8 (06) :629-642
[15]   Biased random-key genetic algorithms for combinatorial optimization [J].
Goncalves, Jose Fernando ;
Resende, Mauricio G. C. .
JOURNAL OF HEURISTICS, 2011, 17 (05) :487-525
[16]   Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite [J].
Habet, Djamal ;
Vasquez, Michel ;
Vimont, Yannick .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2010, 47 (02) :307-333
[17]  
Knowles J, 2002, IEEE C EVOL COMPUTAT, P711, DOI 10.1109/CEC.2002.1007013
[18]  
Kuipers E. J., 2003, B SOC FRANCAISE RECH, P7
[19]   Selecting and scheduling observations of agile satellites [J].
Lemaître, M ;
Verfaillie, G ;
Jouhaud, F ;
Lachiver, JM ;
Bataille, N .
AEROSPACE SCIENCE AND TECHNOLOGY, 2002, 6 (05) :367-381
[20]  
Lemaître M, 1999, IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, P206