Optimization algorithm of branch transportation route for container ship
Optimization algorithm of branch transportation route for container ship
复制标题
DOI:
--
复制
发表时间:
2011
影响因子:
--
通讯作者:
Wang Qing-bin
中科院分区:
文献类型:
--
作者:
Wang Qing-bin
On the basis of the limit time of hub port ship and branch ship capacity,hub-and-spoke network transportation model was analyzed.Taking the total minimum navigation time of ship as objective function,the mixed integer programming model of branch container transportation model was set up.Hybridization and variation were realized by designing itinerant route method,the structure of solution was updated,and genetic algorithm was used to solve the model.Calculation result indicates that when ship capacity is 150 TEU,the total navigation time is 708.6 h,and the route number is 8 after 160 times iteration.When the ship capacities are 100 and 150 TEU respectively,the total navigation time is 714.6 h,and the route number is 9 after 150 times iteration.Through the variance analysis of the limit time of hub port ship and branch ship capacity,the probability values of F test statistics are almost less than 0.05 significantly.Through the sensitivity analysis of branch ship capacity and running cost,while there is higher ship capacity,there are lower route number and navigation time,but there is higher running cost.When there is the bigger limit time of hub port ship,there is lower route number.While considering navigation time and running cost,the ship capacity of 150 TEU is most reasonable.6 tabs,7 figs,15 refs.