Optimizing Highway Transportation Network at Postal Service
Yang Jian-yi · Science Technology and Engineering · 2008
On the basis of describing the highway transportation network at postal service problem naturally, the model of the problem is built . The solving tactics of searching backup trips using k-shortest paths and optimizing model using mix integer programming are presented. The k-shortest paths algorithm for searching the backup trips and the CPLEX model for the problem are designed. The computational results demonstrate that the high quality solutions to the highway transportation network at postal service problem can be obtained by using the new algorithm and CPLEX model, and the new algorithm and CPLEX model are also efficient.