The essay analyzes the marshalling requirement of shunting plan for train detaching and attaching,and puts forward the problem of shunting trip plan could be solved by using radix sort algorithm,so the shunting mathematicization could be reached,and the sort based on trainset serial had been realized on the CIPS of Chengdu Norther marshalling station.

In this paper,radix sort using distributing counting sort method is put forward.

A new practical "in-place" sorting algorithm,called super quick sort,is obtained by merging some characteristics of radix sort and quick sort.

The positive region based on radix sorting is used to get the positive region condition attributes set of decision attributes and the condition attribute set which excludes one of the condition attributes of decision attribute positive region.

By profound exploration on radix sorting algorithm and using of its ideas as “distribution” and “collection”, together with the binary data s feature——Bit Sectional Sorting, a kind of non-comparative sorting algorithm has been developed.

Correctness of a classic sorting algorithm of linear time complexity and realization of radix sorting were proved and the time complexity of it was analyzed from the viewpoint of the "big-O notation".

Based on study of base sorting,a new base sorting algorithm is proposed.

In this paper, based on study of base sorting and its language implementing technology,a new base sorting algorithm is proposed .

Using JSP based in the sort of the middle value of the base of the tree structure of the BBS, given the data structure and the specific design of the algorithm.

This thesis discusses a method to determine the weight value of influencing factors of towing security,and introduces the application of sorting index for the degree of importance,meanwhile discusses the method of variable weight synthesizing decision using in ship towing.