{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T07:08:25Z","timestamp":1782889705447,"version":"3.54.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10489-010-0234-3","type":"journal-article","created":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T19:49:46Z","timestamp":1275680986000},"page":"436-444","source":"Crossref","is-referenced-by-count":25,"title":["Guidance-solution based ant colony optimization for satellite control resource scheduling problem"],"prefix":"10.1007","volume":"35","author":[{"given":"Na","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zu-ren","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang-jun","family":"Ke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"issue":"6","key":"234_CR1","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1109\/21.257756","volume":"23","author":"M Zweben","year":"1993","unstructured":"Zweben M, Davis E, Daun B, Deale MJ (1993) Scheduling and rescheduling with iterative repair. IEEE Trans Syst Man Cybern 23(6):1588\u20131596","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"234_CR2","volume-title":"The deep space network scheduling problem","author":"BJ Clement","year":"2005","unstructured":"Clement BJ, Johnston MD (2005) The deep space network scheduling problem. AAAI Press, Pittsburgh, pp\u00a01514\u20131520"},{"issue":"1","key":"234_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/B:JOSH.0000013053.32600.3c","volume":"7","author":"L Barbulescu","year":"2004","unstructured":"Barbulescu L et al (2004) Scheduling space-ground communications for the Air Force Satellite Control Network. J Sched 7(1): 7\u201334","journal-title":"J Sched"},{"key":"234_CR4","unstructured":"Barbulescu L, Whitley LD, Howe AE (2004) Leap before you look: An effective strategy in an oversubscribed scheduling problem. In: Proceedings of the 19th national conference on artificial intelligence, pp\u00a0143\u2013148"},{"key":"234_CR5","unstructured":"Kramer L, Barbulescu L, Smith S (2007) Understanding performance tradeoffs algorithms for solving oversubscribed scheduling. In: Proceedings of the 22nd national conference on artificial intelligence, pp\u00a01019\u20131024"},{"key":"234_CR6","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1613\/jair.177","volume":"4","author":"J Gratch","year":"1996","unstructured":"Gratch J, Chien S (1996) Adaptive problem-solving for large-scale scheduling problem: A case study. J Artif Intell Res 4:365\u2013396","journal-title":"J Artif Intell Res"},{"key":"234_CR7","doi-asserted-by":"crossref","unstructured":"Zhang Y, Yang F, Huang Y (2007) A novel selection-learning algorithm for multi-satellite scheduling problems. In: IEEE congress on evolutionary computation, pp\u00a01318\u20131324","DOI":"10.1109\/CEC.2007.4424623"},{"key":"234_CR8","doi-asserted-by":"crossref","unstructured":"Zhang N, Feng Z (2007) Cooperative ant colony optimization for multisatellite resource scheduling problem. In: IEEE congress on evolutionay computation, pp\u00a02822\u20132828","DOI":"10.1109\/CEC.2007.4424829"},{"key":"234_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53\u201366","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"234_CR10","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","volume":"54","author":"L Ke","year":"2008","unstructured":"Ke L, Archetti C, Feng Z (2008) Ant can solve the team orienteering problem. Comput Ind Eng 54(3):648\u2013665","journal-title":"Comput Ind Eng"},{"issue":"9","key":"234_CR11","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX-MIN ant system. Future Gener Comput Syst 16(9):889\u2013914","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"234_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern, Part B 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern, Part B"},{"issue":"4","key":"234_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D Merkle","year":"2002","unstructured":"Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6(4):333\u2013346","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"234_CR14","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/TCAD.2006.885829","volume":"26","author":"G Wang","year":"2007","unstructured":"Wang G, Gong W, Derenzi B, Kastner R (2007) Ant colony optimizations for resource- and timing-constrained operation scheduling. IEEE Trans Comput-aided Des Integr Circuits Syst 26(6):1010\u20131029","journal-title":"IEEE Trans Comput-aided Des Integr Circuits Syst"},{"key":"234_CR15","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.asoc.2005.01.001","volume":"6","author":"L Andrew","year":"2006","unstructured":"Andrew L, Jing L, Brian R, Fei X (2006) Ant colony optimization with hill climbing for the bandwidth minimization problem. Appl Soft Comput 6:180\u2013188","journal-title":"Appl Soft Comput"},{"key":"234_CR16","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C Blum","year":"2004","unstructured":"Blum C, Dorigo M (2004) The hyper-cube framework for ant colony optimization. IEEE Trans Syst Man Cybern Part B 34:1161\u20131172","journal-title":"IEEE Trans Syst Man Cybern Part B"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0234-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-010-0234-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0234-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T21:10:49Z","timestamp":1559164249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-010-0234-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["234"],"URL":"https:\/\/doi.org\/10.1007\/s10489-010-0234-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,5]]}}}