考虑车辆限载的危险品运输车辆调度模型.

This paper focused on hazardous materials vehicle scheduling between multiple routes. A mixed integer programming model was formulated to maximize profit and minimize the risk cost of the densely populated area, and the effect of limited capacity of vehicle and scheduling cost was involved explicitly. The main decisions were determining transportation price and vehicle scheduling. Using hierarchical solving method, we presented optimal vehicle quantity without generalized allocating cost and time constraints to allocating capacity firstly. Then, a search procedure was put forward to check the feasibility of it to time constraints, and optimal vehicle quantity that satisfied to time constraints was given, which is proved at mathematics. Finally, on this basis the search mechanism was revised to calculate the minimum of generalized vehicle allocation cost. The validity of it was verified by the numerical examples. Compared with the case that there is no vehicle allocating between different routes, the model with vehicle scheduling could reduce transportation price and increase realized demands. [ABSTRACT FROM AUTHOR]