乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T11:57:12Z","timestamp":1726919832245},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41571403","61472375"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"13th Five-year Pre-research Project of Civil Aerospace in China"},{"name":"Joint Funds of Equipment Pre-Research and Ministry of Education of China","award":["6141A02022320"]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["CUG2017G01","CUG160207"],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1016\/j.asoc.2018.04.021","type":"journal-article","created":{"date-parts":[[2018,4,22]],"date-time":"2018-04-22T22:10:24Z","timestamp":1524435024000},"page":"177-191","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":48,"special_numbering":"C","title":["Priority-based and conflict-avoidance heuristics for multi-satellite scheduling"],"prefix":"10.1016","volume":"69","author":[{"given":"Xiaoyu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1787-3794","authenticated-orcid":false,"given":"Guangming","family":"Dai","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6736-1711","authenticated-orcid":false,"given":"Maocai","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2018.04.021_bib0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2013\/792484","article-title":"A dynamic scheduling method of earth-observing satellites by employing rolling horizon strategy","volume":"2013","author":"Qiu","year":"2013","journal-title":"Sci. World J."},{"key":"10.1016\/j.asoc.2018.04.021_bib0010","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cor.2017.04.006","article-title":"An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time","volume":"86","author":"Liu","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.021_bib0015","first-page":"517","article-title":"Efficient satellite scheduling based on improved vector evaluated genetic algorithm","volume":"7","author":"Mao","year":"2012","journal-title":"J. Netw."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.021_bib0020","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2005.12.026","article-title":"A heuristic for the multi-satellite, multi-orbit and multi-user management of earth observation satellites","volume":"177","author":"Bianchessi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.021_bib0025","doi-asserted-by":"crossref","first-page":"10","DOI":"10.5815\/ijigsp.2010.01.02","article-title":"Earth observation satellites scheduling based on decomposition optimization algorithm","volume":"2","author":"Yao","year":"2010","journal-title":"Int. J. Image Graph. Signal Process."},{"key":"10.1016\/j.asoc.2018.04.021_bib0030","first-page":"1","article-title":"Imaging-duration embedded dynamic scheduling of earth observation satellites for emergent events","volume":"2015","author":"Niu","year":"2015","journal-title":"Math. Probl. Eng."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.021_bib0035","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","article-title":"Earth observation satellite management","volume":"4","author":"Bensana","year":"1999","journal-title":"Constraints"},{"issue":"2","key":"10.1016\/j.asoc.2018.04.021_bib0040","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","article-title":"A logic-constrained knapsack formulation and a tabu search algorithm for the daily photograph scheduling of an earth observation satellite","volume":"20","author":"Vasquez","year":"2001","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.021_bib0045","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cie.2009.11.012","article-title":"A genetic algorithm approach for solving the daily photograph selection problem of the spot5 satellite","volume":"58","author":"Mansour","year":"2010","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.021_bib0050","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10878-006-7912-4","article-title":"Strengthened 0-1 linear formulation for the daily satellite mission planning","volume":"11","author":"Gabrel","year":"2006","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.asoc.2018.04.021_bib0055","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10878-009-9215-z","article-title":"Strong formulation for the spot 5 daily photograph scheduling problem","volume":"20","author":"Ribeiro","year":"2010","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.021_bib0060","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0377-2217(01)00188-6","article-title":"Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite","volume":"139","author":"Gabrel","year":"2002","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.021_bib0065","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1021950608048","article-title":"Upper bounds for the spot 5 daily photograph scheduling problem","volume":"7","author":"Vasquez","year":"2003","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.asoc.2018.04.021_bib0070","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/mnsc.46.1.148.15134","article-title":"Three scheduling algorithms applied to the earth observing systems domain","volume":"46","author":"Wolfe","year":"2000","journal-title":"Manage. Sci."},{"issue":"8","key":"10.1016\/j.asoc.2018.04.021_bib0075","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1057\/palgrave.jors.2601926","article-title":"Maximizing the value of an earth observation satellite orbit","volume":"56","author":"Cordeau","year":"2005","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"10.1016\/j.asoc.2018.04.021_bib0080","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1108\/03684921011063538","article-title":"Satellite mission scheduling based on genetic algorithm","volume":"39","author":"Sun","year":"2010","journal-title":"Kybernetes"},{"key":"10.1016\/j.asoc.2018.04.021_bib0085","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2014.11.004","article-title":"Optimization-based scheduling for the single-satellite, multi-ground station communication problem","volume":"57","author":"Spangelo","year":"2015","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.021_bib0090","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(94)90385-9","article-title":"Maximizing the value of a space mission","volume":"78","author":"Hall","year":"1994","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.021_bib0095","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/B:JOSH.0000013053.32600.3c","article-title":"Scheduling space-ground communications for the air force satellite control network","volume":"7","author":"Barbulescu","year":"2004","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.021_bib0100","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TSMCA.2005.843380","article-title":"Daily imaging scheduling of an earth observation satellite","volume":"35","author":"Lin","year":"2005","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.021_bib0105","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10589-008-9220-7","article-title":"Bounding the optimum for the problem of scheduling the photographs of an agile earth observing satellite","volume":"47","author":"Habet","year":"2010","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.021_bib0110","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1002\/nav.20118","article-title":"A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities","volume":"53","author":"Bard","year":"2006","journal-title":"Naval Res. Logist."},{"issue":"7","key":"10.1016\/j.asoc.2018.04.021_bib0115","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ast.2008.01.001","article-title":"Planning and scheduling algorithms for the cosmo-skymed constellation","volume":"12","author":"Bianchessi","year":"2008","journal-title":"Aerosp. Sci. Technol."},{"key":"10.1016\/j.asoc.2018.04.021_bib0120","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.4028\/www.scientific.net\/AMR.791-793.1341","article-title":"An ant colony algorithm for remote satellite and ground integration scheduling problem in parallel environment","author":"Gao","year":"2013","journal-title":"Adv. Mater. Res."},{"issue":"5","key":"10.1016\/j.asoc.2018.04.021_bib0125","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/JSEE.2012.00089","article-title":"Multi-satellite observation integrated scheduling method oriented to emergency tasks and common tasks","volume":"23","author":"Wu","year":"2012","journal-title":"J. Syst. Eng. Electron."},{"issue":"7","key":"10.1016\/j.asoc.2018.04.021_bib0130","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1016\/j.cor.2013.02.009","article-title":"A two-phase scheduling method with the consideration of task clustering for earth observing satellites","volume":"40","author":"Wu","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2018.04.021_bib0135","doi-asserted-by":"crossref","first-page":"2816","DOI":"10.1016\/j.eswa.2013.10.014","article-title":"Multi-satellite control resource scheduling based on ant colony optimization","volume":"41","author":"Zhang","year":"2014","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.021_bib0140","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.ejor.2015.11.031","article-title":"Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project","volume":"251","author":"Xiong","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2018.04.021_bib0145","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.asoc.2013.11.012","article-title":"A novel ant colony optimization based single path hierarchical classification algorithm for predicting gene ontology","volume":"16","author":"Khan","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2018.04.021_bib0150","first-page":"687","article-title":"Multi satellites scheduling algorithm based on task merging mechanism","volume":"230","author":"Liu","year":"2014","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2018.04.021_bib0155","first-page":"143","article-title":"Clustering of imaging reconnaissance tasks based on clique partition","volume":"19","author":"Xu","year":"2010","journal-title":"Oper. Res. Manage. Sci."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.021_bib0160","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.cie.2011.02.015","article-title":"A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation","volume":"61","author":"Wang","year":"2011","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.021_bib0165","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.ast.2013.04.001","article-title":"Using an effective tabu search in interactive resources scheduling problem for LEO satellites missions","volume":"29","author":"Sarkheyli","year":"2013","journal-title":"Aerosp. Sci. Technol."},{"issue":"4","key":"10.1016\/j.asoc.2018.04.021_bib0170","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1155\/2012\/717658","article-title":"Genetic algorithms for satellite scheduling problems","volume":"8","author":"Xhafa","year":"2012","journal-title":"Mobile Inf. Syst."},{"issue":"7","key":"10.1016\/j.asoc.2018.04.021_bib0175","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.jcss.2013.01.023","article-title":"Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem","volume":"79","author":"Xhafa","year":"2013","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.021_bib0180","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TEVC.2005.857695","article-title":"Evolutionary algorithms\u202f+\u202fdomain knowledge\u202f=\u202freal-world evolutionary computation","volume":"10","author":"Bonissone","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2018.04.021_bib0185","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ins.2015.06.016","article-title":"A metaheuristic algorithm to solve satellite broadcast scheduling problem","volume":"322","author":"Salman","year":"2015","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.asoc.2018.04.021_bib0190","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.021_bib0195","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10589-014-9701-9","article-title":"Differential evolution using a superior\u2013inferior crossover scheme","volume":"61","author":"Xu","year":"2015","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.021_bib0200","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.jcss.2014.06.016","article-title":"Towards dynamic real-time scheduling for multiple earth observation satellites","volume":"81","author":"Wang","year":"2015","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.asoc.2018.04.021_bib0205","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2017.03.012","article-title":"High-performance technique for satellite range scheduling","volume":"85","author":"Luo","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2018.04.021_bib0210","first-page":"1","article-title":"Robust satellite scheduling approach for dynamic emergency tasks","volume":"2015","author":"Zhai","year":"2015","journal-title":"Math. Probl. Eng."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494618302126?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494618302126?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T05:34:46Z","timestamp":1657776886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494618302126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":42,"alternative-id":["S1568494618302126"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2018.04.021","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Priority-based and conflict-avoidance heuristics for multi-satellite scheduling","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2018.04.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}