Multi-vehicle Coordination and Flexible Scheduling based on Simulated Annealing Algorithm
In this paper,we consider a multi-vehicle coordination problem(MVCP),in which heterogeneous vehicles with different resources cooperate to accomplish a set of tasks.The distinct characters of MVCP are the duration of each task may vary within a given interval,and the objective is to allocate and schedule the vehicles to maximize the total time slacks between tasks given the deadline.The time slack represents the fleets capability to tolerate the temporal uncertainty.A model for MVCP is built and a solving method based on the Simulated Annealing Algorithm is proposed.The result of experiments shows the efficiency of the method.
multi-vehicle coordination varying duration Simulated Annealing Algorithm
Cheng Zhu Luohao Tang Weiming Zhang
Science and Technology on Information Systems Engineering Laboratory,National University of Defense Technology,Changsha,410073,China
国际会议
长沙
英文
2686-2691
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）