The Properties Of Permanent And Its Application In Container Optimization

Permanent is a special function of a matrix.In mathematics, especially in linear algebra it is a polynomial similar to the determinant. It plays an important role in probability theory, combina-torial mathematics, molecular chemistry, wireless communication, statistical physics, computer science especially in graph theory and computational complexity theory.It is proved by Valiant that the computation of permanent is a#P-hard problem.The application of permanent is restrict-ed because of the complexity of its computation. The best algorithm for precise computation is the Ryser method, but it is only usefull for low-order matrix.For the high-order matrix one way is to change the algorithm according to the structure of the matrix.The paper introduces the properties and several exact algorithms of permanent and focous on the computing problem in container optimization using order statistics.The optimization of storage space in container storage yard is one of the main aspects in container optimization.In this paper,we take the arrival time of trailers as independent but not identically distributed random variables, and discuss the probability of trailer A earlier than trailer B. With the properties of order statistics and permanent, we get the expression of containers’submit order. Taking advantage of block matrix we get the feasibility method of our problem.