multitasknvehicleexplorationproblemcomplexityandalgorithm

CSpace > 应用数学研究所

	multitasknvehicleexplorationproblemcomplexityandalgorithm
	Xu Yangyang; Cui Jinchuan
	2012
发表期刊	journalofsystemsscienceandcomplexity
ISSN	1009-6124
卷号	25 期号:6 页码:1080
摘要	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]
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/39775
专题	应用数学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 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.