| Since the 21 st century,as the country has increased its support for the construction industry,the scale of engineering projects has gradually increased,and construction companies have been carrying out more and more projects in the same area at the same time.The traditional construction method of pouring on site is no longer possible.To meet the construction needs of multi-project projects,the development of the prefabricated construction industry has become an inevitable trend,and PC component processing plants have also ushered in new opportunities.However,the project construction site has extremely strict requirements for the supply time of prefabricated PC components,which not only affects the construction progress of the project,but also affects the logistics cost of the component processing plant.Therefore,arranging a scientific and reasonable vehicle scheduling system for component processing plants has become an urgent problem to be solved in the supply chain of prefabricated construction projects.Based on reading a large number of domestic and foreign documents,this article summarizes the research results of domestic and foreign scholars in various aspects from the three aspects of prefabricated construction,vehicle scheduling problems,and vehicle scheduling problems in the construction industry.At the same time,based on the theoretical basis of the prefabricated building supply chain and general vehicle scheduling problems,the process and characteristics of the prefabricated building PC component vehicle scheduling are studied and analyzed.Secondly,in view of the problem of simultaneous delivery of a single prefabricated component processing plant to multiple construction sites under the same construction company,with the goal of minimizing the total cost of component processing plant delivery,an optimization model for prefabricated building PC component vehicle scheduling was established.Subsequently,in view of the disadvantages of the basic wolf group algorithm that it is easy to fall into the local optimal solution and the slow convergence speed,an improved wolf group algorithm is proposed to solve the vehicle scheduling problem.Finally,based on the distribution of the S component processing plant to the five construction sites of the R construction enterprise in a certain area,the basic wolf pack algorithm and the improved wolf pack algorithm are solved respectively,and the vehicle routes and costs obtained by the two algorithms are compared.The feasibility and rationality of theimproved wolf pack algorithm are verified.It provides a certain reference value for the vehicle scheduling management of the component processing plant in the future. |
