Research On The Optimization Of Food Consignment On The Large-scale Marine

For a long-term navigational large-scale marine,it is necessary to offer a whole and independent life safeguard system.So it is an important and valuable work that how to plan the consignment of purveyance so as to ensure the high efficiency of food cooking.Focusing on the goal of higher efficiency and lower cost,this paper mainly studied the problem of optimizing food consignment.And the theory and means of logistics are used in the solution of the problem.According to the different traits of consignments of different quantities of food,the problem of food consignment is abstracted into some models of logistics and operational research. At the same time,restrictions according with the actual large-scale marine are added to the models.These models are multi-depot vehicle routing problem (MDVRP) with restriction of limited repertory,transportation problem(TP) with restriction of half filled pushcart and channels jam,shortest path problem(SPP) applied in three-dimensional meshwork.And relevant resolvents have been designed.At last,the computing means have been programmed by using C++ language.The program is suitable for the plan of food consignment and collocation of correlative establishment on large-scale marines.It is a partly in-depth research on the problem of food consignment on large-scale marine,and provides a theory reference for daily food safeguard of large-scale marine.