| The route planning and speed scheduling of container liner is an important guarantee to improve the operation quality of the route.With the continuous upsizing of container ships,the gradual increase in the number of connecting ports,and the gradual complexity of the route structure,it is necessary to consider the unbalanced flow direction and flow volatility of the freight demand between ports,as well as the differences in cargo volume at different times during the departure interval,and reasonably determine the connecting ports,order arrangement,ship type configuration,and segment speed of the route.It is not only beneficial to optimize the route,reduce the operating cost,increase the cargo volume and improve the voyage income,but also helpful to explore and improve the characteristics and modeling methods of the integrated decision-making problem of the container liner route planning and scheduling.Aiming at the influence of different cargo accumulation at different times during the departure interval on decision contents such as port selection,docking sequence arrangement,ship size allocation and segment speed optimization of container liner lines,as well as the complex relationship that leads to interaction and coupling of these decision contents,this is different from the previous planning studies dealing with port cargo demand.In this paper,the concept of multiple time Windows is introduced.On the basis of dealing with the different accumulative quantities of cargo at different times during port shifts,the integrated decision-making problem of route planning and speed scheduling for container liners considering multiple time Windows is proposed from the perspective of synchronous and comprehensive consideration of the strategic and operational aspects of jointly determining route operation quality.A three-stage 0-1integer integrated decision model with ship type configuration,port selection,sequence arrangement,voyage duration and voyage speed as common decision variables is constructed,and a three-layer heuristic genetic algorithm is designed to optimize the results.In Chapter 5,three cases are designed,solved by model and algorithm,and the results of the cases are compared,which proves that the model and algorithm in this paper are effective,and the practicability is verified by sensitivity analysis. |