{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:29:28Z","timestamp":1771518568860,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811912559","type":"print"},{"value":"9789811912566","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-1256-6_4","type":"book-chapter","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T15:02:59Z","timestamp":1648047779000},"page":"43-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving Satellite Range Scheduling Problem with Learning-Based Artificial Bee Colony Algorithm"],"prefix":"10.1007","author":[{"given":"Yanjie","family":"Song","sequence":"first","affiliation":[]},{"given":"Luona","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Lining","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Zhongshan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yingwu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11590-014-0744-8","volume":"9","author":"AJ Vazquez","year":"2014","unstructured":"Vazquez, A.J., Erwin, R.S.: On the tractability of satellite range scheduling. Optim. Lett. 9(2), 311\u2013327 (2014). https:\/\/doi.org\/10.1007\/s11590-014-0744-8","journal-title":"Optim. Lett."},{"key":"4_CR2","unstructured":"Gooley, T.D.: Automating the satellite range scheduling process, Master\u2019s Thesis Air Force Institute of Technology (1993)"},{"key":"4_CR3","unstructured":"He, L., Weerdt, M.D., Smith, N.Y.: Tabu-based large neighbourhood search for time\/sequence-dependent scheduling problems with time windows. In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019) (2019)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"100576","DOI":"10.1016\/j.swevo.2019.100576","volume":"50","author":"YH Du","year":"2019","unstructured":"Du, Y.H., Xing, L.N., et al.: MOEA based memetic algorithms for multi-objective satellite range scheduling problem. Swarm Evol. Comput. 50, 100576 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"12","key":"4_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1613\/jair.2038","volume":"27","author":"L Barbulescu","year":"2006","unstructured":"Barbulescu, L., Howe, A.E., Roberts, M., Whitley, L.D.: Understanding algorithm performance on an oversubscribed scheduling application. J. Artif. Intell. Res. 27(12), 577\u2013615 (2006)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"4_CR6","first-page":"120","volume":"192","author":"A Bahriye","year":"2012","unstructured":"Bahriye, A., Dervis, K.: A modified artificial bee colony algorithm for real-parameter optimization. Inf. Sci. 192(1), 120\u2013142 (2012)","journal-title":"Inf. Sci."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"112921","DOI":"10.1016\/j.eswa.2019.112921","volume":"142","author":"XY Song","year":"2020","unstructured":"Song, X.Y., Zhao, M., Xing, S.Y.: A multi-strategy fusion artificial bee colony algorithm with small population. Expert Syst. Appl. 142, 112921 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1109\/TII.2018.2857198","volume":"15","author":"H Gao","year":"2019","unstructured":"Gao, H., Shi, Y., Pun, C.M., Kwong, S.: An improved artificial bee colony algorithm with its application. IEEE Trans. Ind. Inf. 15(4), 1853\u20131865 (2019)","journal-title":"IEEE Trans. Ind. Inf."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ins.2014.12.043","volume":"300","author":"S Mustafa","year":"2015","unstructured":"Mustafa, S., Kiran, H., et al.: Artificial bee colony algorithm with variable search strategy for continuous optimization. Inf. Sci. 300, 140\u2013157 (2015)","journal-title":"Inf. Sci."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.asoc.2016.07.039","volume":"49","author":"D Karaboga","year":"2016","unstructured":"Karaboga, D., Kaya, E.: An adaptive and hybrid artificial bee colony algorithm (aabc) for ANFIS training. Appl. Soft Comput. 49, 423\u2013436 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"9\u201310","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1016\/j.mcm.2005.12.004","volume":"43","author":"L Barbulescu","year":"2006","unstructured":"Barbulescu, L., Howe, A., Whitley, D.: Afscn scheduling: how the problem and solution have evolved. Math. Comput. Model. 43(9\u201310), 1023\u20131037 (2006)","journal-title":"Math. Comput. Model."},{"issue":"7","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1016\/j.jcss.2013.01.023","volume":"79","author":"F Xhafa","year":"2013","unstructured":"Xhafa, F., Herrero, X., Barolli, A., Barolli, L., Takizawa, M.: Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem. J. Comput. Syst. Sci. 79(7), 1086\u20131100 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Xhafa, F., Herrero, X., Barolli, A., Takizawa, M.: A simulated annealing algorithm for ground station scheduling problem. In: International Conference on Network-based Information Systems. IEEE Computer Society (2013)","DOI":"10.1109\/NBiS.2013.37"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Xhafa, F, Herrero, X, Barolli, A., Takizawa, M.: A tabu search algorithm for ground station scheduling problem. In: IEEE International Conference on Advanced Information Networking & Applications. IEEE (2014)","DOI":"10.1109\/AINA.2014.151"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2017.03.012","volume":"85","author":"K Luo","year":"2017","unstructured":"Luo, K., Wang, H., Li, Y., Li, Q.: High-performance technique for satellite range scheduling. Comput. Oper. Res. 85, 12\u201321 (2017)","journal-title":"Comput. Oper. Res."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"106830","DOI":"10.1016\/j.cie.2020.106830","volume":"150","author":"YJ Song","year":"2020","unstructured":"Song, Y.J., Xing, L.N., et al.: A knowledge-based evolutionary algorithm for relay satellite system mission scheduling problem. Comput. Ind. Eng. 150, 106830 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-030-55130-8_34","volume-title":"Knowledge Science, Engineering and Management","author":"Y Chen","year":"2020","unstructured":"Chen, Y., Song, Y., Du, Y., Wang, M., Zong, R., Gong, C.: A knowledge-based scheduling method for multi-satellite range system. In: Li, G., Shen, H.T., Yuan, Y., Wang, X., Liu, H., Zhao, X. (eds.) KSEM 2020. LNCS (LNAI), vol. 12274, pp. 388\u2013396. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55130-8_34"},{"key":"4_CR18","first-page":"1","volume":"2018","author":"B Song","year":"2018","unstructured":"Song, B., Chen, Y., Yao, F., et al.: A hybrid genetic algorithm for satellite image downlink scheduling problem. Disc. Dyn. Nat. Soc. 2018, 1\u201311 (2018)","journal-title":"Disc. Dyn. Nat. Soc."}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-1256-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T15:03:46Z","timestamp":1648047826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-1256-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811912559","9789811912566"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-1256-6_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiyuan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.bicta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}