| With the rapid development of the world economy, the integrated model of economy has been formed with all walks of life, no exception about the container liner shipping industry. Break-bulk liner shipping is substituting by container liner shipping, because liner shipping has the advantage of low cost, high efficiency, high security and low environmental impact. However, recently, container transport capacity is surplus for it is glut on the market. The shipping company has to think about themselves under turbulent economic situation and the brutal market competition. In order to reduce the cost of container transportation, improve container transport efficiency and improve customer satisfaction, choosing an optimal affiliated port set from the candidate and optimizing the container liner route planning for liner shipping in a given area is very important.Two problems were studied in this paper, the schedule design of container liner and optimizing ship route. The maximization of container liner transportation revenue mathematical model was established in this article under surround type. For solving this model, this paper applied the improved ant colony algorithm. First, we got the different set of hub and feed port from numerous candidate ports using the improved ant colony algorithm, gained the calling sequence for the hub port, and for each of the feeding port, we also got the optimal hubs. Actually, when some Container liner company transport goods in transportation activities, transfer prices are not fixed, there are certain volatility, therefore, we use transport price coefficient in route optimization model to adjust port between transport costs. Actually, we built the suitable optimization route for different transfer coefficient. Third, this paper draws a comparison between different types about their respective profit. Finally, we designed schedule for the optimized route applying the relative formula. Through the analysis of the related content, this article points out that the route optimization problem is NP-hard problem, to solve the model, we use proved GA. In the end, we solve an example using what we studied in this paper. |