multitasknvehicleexplorationproblemcomplexityandalgorithm
文献类型：期刊论文
| 作者 | Xu Yangyang; Cui Jinchuan
|
| 刊名 | journalofsystemsscienceandcomplexity
 |
| 出版日期 | 2012 |
| 卷号 | 25期号:6页码:1080 |
| ISSN号 | 1009-6124 |
| 英文摘要 | This paper extends the single-task n-Vehicle Exploration Problem to Multitask n-Vehicle Exploration Problem (MTNVEP), by combining n-Vehicle Exploration Problem with Job Scheduling Problem. At first, the authors prove that MTNVEP is NP-hard for fixed number of tasks, and it is strongly NP-hard for general number of tasks. Then they propose an improved accurate algorithm with computing time O(n3 (n) ), which is better than O(n!) as n becomes sufficiently large. Moreover, four heuristic algorithms are proposed. Effectiveness of the heuristic algorithms is illustrated by experiments at last. |
| 资助项目 | [Daqing Oilfield Company Project of PetroCHINA] ; [Key Laboratory of Management, Decision and Information Systems, Chinese Academy of Sciences] |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/39774]  |
| 专题 | 应用数学研究所 |
| 作者单位 | 中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Xu Yangyang,Cui Jinchuan. multitasknvehicleexplorationproblemcomplexityandalgorithm[J]. journalofsystemsscienceandcomplexity,2012,25(6):1080. |
| APA | Xu Yangyang,&Cui Jinchuan.(2012).multitasknvehicleexplorationproblemcomplexityandalgorithm.journalofsystemsscienceandcomplexity,25(6),1080. |
| MLA | Xu Yangyang,et al."multitasknvehicleexplorationproblemcomplexityandalgorithm".journalofsystemsscienceandcomplexity 25.6(2012):1080. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。