改进的D时刻表求解时间规划问题-计算应用技术专业论文.docxVIP

PAGE PAGE VI Abstract Abstract In this paper, we further discuss D_timetable of temporal planning and give the detailed account of the algorithms based on relation-matrix. Then, we add some new function to improve algorithm, and give the improved algorithm.At last, we design a general software system of temporal planning. We can get a deeper comprehension of the principle and mechanism from it. D_Timetable is one kind of excellent planning algorithms; it can solve some problems which are relationed by both temporal order and temporal interval. In the using of D_ Timetable planning algorithm, we find some limitation and faultiness place of it. The number of ranks of the reduced Temporal-Matrix might not be an even number; and the ranks are not corresponded to the original matrix. Some appended restrains are not considering in the algorithm, but these restrains often cant be neglected in the practical application The assignment of some temporal-pointers is decided only by relation restraining, but in practical application some assignment must be specified. The algorithm can solve single ingredient temporal planning, but when meet multi-ingerdient time relation, it hard to solve the problem. Although the algorithm of D_Timetable is excellent, but in some examples shown that the time complexity is still relatively high. In practical work, we add some new characteristics and operations to make it adapt to the real-environment even more. Add to it coalition-chains, record the corresponding relations between reduced temporal-matrix and original temporal-matrix. Add to it empty incident, adjust the lagging value of the temporal interval. Add to it relocation algorithm, adjust the assignment of the special temporal pointers. Abstract Making use of a genetic algorithm (GA) to solve the multi-ingerdient time relation, we give the algorithm how to solve D_timetable under multi-ingerdient time relation using Genetic algorithm. Its advantage greatly reduces complexity