A dynamic analysis of agile vehicle routing problem under complex information

‘Reasonable logistics distribution’ is the essential guarantee with agile logistics. But the vehicle routing problem, as the traditional model for logistics distribution, fails behind the need for agile logistics. By analysis of the characteristics of agile logistics and different kinds of information, a new model for agile vehicle routing problem under complex information, which includes both deterministic information and stochastic one, is given. Utilizing knowledge of queue theory, combinatorial optimization and stochastic geometry, the dynamic policy is given as the optimal solution. Numerical experiments are conducted to investigate the new model, and to assess the effectiveness of the dynamic policy by comparing it with the traditional way.