Simulated annealing algorithm for EOS scheduling problem with task merging

Simulated annealing algorithm for EOS scheduling problem with task merging

The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annea...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gao Peng, Li Wen, Yao Feng, Bai Baocun, Yang Jing
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Cameras
Earth Observing System
Heuristic algorithms
Merging
Orbits
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 552
container_issue
container_start_page 547
container_title
container_volume
creator Gao Peng
Li Wen
Yao Feng
Bai Baocun
Yang Jing
description The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annealing algorithm (VFSA) is developed to solve the problem. The VFSA algorithm employs compose and decompose neighborhoods for dynamic task merging. To avoid the local optimum solutions and improve the exploration abilities, re-annealing and three diversification strategies, perturb, rearrange and restart are defined in VFSA. Experiments results show the effectiveness of our approach.
doi_str_mv 10.1109/ICMIC.2011.5973764
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5973764</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5973764</ieee_id><sourcerecordid>5973764</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-5be0e12beb6b343c62a392e973dc2b8f52fa632ba1fa35138254a23b585e70283</originalsourceid><addsrcrecordid>eNotj7tOw0AURJcCCRT8A9DsD9jsw_sqkRXAKChF0kd37WtnwY9o7Qjx91gk1RRndDRDyCNnGefMPZfFZ1lkgnGeKWek0fkNSZyxzCltuDLM3pFkmr4YY9xpx5S8Jx-70J87mLGmMAwIXRhaCl07xjAfe9qMka63OzpVR6zP__AUR99hT3-WAp1h-qY9xnYhD-S2gW7C5Jorsn9d74v3dLN9K4uXTRocm1PlkSEXHr32MpeVFiCdwGVvXQlvGyUa0FJ44A1IxaUVKgchvbIKDRNWrsjTRRsQ8XCKoYf4e7geln8ctUv3</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Simulated annealing algorithm for EOS scheduling problem with task merging</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Gao Peng ; Li Wen ; Yao Feng ; Bai Baocun ; Yang Jing</creator><creatorcontrib>Gao Peng ; Li Wen ; Yao Feng ; Bai Baocun ; Yang Jing</creatorcontrib><description>The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annealing algorithm (VFSA) is developed to solve the problem. The VFSA algorithm employs compose and decompose neighborhoods for dynamic task merging. To avoid the local optimum solutions and improve the exploration abilities, re-annealing and three diversification strategies, perturb, rearrange and restart are defined in VFSA. Experiments results show the effectiveness of our approach.</description><identifier>EISBN: 9780956715708</identifier><identifier>EISBN: 0956715702</identifier><identifier>DOI: 10.1109/ICMIC.2011.5973764</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Cameras ; Earth Observing System ; Heuristic algorithms ; Merging ; Orbits</subject><ispartof>Proceedings of 2011 International Conference on Modelling, Identification and Control, 2011, p.547-552</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5973764$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5973764$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gao Peng</creatorcontrib><creatorcontrib>Li Wen</creatorcontrib><creatorcontrib>Yao Feng</creatorcontrib><creatorcontrib>Bai Baocun</creatorcontrib><creatorcontrib>Yang Jing</creatorcontrib><title>Simulated annealing algorithm for EOS scheduling problem with task merging</title><title>Proceedings of 2011 International Conference on Modelling, Identification and Control</title><addtitle>ICMIC</addtitle><description>The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annealing algorithm (VFSA) is developed to solve the problem. The VFSA algorithm employs compose and decompose neighborhoods for dynamic task merging. To avoid the local optimum solutions and improve the exploration abilities, re-annealing and three diversification strategies, perturb, rearrange and restart are defined in VFSA. Experiments results show the effectiveness of our approach.</description><subject>Algorithm design and analysis</subject><subject>Cameras</subject><subject>Earth Observing System</subject><subject>Heuristic algorithms</subject><subject>Merging</subject><subject>Orbits</subject><isbn>9780956715708</isbn><isbn>0956715702</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj7tOw0AURJcCCRT8A9DsD9jsw_sqkRXAKChF0kd37WtnwY9o7Qjx91gk1RRndDRDyCNnGefMPZfFZ1lkgnGeKWek0fkNSZyxzCltuDLM3pFkmr4YY9xpx5S8Jx-70J87mLGmMAwIXRhaCl07xjAfe9qMka63OzpVR6zP__AUR99hT3-WAp1h-qY9xnYhD-S2gW7C5Jorsn9d74v3dLN9K4uXTRocm1PlkSEXHr32MpeVFiCdwGVvXQlvGyUa0FJ44A1IxaUVKgchvbIKDRNWrsjTRRsQ8XCKoYf4e7geln8ctUv3</recordid><startdate>201106</startdate><enddate>201106</enddate><creator>Gao Peng</creator><creator>Li Wen</creator><creator>Yao Feng</creator><creator>Bai Baocun</creator><creator>Yang Jing</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201106</creationdate><title>Simulated annealing algorithm for EOS scheduling problem with task merging</title><author>Gao Peng ; Li Wen ; Yao Feng ; Bai Baocun ; Yang Jing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-5be0e12beb6b343c62a392e973dc2b8f52fa632ba1fa35138254a23b585e70283</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithm design and analysis</topic><topic>Cameras</topic><topic>Earth Observing System</topic><topic>Heuristic algorithms</topic><topic>Merging</topic><topic>Orbits</topic><toplevel>online_resources</toplevel><creatorcontrib>Gao Peng</creatorcontrib><creatorcontrib>Li Wen</creatorcontrib><creatorcontrib>Yao Feng</creatorcontrib><creatorcontrib>Bai Baocun</creatorcontrib><creatorcontrib>Yang Jing</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gao Peng</au><au>Li Wen</au><au>Yao Feng</au><au>Bai Baocun</au><au>Yang Jing</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Simulated annealing algorithm for EOS scheduling problem with task merging</atitle><btitle>Proceedings of 2011 International Conference on Modelling, Identification and Control</btitle><stitle>ICMIC</stitle><date>2011-06</date><risdate>2011</risdate><spage>547</spage><epage>552</epage><pages>547-552</pages><eisbn>9780956715708</eisbn><eisbn>0956715702</eisbn><abstract>The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annealing algorithm (VFSA) is developed to solve the problem. The VFSA algorithm employs compose and decompose neighborhoods for dynamic task merging. To avoid the local optimum solutions and improve the exploration abilities, re-annealing and three diversification strategies, perturb, rearrange and restart are defined in VFSA. Experiments results show the effectiveness of our approach.</abstract><pub>IEEE</pub><doi>10.1109/ICMIC.2011.5973764</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISBN: 9780956715708
ispartof Proceedings of 2011 International Conference on Modelling, Identification and Control, 2011, p.547-552
issn
language eng
recordid cdi_ieee_primary_5973764
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Cameras
Earth Observing System
Heuristic algorithms
Merging
Orbits
title Simulated annealing algorithm for EOS scheduling problem with task merging
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T06%3A48%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Simulated%20annealing%20algorithm%20for%20EOS%20scheduling%20problem%20with%20task%20merging&rft.btitle=Proceedings%20of%202011%20International%20Conference%20on%20Modelling,%20Identification%20and%20Control&rft.au=Gao%20Peng&rft.date=2011-06&rft.spage=547&rft.epage=552&rft.pages=547-552&rft_id=info:doi/10.1109/ICMIC.2011.5973764&rft_dat=%3Cieee_6IE%3E5973764%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780956715708&rft.eisbn_list=0956715702&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5973764&rfr_iscdi=true